Optimistic Motion Planning Using Recursive Sub-Sampling: A New Approach to Sampling-Based Motion Planning

被引:3
|
作者
Kenye, Lhilo [1 ,2 ]
Kala, Rahul [1 ]
机构
[1] Indian Inst Informat Technol Allahabad, Ctr Intelligent Robot, Allahabad, Uttar Pradesh, India
[2] NavAjna Technol Private Ltd, Hyderabad, India
关键词
Probabilistic Roadmap; Sampling-Based Motion Planning; Robot Motion Planning; Robotics; PATH;
D O I
10.9781/ijimai.2022.04.001
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Sampling-based motion planning in the field of robot motion planning has provided an effective approach to finding path for even high dimensional configuration space and with the motivation from the concepts of sampling based-motion planners, this paper presents a new sampling-based planning strategy called Optimistic Motion Planning using Recursive Sub-Sampling (OMPRSS), for finding a path from a source to a destination sanguinely without having to construct a roadmap or a tree. The random sample points are generated recursively and connected by straight lines. Generating sample points is limited to a range and edge connectivity is prioritized based on their distances from the line connecting through the parent samples with the intention to shorten the path. The planner is analysed and compared with some sampling strategies of probabilistic roadmap method (PRM) and the experimental results show agile planning with early convergence.
引用
收藏
页码:87 / 99
页数:13
相关论文
共 50 条
  • [31] Sampling-based Motion Planning with Deterministic μ-Calculus Specifications
    Karaman, Sertac
    Frazzoli, Emilio
    [J]. PROCEEDINGS OF THE 48TH IEEE CONFERENCE ON DECISION AND CONTROL, 2009 HELD JOINTLY WITH THE 2009 28TH CHINESE CONTROL CONFERENCE (CDC/CCC 2009), 2009, : 2222 - 2229
  • [32] Sampling-based roadmap of trees for parallel motion planning
    Plaku, E
    Bekris, KE
    Chen, BY
    Ladd, AM
    Kavraki, LE
    [J]. IEEE TRANSACTIONS ON ROBOTICS, 2005, 21 (04) : 597 - 608
  • [33] Anytime Solution Optimization for Sampling-Based Motion Planning
    Luna, Ryan
    Sucan, Ioan A.
    Moll, Mark
    Kavraki, Lydia E.
    [J]. 2013 IEEE INTERNATIONAL CONFERENCE ON ROBOTICS AND AUTOMATION (ICRA), 2013, : 5068 - 5074
  • [34] Scaling Sampling-based Motion Planning to Humanoid Robots
    Yang, Yiming
    Ivan, Vladimir
    Merkt, Wolfgang
    Vijayakumar, Sethu
    [J]. 2016 IEEE INTERNATIONAL CONFERENCE ON ROBOTICS AND BIOMIMETICS (ROBIO), 2016, : 1448 - 1454
  • [35] Sampling-based optimal kinodynamic planning with motion primitives
    Sakcak, Basak
    Bascetta, Luca
    Ferretti, Gianni
    Prandini, Maria
    [J]. AUTONOMOUS ROBOTS, 2019, 43 (07) : 1715 - 1732
  • [36] Sampling-based optimal kinodynamic planning with motion primitives
    Basak Sakcak
    Luca Bascetta
    Gianni Ferretti
    Maria Prandini
    [J]. Autonomous Robots, 2019, 43 : 1715 - 1732
  • [37] Parallel Sampling-Based Motion Planning with Superlinear Speedup
    Ichnowski, Jeffrey
    Alterovitz, Ron
    [J]. 2012 IEEE/RSJ INTERNATIONAL CONFERENCE ON INTELLIGENT ROBOTS AND SYSTEMS (IROS), 2012, : 1206 - 1212
  • [38] Tunnel detection in protein structures using sampling-based motion planning
    Vonasek, Vojtech
    Kozlikova, Barbora
    [J]. 2017 11TH INTERNATIONAL WORKSHOP ON ROBOT MOTION AND CONTROL (ROMOCO), 2017, : 185 - 192
  • [39] Optimal Kinodynamic Motion Planning using Incremental Sampling-based Methods
    Karaman, Sertac
    Frazzoli, Emilio
    [J]. 49TH IEEE CONFERENCE ON DECISION AND CONTROL (CDC), 2010, : 7681 - 7687
  • [40] Factorization of Multi-Agent Sampling-Based Motion Planning
    Zanardi, Alessandro
    Zullo, Pietro
    Censi, Andrea
    Frazzoli, Emilio
    [J]. 2023 62ND IEEE CONFERENCE ON DECISION AND CONTROL, CDC, 2023, : 8108 - 8115