Asynchronous Spatial-Temporal Allocation for Trajectory Planning of Heterogeneous Multi-Agent Systems
To plan the trajectories of a large-scale heterogeneous swarm, sequentially or synchronously distributed methods usually become intractable due to the lack of global clock synchronization. To this end, we provide a novel asynchronous spatial-temporal allocation method. Specifically, between a pair of agents, the allocation is proposed to determine their corresponding derivable time-stamped space and can be updated in an asynchronous way, by inserting a waiting duration between two consecutive replanning steps. It is theoretically shown that the inter-agent collision is avoided and the allocation ensures timely updates. Comprehensive simulations and comparisons with state-of-the-art baselines validate the effectiveness of the proposed method and illustrate its improvement in completion time and moving distance. Finally, hardware experiments are carried out, where 8 heterogeneous unmanned ground vehicles with onboard computation navigate in cluttered scenarios with high agility.
Authors
- Yuda Chen (ORCID: https://orcid.org/0000-0001-5674-7400)
- Zhongkui Li (ORCID: https://orcid.org/0000-0002-9361-4305)
- Haoze Dong
Institutions
- Peking University (CN)
- State Key Laboratory of Turbulence and Complex Systems
Publication Details
- Published
- 2024-10-14
- DOI
- https://doi.org/10.1109/iros58592.2024.10801393
- Citations
- 3
- Primary Topic
- Robotic Path Planning Algorithms
- Type
- article
- Field-Weighted Citation Impact
- 0.75
Funders
- National Natural Science Foundation of China
- National Science and Technology Major Project