A submodular optimization framework for leader selection in linear multi-agent systems

Proceedings of the IEEE Conference on Decision and Control

Volumn , Issue , 2011, Pages 3614-3621

  Clark, Andrew ^a   Poovendran, Radha ^a  

^a UNIVERSITY OF WASHINGTON   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

TIME VARYING NETWORKS; TOPOLOGY;

ANALYTICAL PERFORMANCE; LEADER-FOLLOWER; NETWORKED MULTI-AGENT SYSTEMS; PERFORMANCE REQUIREMENTS; SELECTION PROBLEMS; SUBMODULAR OPTIMIZATIONS; TIME VARYING TOPOLOGY;

MULTI AGENT SYSTEMS;

EID: 84860701648     PISSN: 07431546     EISSN: 25762370     Source Type: Conference Proceeding    
DOI: 10.1109/CDC.2011.6160248     Document Type: Conference Paper

References (12)

1. J. Desai, J. Ostrowski, and V. Kumar, "Controlling formations of multiple mobile robots," in Robotics and Automation, 1998. Proceedings. 1998 IEEE International Conference on, vol. 4. IEEE, 2002, pp. 2864-2869.
2. J. Fax and R. Murray, "Information flow and cooperative control of vehicle formations," Automatic Control, IEEE Transactions on, vol. 49, no. 9, pp. 1465-1476, 2004.
3. L. Xiao, S. Boyd, and S. Lall, "A space-time diffusion scheme for peer-to-peer least-squares estimation," in Proceedings of the 5th international conference on Information processing in sensor networks. ACM, 2006, pp. 168-176.
4. R. Olfati-Saber and R. Murray, "Consensus problems in networks of agents with switching topology and time-delays," Automatic Control, IEEE Transactions on, vol. 49, no. 9, pp. 1520-1533, 2004.
5. T. Borsche and S. Attia, "On leader election in multi-agent control systems," in Control and Decision Conference (CCDC), 2010 Chinese. IEEE, 2010, pp. 102-107.
6. H. Tanner, "On the controllability of nearest neighbor interconnections," in Decision and Control, 2004. CDC. 43rd IEEE Conference on, vol. 3. IEEE, 2005, pp. 2467-2472.
7. P. Barooah and J. Hespanha, "Graph effective resistance and distributed control: Spectral properties and applications," in Decision and Control, 2006 45th IEEE Conference on. IEEE, 2007, pp. 3479-3485.
8. L. Lovász, "Random walks on graphs: A survey," Combinatorics, Paul Erdos is Eighty, vol. 2, no. 1, pp. 1-46, 1993.
9. G. Nemhauser, L. Wolsey, and M. Fisher, "An analysis of approximations for maximizing submodular set functions I," Mathematical Programming, vol. 14, no. 1, pp. 265-294, 1978.
10. M. Streeter and D. Golovin, "An online algorithm for maximizing submodular functions," 2007.
11. L. Wolsey, "An analysis of the greedy algorithm for the submodular set covering problem," Combinatorica, vol. 2, no. 4, pp. 385-393, 1982.
12. A. Krause, H. Mcmahan, C. Guestrin, and A. Gupta, "Selecting observations against adversarial objectives," in In NIPS, 2007a. Citeseer, 2007.