Dynamic path finding for multi-load agent pickup and delivery problem

DOI10.1016/j.tcs.2024.114897MaRDI QIDQ6652428

H.-J. Huang, Hongwei David Du, Yifei Li, Ruixi Huang, Hao Ye

Publication date: 12 December 2024

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

optimizationdynamic path findingmulti-load agent systemreal-time task planning

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Distributed algorithms (68W15)

Cites Work

• A matheuristic for AGV scheduling with battery constraints
• Conflict-based search for optimal multi-agent pathfinding
• Scheduling heterogeneous multi-load AGVs with battery constraints
• The vehicle routing problem
• Enhanced Partial Expansion A*

This page was built for publication: Dynamic path finding for multi-load agent pickup and delivery problem