UFOExplorer: Fast and Scalable Sampling-Based Exploration With a Graph-Based Planning Structure

被引:22
|
作者
Duberg, Daniel [1 ]
Jensfelt, Patric [1 ]
机构
[1] KTH Royal Inst Technol, Div Robot Percept & Learning RPL, SE-10044 Stockholm, Sweden
来源
关键词
Notion and path planning; mapping; AUTONOMOUS EXPLORATION;
D O I
10.1109/LRA.2022.3142923
中图分类号
TP24 [机器人技术];
学科分类号
080202 ; 1405 ;
摘要
We propose UFOExplorer, a fast and efficient exploration method that scales well with the environment size. An exploration paradigm driven by map updates is proposed to enable the robot to react quicker and to always move towards the optimal exploration goal. For each map update, a dense graph-based planning structure is updated and extended. The planning structure is then used to generate a path using a simple exploration heuristic, which guides the robot towards the closest exploration goal. The proposed method scales well with the environment size, as the planning cost is amortized when updating and extending the planning structure. The simple exploration heuristic performs on par with the most recent state-of-the-art methods in smaller environments and outperforms them in larger environments, both in terms of exploration speed and computational efficiency. The implementation of the method is made available for future research.
引用
收藏
页码:2487 / 2494
页数:8
相关论文
共 50 条
  • [1] Efficient Sampling-Based Planning for Subterranean Exploration
    Ahmad, Shakeeb
    Humbert, J. Sean
    2022 IEEE/RSJ INTERNATIONAL CONFERENCE ON INTELLIGENT ROBOTS AND SYSTEMS (IROS), 2022, : 7114 - 7121
  • [2] Balancing Exploration and Exploitation in Sampling-Based Motion Planning
    Rickert, Markus
    Sieverling, Arne
    Brock, Oliver
    IEEE TRANSACTIONS ON ROBOTICS, 2014, 30 (06) : 1305 - 1317
  • [3] A scalable method for parallelizing sampling-based motion planning algorithms
    Jacobs, Sam Ade
    Manavi, Kasra
    Burgos, Juan
    Denny, Jory
    Thomas, Shawna
    Amato, Nancy M.
    Proceedings - IEEE International Conference on Robotics and Automation, 2012, : 2529 - 2536
  • [4] A Scalable Method for Parallelizing Sampling-Based Motion Planning Algorithms
    Jacobs, Sam Ade
    Manavi, Kasra
    Burgos, Juan
    Denny, Jory
    Thomas, Shawna
    Amato, Nancy M.
    2012 IEEE INTERNATIONAL CONFERENCE ON ROBOTICS AND AUTOMATION (ICRA), 2012, : 2529 - 2536
  • [5] Fast and Compute-Efficient Sampling-Based Local Exploration Planning via Distribution Learning
    Schmid, Lukas
    Ni, Chao
    Zhong, Yuliang
    Siegwart, Roland
    Andersson, Olov
    IEEE ROBOTICS AND AUTOMATION LETTERS, 2022, 7 (03) : 7810 - 7817
  • [6] Sampling-Based Optimal Motion Planning With Smart Exploration and Exploitation
    Wang, Zhuping
    Li, Yunsong
    Zhang, Hao
    Liu, Chun
    Chen, Qijun
    IEEE-ASME TRANSACTIONS ON MECHATRONICS, 2020, 25 (05) : 2376 - 2386
  • [7] Machine Learning Guided Exploration for Sampling-based Motion Planning Algorithms
    Arslan, Oktay
    Tsiotras, Panagiotis
    2015 IEEE/RSJ INTERNATIONAL CONFERENCE ON INTELLIGENT ROBOTS AND SYSTEMS (IROS), 2015, : 2646 - 2652
  • [8] Dynamic Programming Guided Exploration for Sampling-based Motion Planning Algorithms
    Arslan, Oktay
    Tsiotras, Panagiotis
    2015 IEEE INTERNATIONAL CONFERENCE ON ROBOTICS AND AUTOMATION (ICRA), 2015, : 4819 - 4826
  • [9] Non-Parametric Informed Exploration for Sampling-Based Motion Planning
    Joshi, Sagar Suhas
    Panagiotis, Tsiotras
    2019 INTERNATIONAL CONFERENCE ON ROBOTICS AND AUTOMATION (ICRA), 2019, : 5915 - 5921
  • [10] Bayesian Local Sampling-Based Planning
    Lai, Tin
    Morere, Philippe
    Ramos, Fabio
    Francis, Gilad
    IEEE ROBOTICS AND AUTOMATION LETTERS, 2020, 5 (02): : 1954 - 1961