计算机科学
钥匙(锁)
启发式
架空(工程)
运动规划
预处理器
路径(计算)
比例(比率)
任务(项目管理)
最短路径问题
分布式计算
移动机器人
质量(理念)
机器人
实时计算
人工智能
理论计算机科学
工程类
图形
系统工程
哲学
程序设计语言
物理
量子力学
操作系统
计算机安全
认识论
作者
Junlong Huang,Boyu Zhou,Zhengping Fan,Yilin Zhu,Yingrui Jie,Longwei Li,Hui Cheng
出处
期刊:IEEE robotics and automation letters
日期:2023-01-12
卷期号:8 (3): 1667-1674
被引量:26
标识
DOI:10.1109/lra.2023.3236573
摘要
Autonomous exploration in large-scale and complex environments is a challenging task. As the size of the environment increases, the significant overhead of exploration algorithms could overwhelm the computational capability of mobile platforms, prohibiting timely response to environmental changes. Meanwhile, the quality of exploration paths becomes increasingly important in larger scenes, as poorly selected paths greatly reduce efficiency. In this letter, a systematic framework is proposed to explore large-scale unknown environments. To enable high-frequency planning, a fast preprocessing of environmental information is presented, providing fundamental information to support high-frequency path planning. An path optimization formulation that comprehensively considers key factors about fast exploration is introduced. Further, an heuristic algorithm is devised to solve the NP-hard optimization problem, which empirically finds optimal solution in real time. Simulation results show the run time of our method is significantly shorter than existing ones. Our method completes exploration with the least time and shortest movement distance compared to current state-of-the-art methods.
科研通智能强力驱动
Strongly Powered by AbleSci AI