IDEAS home Printed from https://ideas.repec.org/h/spr/lnechp/978-3-540-48271-0_1.html
   My bibliography  Save this book chapter

Optimally Greedy Control of Team Dispatching Systems

In: Cooperative Systems

Author

Listed:
  • Venkatesh G. Rao

    (Cornell University)

  • Pierre T. Kabamba

    (University of Michigan)

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.

Suggested Citation

  • Venkatesh G. Rao & Pierre T. Kabamba, 2007. "Optimally Greedy Control of Team Dispatching Systems," Lecture Notes in Economics and Mathematical Systems, in: Don Grundel & Robert Murphey & Panos Pardalos & Oleg Prokopyev (ed.), Cooperative Systems, pages 1-19, Springer.
    • Handle: RePEc:spr:lnechp:978-3-540-48271-0_1
    DOI: 10.1007/978-3-540-48271-0_1
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:lnechp:978-3-540-48271-0_1. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.