Distributed motion constraints for algebraic connectivity of robotic networks
From MaRDI portal
Publication:614696
DOI10.1007/s10846-009-9328-8zbMath1203.68271OpenAlexW2160409949MaRDI QIDQ614696
Michael Schuresko, Jorge Cortés
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
Nonnumerical algorithms (68W05) Automated systems (robots, etc.) in control theory (93C85) Artificial intelligence for robotics (68T40)
Related Items (5)
Distributed optimisation and control of graph Laplacian eigenvalues for robust consensus via an adaptive multilayer strategy ⋮ Nonsmooth control barrier function design of continuous constraints for network connectivity maintenance ⋮ Fast convergence to Nash equilibria without steady-state oscillation ⋮ Constrained distributed algebraic connectivity maximization in robotic networks ⋮ Distributed Tree Rearrangements for Reachability and Robust Connectivity
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Nonsmooth analysis of eigenvalues
- Optimization and nonsmooth analysis
- 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
This page was built for publication: Distributed motion constraints for algebraic connectivity of robotic networks
