TY - JOUR
T1 - 4WIDS-MAPF
T2 - Multi-Agent Pathfinding for Four-Wheel Independent Drive/Steering Robots
AU - Zhang, Lin
AU - Zhang, Tianyuan
AU - An, Yichen
AU - Niu, Tianwei
AU - Wang, Shoukun
AU - Wang, Junzheng
N1 - Publisher Copyright:
© 2014 IEEE.
PY - 2025
Y1 - 2025
N2 - Modern autonomous systems face significant challenges in coordinating multiple agents within complex environments, especially under non-holonomic constraints and kinodynamic motion planning demands. In particular, four-wheel independent drive/steering (4WIDS) robots, with their multimodal locomotion and non-holonomic kinematics, introduce new complexity to multi-agent pathfinding problems in continuous space. This study addresses the critical challenge of generating collision-free, dynamically feasible paths for multi-4WIDS robot systems. We propose a hierarchical MAPF framework that explicitly tackles two core limitations in existing methods: (1) a lack of physically realistic inter-agent conflict modeling, and (2) the inability to account for motion mode switching costs in kinodynamic path planning. At the upper level, we introduce a continuous-space binary conflict tree for resolving space-time collisions using physical dimensions and motion feasibility. At the lower level, we implement a hybrid A* search over a motion primitive database that considers mode-switch penalties and kinematic constraints. To improve search performance, we introduce two novel mechanisms: a focused search factor for directional exploration and an adaptive heuristic weighting factor to balance optimality and computational speed. Extensive experiments, including benchmark comparisons, ablation studies, and sensitivity analysis, validate the proposed method’s superior performance in inter-agent conflict resolution, real-time feasibility, and path quality.
AB - Modern autonomous systems face significant challenges in coordinating multiple agents within complex environments, especially under non-holonomic constraints and kinodynamic motion planning demands. In particular, four-wheel independent drive/steering (4WIDS) robots, with their multimodal locomotion and non-holonomic kinematics, introduce new complexity to multi-agent pathfinding problems in continuous space. This study addresses the critical challenge of generating collision-free, dynamically feasible paths for multi-4WIDS robot systems. We propose a hierarchical MAPF framework that explicitly tackles two core limitations in existing methods: (1) a lack of physically realistic inter-agent conflict modeling, and (2) the inability to account for motion mode switching costs in kinodynamic path planning. At the upper level, we introduce a continuous-space binary conflict tree for resolving space-time collisions using physical dimensions and motion feasibility. At the lower level, we implement a hybrid A* search over a motion primitive database that considers mode-switch penalties and kinematic constraints. To improve search performance, we introduce two novel mechanisms: a focused search factor for directional exploration and an adaptive heuristic weighting factor to balance optimality and computational speed. Extensive experiments, including benchmark comparisons, ablation studies, and sensitivity analysis, validate the proposed method’s superior performance in inter-agent conflict resolution, real-time feasibility, and path quality.
KW - enhanced conflict-based search
KW - four-wheel independent drive/steering robot
KW - Multi-agent path finding
KW - suboptimal solution acceleration
UR - http://www.scopus.com/pages/publications/105010308031
U2 - 10.1109/JIOT.2025.3587737
DO - 10.1109/JIOT.2025.3587737
M3 - Article
AN - SCOPUS:105010308031
SN - 2327-4662
JO - IEEE Internet of Things Journal
JF - IEEE Internet of Things Journal
ER -