.png){kind=icon}
Return
Solving the Multiagent Pathfinding Problem with Time-Expanded Networks
.png){kind=icon}
PRE
AI
DOI：10.1287/ijoc.2024.0951.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The Multiagent Pathfinding Problem involves determining optimal, collision-free routes for a fleet of multiple autonomous vehicles from current positions to prescribed (goal) positions within a transportation or logistics facility such as a port terminal or a warehouse. This paper describes an exact algorithm for the problem, in which a sequence of reduced Mixed Integer Programming problems is solved iteratively on suitably defined time-expanded networks until an optimal solution is found. Computational results show that our approach outperforms a state-of-the-art solution algorithm on various mediumand large-sized instances. Additionally, we provide several managerial insights.
Keywords:
multiagent pathfinding problem
conflict-free vehicle routing and scheduling
time-expanded networks
exact algorithms
Journal
I
IF:
2.1
Papers:
90
Citations:
3.2K
Organization
Cited Papers
Local and random searches for dispatch and conflict-free routing problem of capacitated AGV systems
.png){kind=icon}
PREAI
ShareSaveDynamic discretization discovery for the service network design problem with mixed autonomous fleets
OAAI
OAAIShareSaveShareSave
View more