AAAI

Association for the Advancement of Artificial Intelligence

Home > Proceedings / Proceedings of the International Symposium on Combinatorial Search, 14

Multi-Agent Pickup and Delivery with Task Deadlines

Authors

Xiaohu Wu,Yihao Liu,Xueyan Tang,Wentong Cai,Funing Bai,Gilbert Khonstantine,Guopeng Zhao

Nanyang Technological University,Nanyang Technological University,Nanyang Technological University,Nanyang Technological University,NCS Group,Nanyang Technological University,NCS Group


Proceedings:

Proceedings of the International Symposium on Combinatorial Search, 14

Volume

Issue:

Vol. 14 No. 1 (2021): Fourteenth International Symposium on Combinatorial Search

Track:

Extended Abstracts

Downloads:

Download PDF

Abstract:

We study the multi-agent pickup and delivery problem with task deadlines, where a team of agents execute tasks with individual deadlines to maximize the number of tasks completed by their deadlines. We take an integrated approach that assigns and plans one task at a time taking into account the agent states resulting from all the previous task assignments and path planning. We define metrics to effectively determine which agent ought to execute a given task and which task is most worth assignment next. We leverage the bounding technique to greatly improve the computational efficiency.

DOI:

10.1609/socs.v12i1.18585


SOCS

Vol. 14 No. 1 (2021): Fourteenth International Symposium on Combinatorial Search