Optimally Greedy Control of Team Dispatching Systems
Venkatesh G. Rao () and
Pierre T. Kabamba ()
Additional contact information
Venkatesh G. Rao: Cornell University
Pierre T. Kabamba: University of Michigan
A chapter in Cooperative Systems, 2007, pp 1-19 from Springer
Abstract:
Summary We introduce the team dispatching (TD) problem arising in cooperative control of multiagent systems, such as spacecraft constellations and UAV fleets. The problem is formulated as an optimal control problem similar in structure to queuing problems modeled by restless bandits. A near-optimality result is derived for greedy dispatching under oversubscription conditions, and used to formulate an approximate deterministic model of greedy scheduling dynamics. Necessary conditions for optimal team configuration switching are then derived for restricted TD problems using this deterministic model. Explicit construction is provided for a special case, showing that the most-oversubscribed-first (MOF) switching sequence is optimal when team configurations have low overlap in their processing capabilities. Simulation results for TD problems in multi-spacecraft interferometric imaging are summarized.
Keywords: Switching Cost; Multiagent System; Switching Time; Optimal Switching; Switching Sequence (search for similar items in EconPapers)
Date: 2007
References: Add references at CitEc
Citations:
There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:spr:lnechp:978-3-540-48271-0_1
Ordering information: This item can be ordered from
http://www.springer.com/9783540482710
DOI: 10.1007/978-3-540-48271-0_1
Access Statistics for this chapter
More chapters in Lecture Notes in Economics and Mathematical Systems from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().