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
来源
IEEE ROBOTICS AND AUTOMATION LETTERS | 2022年 / 7卷 / 02期
关键词
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 条
  • [21] Hybrid Safety Certificate for Fast Collision Checking in Sampling-Based Motion Planning
    Shi, Shenglei
    Chen, Jiankui
    Li, Yiqun
    IEEE ROBOTICS AND AUTOMATION LETTERS, 2023, 8 (01) : 113 - 120
  • [22] Fast Nearest Neighbor Search in SE(3) for Sampling-Based Motion Planning
    Ichnowski, Jeffrey
    Alterovitz, Ron
    ALGORITHMIC FOUNDATIONS OF ROBOTICS XI, 2015, 107 : 197 - 214
  • [23] Selective Sampling-based Scalable Sparse Subspace Clustering
    Matsushima, Shin
    Brbic, Maria
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 32 (NIPS 2019), 2019, 32
  • [24] Design Space Exploration for Sampling-Based Motion Planning Programs with Combinatory Logic Synthesis
    Schaefer, Tristan
    Bessai, Jan
    Chaumet, Constantin
    Rehof, Jakob
    Riest, Christian
    ALGORITHMIC FOUNDATIONS OF ROBOTICS XV, 2023, 25 : 36 - 51
  • [25] Learning-Guided Exploration for Efficient Sampling-Based Motion Planning in High Dimensions
    Schramm, Liam
    Boularias, Abdeslam
    2022 IEEE INTERNATIONAL CONFERENCE ON ROBOTICS AND AUTOMATION (ICRA 2022), 2022, : 4429 - 4435
  • [26] Sampling-Based Methods for Motion Planning with Constraints
    Kingston, Zachary
    Moll, Mark
    Kavraki, Lydia E.
    ANNUAL REVIEW OF CONTROL, ROBOTICS, AND AUTONOMOUS SYSTEMS, VOL 1, 2018, 1 : 159 - 185
  • [27] Reducing Collision Checking for Sampling-Based Motion Planning Using Graph Neural Networks
    Yu, Chenning
    Gao, Sicun
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 34 (NEURIPS 2021), 2021, 34
  • [28] Advanced BIT* (ABIT*): Sampling-Based Planning with Advanced Graph-Search Techniques
    Strub, Marlin P.
    Gammell, Jonathan D.
    2020 IEEE INTERNATIONAL CONFERENCE ON ROBOTICS AND AUTOMATION (ICRA), 2020, : 130 - 136
  • [29] Efficient and scalable filtering of graph-based metadata
    Liu, HF
    Petrovic, M
    Jacobsen, HA
    JOURNAL OF WEB SEMANTICS, 2005, 3 (04): : 294 - 310
  • [30] A scalable algorithm for graph-based active learning
    Zhao, Wentao
    Long, Jun
    Zhu, En
    Liu, Yun
    FRONTIERS IN ALGORITHMICS, 2008, 5059 : 311 - 322