Allowing non-submodular score functions in distributed task allocation
Name
How_Allowing non-submodular.pdf
Size
291.88 KB
Format
Adobe PDF
Checksum (MD5)
43d2dfc697aa05747a7eda4681a7e76c
Author(s)
Choi, Han-Lim
How, Jonathan P.
Johnson, Luke B.
Ponda, Sameera S.
Date Issued
December 2012
Journal
Proceedings of the 2012 IEEE 51st IEEE Conference on Decision and Control (CDC)
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Citation
Johnson, Luke, Han-Lim Choi, Sameera Ponda, and Jonathan P. How. “Allowing non-submodular score functions in distributed task allocation.” In 2012 IEEE 51st IEEE Conference on Decision and Control (CDC), 4702-4708. Institute of Electrical and Electronics Engineers, 2012.
Version
Author's final manuscript
Abstract
Submodularity is a powerful property that can be exploited for provable performance and convergence guarantees in distributed task allocation algorithms. However, some mission scenarios cannot easily be approximated as submodular a priori. This paper introduces an algorithmic extension for distributed multi-agent multi-task assignment algorithms which provides guaranteed convergence using non-submodular score functions. This algorithm utilizes non-submodular ranking of tasks within each agent's internal decision making process, while externally enforcing that shared bids appear as if they were created using submodular score functions. Provided proofs demonstrate that all convergence and performance guarantees hold with respect to this apparent submodular score function. The algorithm allows significant improvements over heuristic approaches that approximate truly non-submodular score functions.
MIT Department
Massachusetts Institute of Technology. Department of Aeronautics and Astronautics
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike 3.0
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1109/CDC.2012.6425867
