Abstract
H. Ma, W. Hoenig, S. Kumar, N. Ayanian and S. Koenig. Extended Abstract: Lifelong Path Planning with Kinematic Constraints for Multi-Agent Pickup and Delivery [Abstract]. In Symposium on Combinatorial Search (SoCS), pages 190-191, 2019.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.
Many publishers do not want authors to make their papers available electronically after the papers have been published. Please use the electronic versions provided here only if hardcopies are not yet available. If you have comments on any of these papers, please send me an email! Also, please send me your papers if we have common interests.
This page was automatically created by a bibliography maintenance system that was developed as part of an undergraduate research project, advised by Sven Koenig.