Abstract
This is an extended abstract of a previously published paper at AAAI 2019 (Ma et al. 2019). We study the Multi-Agent Pickup and Delivery (MAPD) problem where a large number of agents attend to a stream of incoming pickup-and-delivery tasks. We present an efficient and effective MAPD algorithm that can compute paths with continuous agent movements for hundreds of agents and thousands of tasks in seconds.
Cite
CITATION STYLE
Ma, H., Honig, W., Satish Kumar, T. K., Ayanian, N., & Koenig, S. (2019). Extended abstract: Lifelong path planning with kinematic constraints for multi-agent pickup and delivery? In Proceedings of the 12th International Symposium on Combinatorial Search, SoCS 2019 (pp. 190–191). AAAI Press. https://doi.org/10.1609/socs.v10i1.18485
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
