Distributed motion constraints for algebraic connectivity of robotic networks
From MaRDI portal
Publication:614696
Recommendations
- Distributed Tree Rearrangements for Reachability and Robust Connectivity
- Constrained distributed algebraic connectivity maximization in robotic networks
- Distributed control of robotic networks: a mathematical approach to motion coordination algorithms.
- Nonsmooth control barrier function design of continuous constraints for network connectivity maintenance
- Decentralized connectivity maintenance for networked Lagrangian dynamical systems with collision avoidance
Cites work
- scientific article; zbMATH DE number 1600999 (Why is no real title available?)
- scientific article; zbMATH DE number 3417498 (Why is no real title available?)
- Algebraic connectivity of directed graphs
- Consensus and Cooperation in Networked Multi-Agent Systems
- Convex optimization of graph Laplacian eigenvalues
- Coordination of groups of mobile autonomous agents using nearest neighbor rules
- Distributed Computing: A Locality-Sensitive Approach
- Maintaining limited-range connectivity among second-order agents
- Nonsmooth analysis of eigenvalues
- On Maximizing the Second Smallest Eigenvalue of a State-Dependent Graph Laplacian
- On Synchronous Robotic Networks—Part I: Models, Tasks, and Complexity
- Optimization and nonsmooth analysis
- Robust Rendezvous for Mobile Autonomous Agents via Proximity Graphs in Arbitrary Dimensions
Cited in
(18)- Decentralized global connectivity maintenance for interconnected Lagrangian systems in the presence of data corruption
- Nonsmooth control barrier function design of continuous constraints for network connectivity maintenance
- Fast convergence to Nash equilibria without steady-state oscillation
- A temporal logic-based hierarchical network connectivity controller
- Decentralized estimation and control of graph connectivity for mobile sensor networks
- Distributed Tree Rearrangements for Reachability and Robust Connectivity
- Constrained distributed algebraic connectivity maximization in robotic networks
- Motion coordination algorithms resulting from classical geometric optimization problems
- Maintaining limited-range connectivity among second-order agents
- Self-triggered coordination of robotic networks for optimal deployment
- Distributed optimisation and control of graph Laplacian eigenvalues for robust consensus via an adaptive multilayer strategy
- A framework for decentralised feedback connectivity control with application to sensor networks
- A distributed algorithm to maintain a proximity communication network among mobile agents using the Delaunay triangulation
- Distributed control of robotic networks: a mathematical approach to motion coordination algorithms.
- Decentralized connectivity maintenance for networked Lagrangian dynamical systems with collision avoidance
- Decentralized local-global connectivity maintenance for networked robotic teams
- Motions of a connected subgraph representing a swarm of robots inside a graph of work stations
- A Distributed Biconnectivity Check
This page was built for publication: Distributed motion constraints for algebraic connectivity of robotic networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q614696)
