Autonomous UAV Exploration of Dynamic Environments Via Incremental Sampling and Probabilistic Roadmap

• Published in: IEEE robotics and automation letters Vol. 6; no. 2; pp. 2729 - 2736
• Main Authors: Xu, Zhefan, Deng, Di, Shimada, Kenji
• Format: Journal Article
• Language: English
• Published: Piscataway IEEE 01.04.2021; The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
• Subjects: Collision avoidance; Computing time; Exploration; Mapping; motion and path planning; Planning; Probability theory; Robot sensing systems; Robots; Sampling; search and rescue robots; Trajectory; Unknown environments; unmanned aerial vehicle; Unmanned aerial vehicles; Vehicle dynamics
• ISSN: 2377-3766; 2377-3766
• DOI: 10.1109/LRA.2021.3062008

Autonomous exploration requires robots to generate informative trajectories iteratively. Although sampling-based methods are highly efficient in unmanned aerial vehicle exploration, many of these methods do not effectively utilize the sampled information from the previous planning iterations, leading to redundant computation and longer exploration time. Also, few have explicitly shown their exploration ability in dynamic environments even though they can run real-time. To overcome these limitations, we propose a novel dynamic exploration planner (DEP) for exploring unknown environments using incremental sampling and Probabilistic Roadmap (PRM). In our sampling strategy, nodes are added incrementally and distributed evenly in the explored region, yielding the best viewpoints. To further shortening exploration time and ensuring safety, our planner optimizes paths locally and refine them based on the Euclidean Signed Distance Function (ESDF) map. Meanwhile, as the multi-query planner, PRM allows the proposed planner to quickly search alternative paths to avoid dynamic obstacles for safe exploration. Simulation experiments show that our method safely explores dynamic environments and outperforms the benchmark planners in terms of exploration time, path length, and computational time.