Balancing Exploration and Exploitation in Sampling-Based Motion Planning

被引:60
|
作者
Rickert, Markus [1 ]
Sieverling, Arne [2 ]
Brock, Oliver [2 ]
机构
[1] Fortiss GmbH, D-80333 Munich, Germany
[2] Tech Univ Berlin, Robot & Biol Lab, Fac Elect Engn & Comp Sci, D-10587 Berlin, Germany
关键词
Balancing exploration and exploitation; path planning for manipulators; sampling strategy; PROBABILISTIC ROADMAPS; ALGORITHMS;
D O I
10.1109/TRO.2014.2340191
中图分类号
TP24 [机器人技术];
学科分类号
080202 ; 1405 ;
摘要
We present the exploring/exploiting tree (EET) algorithm for motion planning. The EET planner deliberately trades probabilistic completeness for computational efficiency. This tradeoff enables the EET planner to outperform state-of-the-art sampling-based planners by up to three orders of magnitude. We show that these considerable speedups apply for a variety of challenging real-world motion planning problems. The performance improvements are achieved by leveraging work space information to continuously adjust the sampling behavior of the planner. When the available information captures the planning problem's inherent structure, the planner's sampler becomes increasingly exploitative. When the available information is less accurate, the planner automatically compensates by increasing local configuration space exploration. We show that active balancing of exploration and exploitation based on workspace information can be a key ingredient to enabling highly efficient motion planning in practical scenarios.
引用
收藏
页码:1305 / 1317
页数:13
相关论文
共 50 条
  • [1] Sampling-Based Optimal Motion Planning With Smart Exploration and Exploitation
    Wang, Zhuping
    Li, Yunsong
    Zhang, Hao
    Liu, Chun
    Chen, Qijun
    [J]. IEEE-ASME TRANSACTIONS ON MECHATRONICS, 2020, 25 (05) : 2376 - 2386
  • [2] Balancing exploration and exploitation in motion planning
    Rickert, Markus
    Brock, Oliver
    Knoll, Alois
    [J]. 2008 IEEE INTERNATIONAL CONFERENCE ON ROBOTICS AND AUTOMATION, VOLS 1-9, 2008, : 2812 - +
  • [3] Machine Learning Guided Exploration for Sampling-based Motion Planning Algorithms
    Arslan, Oktay
    Tsiotras, Panagiotis
    [J]. 2015 IEEE/RSJ INTERNATIONAL CONFERENCE ON INTELLIGENT ROBOTS AND SYSTEMS (IROS), 2015, : 2646 - 2652
  • [4] Dynamic Programming Guided Exploration for Sampling-based Motion Planning Algorithms
    Arslan, Oktay
    Tsiotras, Panagiotis
    [J]. 2015 IEEE INTERNATIONAL CONFERENCE ON ROBOTICS AND AUTOMATION (ICRA), 2015, : 4819 - 4826
  • [5] Non-Parametric Informed Exploration for Sampling-Based Motion Planning
    Joshi, Sagar Suhas
    Panagiotis, Tsiotras
    [J]. 2019 INTERNATIONAL CONFERENCE ON ROBOTICS AND AUTOMATION (ICRA), 2019, : 5915 - 5921
  • [6] Sampling-Based Robot Motion Planning
    Salzman, Oren
    [J]. COMMUNICATIONS OF THE ACM, 2019, 62 (10) : 54 - 63
  • [7] Adversarial Sampling-Based Motion Planning
    Nichols, Hayden
    Jimenez, Mark
    Goddard, Zachary
    Sparapany, Michael
    Boots, Byron
    Mazumdar, Anirban
    [J]. IEEE ROBOTICS AND AUTOMATION LETTERS, 2022, 7 (02) : 4267 - 4274
  • [8] Sampling-Based Motion Planning: A Survey
    Lopez, Abraham Sanchez
    Zapata, Rene
    Lama, Maria A. Osorio
    [J]. COMPUTACION Y SISTEMAS, 2008, 12 (01): : 5 - 24
  • [9] Using Load Balancing to Scalably Parallelize Sampling-Based Motion Planning Algorithms
    Fidel, Adam
    Jacobs, Sam Ade
    Sharma, Shishir
    Amato, Nancy M.
    Rauchwerger, Lawrence
    [J]. 2014 IEEE 28TH INTERNATIONAL PARALLEL AND DISTRIBUTED PROCESSING SYMPOSIUM, 2014,
  • [10] Efficient Sampling-Based Planning for Subterranean Exploration
    Ahmad, Shakeeb
    Humbert, J. Sean
    [J]. 2022 IEEE/RSJ INTERNATIONAL CONFERENCE ON INTELLIGENT ROBOTS AND SYSTEMS (IROS), 2022, : 7114 - 7121