Heterogeneous Multirobot Coordination with Spatial and Temporal Constraints

Mary Koes, Illah Nourbakhsh and Katia Sycara
Conference Paper, Proceedings of the Twentieth National Conference on Artificial Intelligence (AAAI), pp. 1292-1297, June, 2005

View Publication

Copyright notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.


Existing approaches to multirobot coordination separate scheduling and task allocation, but finding the optimal schedule with joint tasks and spatial constraints requires robots to simultaneously solve the scheduling, task allocation, and path planning problems. We present a formal description of the multirobot joint task allocation problem with heterogeneous capabilities and spatial constraints and an instantiation of the problem for the search and rescue domain. We introduce a novel declarative framework for modeling the problem as a mixed integer linear programming (MILP) problem and present a centralized anytime algorithm with error bounds. We demonstrate that our algorithm can outperform standard MILP solving techniques, greedy heuristics, and a market based approach which separates scheduling and task allocation.

Thanks too to iLog Corporation for their generous support

author = {Mary Koes and Illah Nourbakhsh and Katia Sycara},
title = {Heterogeneous Multirobot Coordination with Spatial and Temporal Constraints},
booktitle = {Proceedings of the Twentieth National Conference on Artificial Intelligence (AAAI)},
year = {2005},
month = {June},
pages = {1292-1297},
publisher = {AAAI Press},
keywords = {Multirobot coordination, Integer Linear Programming},
} 2017-09-13T10:43:23-04:00