Decentralized graph processes for robust multi-agent networks

[1]  Avi Wigderson,et al.  Entropy waves, the zig-zag graph product, and new constant-degree expanders and extractors , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[2]  Christian Blum,et al.  Metaheuristics in combinatorial optimization: Overview and conceptual comparison , 2003, CSUR.

[3]  Gilbert Laporte,et al.  Dynamic pickup and delivery problems , 2010, Eur. J. Oper. Res..

[4]  Marcin Dziubinski,et al.  Network Design and Defence , 2012, Games Econ. Behav..

[5]  H. Ohtsuki,et al.  A simple rule for the evolution of cooperation on graphs and social networks , 2006, Nature.

[6]  Adam Wierman,et al.  Distributed welfare games with applications to sensor coverage , 2008, 2008 47th IEEE Conference on Decision and Control.

[7]  Scott Kirkpatrick,et al.  Optimization by Simmulated Annealing , 1983, Sci..

[8]  Joel Friedman,et al.  A proof of Alon's second eigenvalue conjecture and related problems , 2004, ArXiv.

[9]  Jorge Cortes,et al.  Distributed Control of Robotic Networks: A Mathematical Approach to Motion Coordination Algorithms , 2009 .

[10]  Sonia Martínez,et al.  Distributed Coverage Games for Energy-Aware Mobile Sensor Networks , 2013, SIAM J. Control. Optim..

[11]  Mehryar Mohri,et al.  Multi-armed Bandit Algorithms and Empirical Evaluation , 2005, ECML.

[12]  M. Randic,et al.  Resistance distance , 1993 .

[13]  Mark S. Daskin,et al.  Strategic facility location: A review , 1998, Eur. J. Oper. Res..

[14]  Gaurav S. Sukhatme,et al.  Constrained coverage for mobile sensor networks , 2004, IEEE International Conference on Robotics and Automation, 2004. Proceedings. ICRA '04. 2004.

[15]  Robert E. Tarjan,et al.  Depth-First Search and Linear Graph Algorithms , 1972, SIAM J. Comput..

[16]  Chinwendu Enyioha,et al.  Optimal Resource Allocation for Network Protection Against Spreading Processes , 2013, IEEE Transactions on Control of Network Systems.

[17]  Ruggero Carli,et al.  Discrete Partitioning and Coverage Control With Gossip Communication , 2009 .

[18]  Samir Khuller,et al.  The Budgeted Maximum Coverage Problem , 1999, Inf. Process. Lett..

[19]  Timon C. Du,et al.  Mobile agents in distributed network management , 2003, CACM.

[20]  Béla Bollobás,et al.  A Probabilistic Proof of an Asymptotic Formula for the Number of Labelled Regular Graphs , 1980, Eur. J. Comb..

[21]  M. Kelbert,et al.  Probability and Statistics by Example: Contents , 2008 .

[22]  A. Jamakovic,et al.  On the relationship between the algebraic connectivity and graph's robustness to node and link failures , 2007, 2007 Next Generation Internet Networks.

[23]  Stefan Richter,et al.  Centrality Indices , 2004, Network Analysis.

[24]  N. Linial,et al.  Expander Graphs and their Applications , 2006 .

[25]  Alessandro Vespignani,et al.  Dynamical Processes on Complex Networks , 2008 .

[26]  O Mason,et al.  Graph theory and networks in Biology. , 2006, IET systems biology.

[27]  Sudipto Guha,et al.  A constant-factor approximation algorithm for the k-median problem (extended abstract) , 1999, STOC '99.

[28]  Marco Dorigo,et al.  Ant system: optimization by a colony of cooperating agents , 1996, IEEE Trans. Syst. Man Cybern. Part B.

[29]  Emilio Frazzoli,et al.  Efficient Routing Algorithms for Multiple Vehicles With no Explicit Communications , 2009, IEEE Transactions on Automatic Control.

[30]  M. Pinsker,et al.  On the complexity of a concentrator , 1973 .

[31]  Hans J. Herrmann,et al.  Mitigation of malicious attacks on networks , 2011, Proceedings of the National Academy of Sciences.

[32]  Avi Wigderson,et al.  Randomness conductors and constant-degree lossless expanders , 2002, Proceedings 17th IEEE Annual Conference on Computational Complexity.

[33]  Eric Klavins,et al.  A grammatical approach to self-organizing robotic systems , 2006, IEEE Transactions on Automatic Control.

[34]  Noga Alon,et al.  Eigenvalues and expanders , 1986, Comb..

[35]  R. Olfati-Saber.  Ultrafast consensus in small-world networks , 2005, Proceedings of the 2005, American Control Conference, 2005..

[36]  Albert-László Barabási,et al.  Controllability of complex networks , 2011, Nature.

[37]  Ennio Cascetta,et al.  Transportation Systems Engineering: Theory and Methods , 2001 .

[38]  Kai-Yeung Siu,et al.  Distributed construction of random expander networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[39]  M. Fiedler.  Algebraic connectivity of graphs , 1973 .

[40]  L. Blume.  The Statistical Mechanics of Strategic Interaction , 1993 .

[41]  Magnus Egerstedt,et al.  Graph Theoretic Methods in Multiagent Networks , 2010, Princeton Series in Applied Mathematics.

[42]  Fred W. Glover,et al.  Tabu Search - Part I , 1989, INFORMS J. Comput..

[43]  H. Young,et al.  The Evolution of Conventions , 1993 .

[44]  Ashish Goel,et al.  Set k-cover algorithms for energy efficient monitoring in wireless sensor networks , 2003, Third International Symposium on Information Processing in Sensor Networks, 2004. IPSN 2004.

[45]  Beom Jun Kim,et al.  Attack vulnerability of complex networks. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.

[46]  Matteo Fischetti,et al.  Algorithms for the Set Covering Problem , 2000, Ann. Oper. Res..

[47]  Jason R. Marden,et al.  Revisiting log-linear learning: Asynchrony, completeness and payoff-based implementation , 2010, 2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[48]  Maja J. Mataric,et al.  Territorial multi-robot task division , 1998, IEEE Trans. Robotics Autom..

[49]  Richard M. Murray,et al.  Consensus problems in networks of agents with switching topology and time-delays , 2004, IEEE Transactions on Automatic Control.

[50]  Moshe Morgenstern,et al.  Existence and Explicit Constructions of q + 1 Regular Ramanujan Graphs for Every Prime Power q , 1994, J. Comb. Theory, Ser. B.

[51]  Anthony H. Dekker,et al.  Network Robustness and Graph Topology , 2004, ACSC.

[52]  Francesco Bullo,et al.  Esaim: Control, Optimisation and Calculus of Variations Spatially-distributed Coverage Optimization and Control with Limited-range Interactions , 2022 .

[53]  R. Olfati-Saber,et al.  Algebraic Connectivity Ratio of Ramanujan Graphs , 2007, 2007 American Control Conference.

[54]  S. P. Lloyd,et al.  Least squares quantization in PCM , 1982, IEEE Trans. Inf. Theory.

[55]  Massimo Marchiori,et al.  Vulnerability and protection of infrastructure networks. , 2005, Physical review. E, Statistical, nonlinear, and soft matter physics.

[56]  Magnus Egerstedt,et al.  Controllability of Multi-Agent Systems from a Graph-Theoretic Perspective , 2009, SIAM J. Control. Optim..

[57]  Mark Jerrum,et al.  Fast Uniform Generation of Regular Graphs , 1990, Theor. Comput. Sci..

[58]  Sonia Martinez,et al.  Deployment algorithms for a power‐constrained mobile sensor network , 2010 .

[59]  Mac Schwager,et al.  Decentralized, Adaptive Coverage Control for Networked Robots , 2009, Int. J. Robotics Res..

[60]  Anna Scaglione,et al.  Electrical centrality measures for electric power grid vulnerability analysis , 2010, 49th IEEE Conference on Decision and Control (CDC).

[61]  Bojan Mohar,et al.  Isoperimetric numbers of graphs , 1989, J. Comb. Theory, Ser. B.

[62]  Salil P. Vadhan,et al.  Derandomized Squaring of Graphs , 2005, APPROX-RANDOM.

[63]  Gregory F. Lawler.  Introduction to Stochastic Processes , 1995 .

[64]  Mark Newman,et al.  Networks: An Introduction , 2010 .

[65]  Ian F. Akyildiz,et al.  Sensor Networks , 2002, Encyclopedia of GIS.

[66]  Roger Wattenhofer,et al.  Constant-time distributed dominating set approximation , 2003, PODC '03.

[67]  R. Rajaraman,et al.  An efficient distributed algorithm for constructing small dominating sets , 2002 .

[68]  Christian Schindelhauer,et al.  Peer-to-peer networks based on random transformations of connected regular undirected graphs , 2005, SPAA '05.

[69]  A. Barabasi,et al.  Lethality and centrality in protein networks , 2001, Nature.

[70]  N. Wormald,et al.  Models of the , 2010 .

[71]  Gaurav S. Sukhatme,et al.  Mobile Sensor Network Deployment using Potential Fields : A Distributed , Scalable Solution to the Area Coverage Problem , 2002 .

[72]  M. Murty.  Ramanujan Graphs , 1965 .

[73]  H. Vincent Poor,et al.  Strategic Protection Against Data Injection Attacks on Power Grids , 2011, IEEE Transactions on Smart Grid.

[74]  Nicholas C. Wormald,et al.  Generating Random Regular Graphs Quickly , 1999, Combinatorics, Probability and Computing.

[75]  N. Megiddo,et al.  The Maximum Coverage Location Problem , 1983 .

[76]  Sonia Martínez,et al.  Coverage control for mobile sensing networks , 2002, IEEE Transactions on Robotics and Automation.

[77]  Daniela Rus,et al.  Distributed coverage with mobile robots on a graph: Locational optimization , 2012, 2012 IEEE International Conference on Robotics and Automation.

[78]  J. Reese,et al.  Solution methods for the p-median problem: An annotated bibliography , 2006 .

[79]  Jason R. Marden,et al.  Autonomous Vehicle-Target Assignment: A Game-Theoretical Formulation , 2007 .

[80]  Heinz Mühlenbein,et al.  Evolution algorithms in combinatorial optimization , 1988, Parallel Comput..

[81]  Stephen P. Borgatti,et al.  Centrality and network flow , 2005, Soc. Networks.

[82]  Stephen P. Boyd,et al.  Randomized gossip algorithms , 2006, IEEE Transactions on Information Theory.

[83]  Vijay Kumar,et al.  Sensing and coverage for a network of heterogeneous robots , 2008, 2008 47th IEEE Conference on Decision and Control.

[84]  R. Linsker,et al.  Improving network robustness by edge modification , 2005 .

[85]  Helena Ramalhinho Dias Lourenço,et al.  Iterated Local Search , 2001, Handbook of Metaheuristics.