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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Pinedo, M., Scheduling: theory, algorithms and systems, Prentice Hall, 2002.
Rao, V. G. and Kabamba, P. T., “Interferometric Observatories in Circular Orbits: Designing Constellations for Capacity, Coverage and Utilization,” 2003 AAS/AIAA Astrodynamics Specialists Conference, Big Sky, Montana, August 2003.
Rao, V. G., Team Formation and Breakup in Multiagent Systems, Ph.D. thesis, University of Michigan, 2004.
Cook, S. and Mitchell, D., “Finding Hard Instances of the Satisfiability Problem,” Proc. DIMACS workshop on Satisfiability Problems, 1997.
Cheeseman, P., Kanefsky, B., and Taylor, W., “Where the Really Hard Problems Are,” Proc. IJCAI-91, Sydney, Australia, 1991, pp. 163–169.
Berry, D. A. and Fristedt, B., Bandit Problems: Sequential Allocation of Experiments, Chapman and Hall, 1985.
Whittle, P., “Restless Bandits: Activity Allocation in a Changing World,” Journal of Applied Probability, Vol. 25A, 1988, pp. 257–298.
Weber, R. and Weiss, G., “On an Index Policy for Restless Bandits,” Journal of Applied Probability, Vol. 27, 1990, pp. 637–348.
Papadimitrou, C. H. and Tsitsiklis, J. N., “The Complexity of Optimal Queuing Network Control,” Math and Operations Research, Vol. 24, No. 2, 1999, pp. 293–305.
Weiss, G., Multiagent Systems: A Modern Approach to Distributed Artificial Intelligence, MIT Press, Cambridge, MA, 2000.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Rao, V.G., Kabamba, P.T. (2007). Optimally Greedy Control of Team Dispatching Systems. In: Grundel, D., Murphey, R., Pardalos, P., Prokopyev, O. (eds) Cooperative Systems. Lecture Notes in Economics and Mathematical Systems, vol 588. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-48271-0_1
Download citation
DOI: https://doi.org/10.1007/978-3-540-48271-0_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-48270-3
Online ISBN: 978-3-540-48271-0
eBook Packages: Business and EconomicsBusiness and Management (R0)