Subdimensional expansion and optimal task reassignment

Abstract

Multirobot path planning and task assignment are traditionally treated separately, however task assignment can greatly impact the difficulty of the path planning problem, and the ultimate quality of solution is dependent upon both. We introduce task reassignment, an approach to optimally solving the coupled task assignment and path planning problems. We show that task reassignment improves solution quality, and reduces planning time in some situations. Copyright © 2012, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved.