Dynamic Free-Space Roadmap for Safe Quadrotor Motion Planning
Junlong Guo, Zhiren Xun, Shuang Geng, Yi Lin, Chao Xu, and Fei Gao

TL;DR
This paper introduces a dynamic free-space roadmap that adaptively updates safe regions and navigation graphs for quadrotor motion planning in environments with moving obstacles, enhancing safety and applicability.
Contribution
The paper presents a novel dynamic free-space roadmap that continuously updates safe regions and navigation graphs for quadrotors in dynamic environments, overcoming static environment limitations.
Findings
Effective in dynamic obstacle environments
Validated through extensive simulations and real-world tests
Improves safety and planning efficiency
Abstract
Free-space-oriented roadmaps typically generate a series of convex geometric primitives, which constitute the safe region for motion planning. However, a static environment is assumed for this kind of roadmap. This assumption makes it unable to deal with dynamic obstacles and limits its applications. In this paper, we present a dynamic free-space roadmap, which provides feasible spaces and a navigation graph for safe quadrotor motion planning. Our roadmap is constructed by continuously seeding and extracting free regions in the environment. In order to adapt our map to environments with dynamic obstacles, we incrementally decompose the polyhedra intersecting with obstacles into obstacle-free regions, while the graph is also updated by our well-designed mechanism. Extensive simulations and real-world experiments demonstrate that our method is practically applicable and efficient.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsRobotic Path Planning Algorithms · Robotics and Sensor-Based Localization · Artificial Intelligence in Games
