A novel approach to coordination of multiple robots with communication failures via proximity graph
DOI10.1016/J.AUTOMATICA.2011.04.017zbMATH Open1226.68117OpenAlexW2014435065MaRDI QIDQ642944FDOQ642944
Authors: Yuan Fan, Gang Feng, Yong Wang, Jianbin Qiu
Publication date: 27 October 2011
Published in: Automatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.automatica.2011.04.017
Recommendations
- The problem of coordination and consensus achievement in groups of autonomous mobile robots with limited communication
- Leaderless cooperative formation control of autonomous mobile robots under limited communication range constraints
- A fault-tolerant communication mechanism for cooperative robots
- Quantized coordination algorithms for rendezvous and deployment
- scientific article; zbMATH DE number 1947492
Graph theory (including graph drawing) in computer science (68R10) Artificial intelligence for robotics (68T40) Automated systems (robots, etc.) in control theory (93C85) Distributed systems (68M14)
Cites Work
- Consensus and Cooperation in Networked Multi-Agent Systems
- Coordination of groups of mobile autonomous agents using nearest neighbor rules
- Stability of multiagent systems with time-dependent communication links
- Consensus seeking in multiagent systems under dynamically changing interaction topologies
- Agreement over random networks
- Flocking in Fixed and Switching Networks
- On the Rendezvous Problem for Multiple Nonholonomic Agents
- Distributed consensus in multi-vehicle cooperative control. Theory and applications.
- Reaching a Consensus in a Dynamically Changing Environment: A Graphical Approach
- Asynchronous Consensus in Continuous-Time Multi-Agent Systems With Switching Topology and Time-Varying Delays
- On Maximizing the Second Smallest Eigenvalue of a State-Dependent Graph Laplacian
- Robust Rendezvous for Mobile Autonomous Agents via Proximity Graphs in Arbitrary Dimensions
- The Multi-Agent Rendezvous Problem. Part 1: The Synchronous Case
- Consensus Over Ergodic Stationary Graph Processes
- Maintaining limited-range connectivity among second-order agents
- A note on connectivity of multi-agent systems with proximity graphs and linear feedback protocol
- Hybrid Control for Connectivity Preserving Flocking
Cited In (21)
- The problem of coordination and consensus achievement in groups of autonomous mobile robots with limited communication
- Output consensus of heterogeneous linear multi-agent systems subject to different disturbances
- Distributed Kalman consensus filter with intermittent observations
- Title not available (Why is that?)
- Cooperative linear output regulation for networked systems by dynamic measurement output feedback
- Finite-time connectivity preservation rendezvous with disturbance rejection
- Robust exponential stabilization for sampled-data systems with variable sampling and packet dropouts
- State estimation of heterogeneous oscillators by means of proximity measurements
- A fault-tolerant communication mechanism for cooperative robots
- Nonlinear Consensus Algorithms with Uncertain Couplings
- Noise tolerance leader-following of high-order nonlinear dynamical multi-agent systems with switching topology and communication delay
- Active disturbance rejection control for electric power steering system with assist motor variable mode
- Suboptimal event-triggered consensus of multiagent systems
- Adaptive robotic communication using coordination costs
- Title not available (Why is that?)
- Sliding-mode-based robust controller design for one channel in thrust vector system with electromechanical actuators
- Virtual neighbor based connectivity preserving of multi-agent systems with bounded control inputs in the presence of unreliable communication links
- Adaptive control and signal processing literature survey (No. 27)
- Consensus for heterogeneous multi-agent systems under fixed and switching topologies
- Decentralized piecewise \(\mathcal H_\infty\) fuzzy filtering design for discrete-time large-scale nonlinear systems with time-varying delay
- A novel analysis on the efficiency of hierarchy among leader-following systems
This page was built for publication: A novel approach to coordination of multiple robots with communication failures via proximity graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q642944)