An Efficient Real-Time Planning Method for Swarm Robotics Based on an Optimal Virtual Tube
Pengda Mao, Shuli Lv, Chen Min, Zhaolong Shen, Quan Quan

TL;DR
This paper introduces a low-complexity, homotopic trajectory planning framework for swarm robotics that combines centralized optimal virtual tube planning with distributed control, enabling efficient real-time navigation in obstacle-rich environments.
Contribution
It proposes a novel homotopic trajectory planning method that unites the advantages of reactive and multi-step planners, suitable for resource-constrained swarm robots.
Findings
The method achieves $O(n_t)$ computational complexity, enabling practical large-scale planning.
Simulations and experiments validate rapid, low-cost replanning capabilities.
The framework effectively navigates unknown obstacle environments with swarm robots.
Abstract
Robot swarms navigating through unknown obstacle environments are an emerging research area that faces challenges. Performing tasks in such environments requires swarms to achieve autonomous localization, perception, decision-making, control, and planning. The limited computational resources of onboard platforms present significant challenges for planning and control. Reactive planners offer low computational demands and high re-planning frequencies but lack predictive capabilities, often resulting in local minima. Multi-step planners can make multi-step predictions to reduce deadlocks, but they require substantial computation, resulting in a lower replanning frequency. This paper proposes a novel homotopic trajectory planning framework for a robot swarm that combines centralized homotopic trajectory planning (optimal virtual tube planning) with distributed control, enabling…
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.
