Arrow Research search
Back to SoCS

SoCS 2012

Subdimensional Expansion and Optimal Task Reassignment

Conference Paper Short Papers Algorithms and Complexity · Artificial Intelligence · Automated Planning and Scheduling

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.

Authors

Keywords

  • Multirobot Path Planning
  • Task Assignment
  • Optimal Path Planning

Context

Venue
International Symposium on Combinatorial Search
Archive span
2010-2024
Indexed papers
598
Paper id
454151200035902642