Collaborative Motion Planning for Multiple Tractor-Trailer Vehicles Based on Local Conflict Search and Priority Game Inheritance

This paper introduces a novel approach for efficiently planning collision-free optimal trajectories for multiple tractor-trailer vehicles (TTVs) in environments with dense obstacles. The approach employs a hierarchical planning strategy to generate the initial homotopy path: at the higher level, it integrates body collision model and enhances conflict resolution through local priority strategy. At the lower level, the Tractor-Trailer Spatiotemporal Hybrid State A* (TT-SHA*) is employed, combining joint expansion with heuristic methods to efficiently generate paths for individual agents, while accounting for underactuated and nonholonomic constraints. To resolve priority deadlock issues, the concept of priority inheritance and backtracking is integrated into conflict search, which significantly improves the success rate and solving speed. Finally, it refines the path solution into smooth trajectories using nonlinear optimization based on corridor and relative safety distance constraints. Experimental results show that the proposed method outperforms existing TTV-improved Multi-Agent Motion Planning algorithms in scalability when handling large-scale TTV scenarios, providing a solution that is applicable for practical implementation.

Authors

Institutions

Publication Details

Journal
IEEE Robotics and Automation Letters
Published
2025-06-06
DOI
https://doi.org/10.1109/lra.2025.3577462
Citations
1
Primary Topic
Robotic Path Planning Algorithms
Type
article
Field-Weighted Citation Impact
1.28

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Collaborative Motion Planning for Multiple Tractor-Trailer Vehicles Based on Local Conflict Search and Priority Game Inheritance

Longfei Su, Ming Yue, Xudong Zhao, Heyang Wang et al.
1 citations
IEEE Robotics and Automation Letters
Robotic Path Planning Algorithms
1.28
article

Collaborative Motion Planning for Multiple Tractor-Trailer Vehicles Based on Local Conflict Search and Priority Game Inheritance

Longfei Su, Ming Yue, Xudong Zhao, Heyang Wang, Xu Sun
article en
1 citations

Abstract

This paper introduces a novel approach for efficiently planning collision-free optimal trajectories for multiple tractor-trailer vehicles (TTVs) in environments with dense obstacles. The approach employs a hierarchical planning strategy to generate the initial homotopy path: at the higher level, it integrates body collision model and enhances conflict resolution through local priority strategy. At the lower level, the Tractor-Trailer Spatiotemporal Hybrid State A* (TT-SHA*) is employed, combining joint expansion with heuristic methods to efficiently generate paths for individual agents, while accounting for underactuated and nonholonomic constraints. To resolve priority deadlock issues, the concept of priority inheritance and backtracking is integrated into conflict search, which significantly improves the success rate and solving speed. Finally, it refines the path solution into smooth trajectories using nonlinear optimization based on corridor and relative safety distance constraints. Experimental results show that the proposed method outperforms existing TTV-improved Multi-Agent Motion Planning algorithms in scalability when handling large-scale TTV scenarios, providing a solution that is applicable for practical implementation.

IEEE Robotics and Automation LettersVol. 10(7)
Dalian University of Technology (CN)
National Natural Science Foundation of China
Openalex Percentile: Top 20%
Robotic Path Planning Algorithms
1.28
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.