Continuous-Space Multi-Agent Path Finding via Enhanced Prioritized Search With Ackermann Kinematic Constraints
- 6 April 2026
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Robotics and Automation Letters
- Vol. 11 (6) , 6688-6695
Abstract
Multi-Agent Path Finding (MAPF) in complex environments remains challenging due to high computational complexity, frequent conflicts, and realistic motion constraints. Most existing methods focus on discrete spaces or idealized omnidirectional models, often neglecting or partially considering nonholonomic constraints, which limits their applicability to real-world robotic systems. This letter proposes a hierarchical continuous-space MAPF framework explicitly designed for Ackermann-steered robots, balancing computational efficiency, global coordination, and motion feasibility. In the path search layer, a spatiotemporal hybrid A* algorithm with an adaptive dynamic weighting factor improves the trade-off between computational cost and path quality, while a homotopy-group clustering mechanism provides structured agent grouping for conflict resolution. In the conflict resolution layer, a partial-order priority reconstruction and flexible priority-based dynamic adjustment strategy effectively reduce search space and conflict density. The trajectory optimization layer integrates a decentralized sequential quadratic programming method to ensure trajectory feasibility and smoothness. Comprehensive experiments, including ablation, comparative, and scalability studies, demonstrate that the proposed method achieves lower runtime, reduced execution cost, and better coordination than existing MAPF approaches, while maintaining strong scalability in high-density environments.Keywords
Funding Information
- National Natural Science Foundation of China (62473044)
- BIT Research and Innovation Promoting Project (2024YCXZ007)
This publication has 25 references indexed in Scilit:
- Multi-Agent Deep Reinforcement Learning for Hybrid Motion Planning in Dynamic Environments2024
- Learning team-based navigation: a review of deep reinforcement learning techniques for multi-agent pathfindingArtificial Intelligence Review, 2024
- A review of graph-based multi-agent pathfinding solvers: From classical to beyond classicalKnowledge-Based Systems, 2023
- Tracking in Multi-Robot Systems with Non-Holonomic Constraints and Obstacle Avoidance2023
- Motion Planning of Mobile Robot with Non-holonomic Constraints2023
- Multi-UGVs Collaborative Path Planning and Conflicts Eliminating in Emergent Situations2023
- CL-MAPF: Multi-Agent Path Finding for Car-Like robots with kinematic and spatiotemporal constraintsRobotics and Autonomous Systems, 2022
- MAPPER: Multi-Agent Path Planning with Evolutionary Reinforcement Learning in Mixed Dynamic Environments2020
- Multi-AGV scheduling for conflict-free path planning in automated container terminalsComputers & Industrial Engineering, 2020
- Conflict-based search for optimal multi-agent pathfindingArtificial Intelligence, 2015