Distributed motion constraints for algebraic connectivity of robotic networks

DOI10.1007/s10846-009-9328-8zbMath1203.68271MaRDI QIDQ614696

Jorge Cortés, Michael Schuresko

Publication date: 4 January 2011

Published in: Journal of Intelligent \& Robotic Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10846-009-9328-8

zbMATH Keywords

Cooperative control; Flocking; Graph connectivity; Robotic networks

Mathematics Subject Classification ID

68W05: Nonnumerical algorithms

93C85: Automated systems (robots, etc.) in control theory

68T40: Artificial intelligence for robotics

Related Items

Distributed optimisation and control of graph Laplacian eigenvalues for robust consensus via an adaptive multilayer strategy, Constrained distributed algebraic connectivity maximization in robotic networks, Fast convergence to Nash equilibria without steady-state oscillation, Distributed Tree Rearrangements for Reachability and Robust Connectivity

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Nonsmooth analysis of eigenvalues
• Distributed Computing: A Locality-Sensitive Approach
• Consensus and Cooperation in Networked Multi-Agent Systems
• Maintaining Limited-Range Connectivity Among Second-Order Agents
• Coordination of groups of mobile autonomous agents using nearest neighbor rules
• On Maximizing the Second Smallest Eigenvalue of a State-Dependent Graph Laplacian
• Robust Rendezvous for Mobile Autonomous Agents via Proximity Graphs in Arbitrary Dimensions
• On Synchronous Robotic Networks—Part I: Models, Tasks, and Complexity
• Algebraic connectivity of directed graphs