/Subdimensional Expansion and Optimal Task Reassignment.

Subdimensional Expansion and Optimal Task Reassignment.

Glenn Wagner, Howie Choset and Nora Ayanian
Conference Paper, Symposium on Combinatorial Search, July, 2012

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.

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.

Notes
http://www.aaai.org/ocs/index.php/SOCS/SOCS12/paper/view/5390/5199

BibTeX Reference
@conference{Wagner-2012-7559,
author = {Glenn Wagner and Howie Choset and Nora Ayanian},
title = {Subdimensional Expansion and Optimal Task Reassignment.},
booktitle = {Symposium on Combinatorial Search},
year = {2012},
month = {July},
keywords = {multirobot path planning, optimal path planning, task assignment},
}
2017-09-13T10:39:44+00:00