Multi-load agent path finding for online pickup and delivery problem

DOI10.1007/978-3-031-49190-0_20MaRDI QIDQ6591478zbMATH OpenFDO

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

Publication date 22 August 2024

Full work available at URL https://doi.org/10.1007/978-3-031-49190-0_20

zbMATH Keywords

multi-load agentonline task planningoptimization

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68Rxx)

Cites work

• Conflict-based search for optimal multi-agent pathfinding
• Enhanced partial expansion A^*
• Scheduling heterogeneous multi-load AGVs with battery constraints

Cited in

(1)

• Task group allocation for multi-load agent pickup and delivery problem

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6591478)