A novel approach to coordination of multiple robots with communication failures via proximity graph

DOI10.1016/j.automatica.2011.04.017zbMath1226.68117OpenAlexW2014435065MaRDI QIDQ642944

Gang Feng, Yuan Fan, 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

zbMATH Keywords

graph theorydistributed algorithmscommunication failuremulti-robot coordination

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Automated systems (robots, etc.) in control theory (93C85) Distributed systems (68M14) Artificial intelligence for robotics (68T40)

Related Items (16)

Sliding-mode-based robust controller design for one channel in thrust vector system with electromechanical actuators ⋮ Finite-time connectivity preservation rendezvous with disturbance rejection ⋮ Robust exponential stabilization for sampled-data systems with variable sampling and packet dropouts ⋮ Consensus for heterogeneous multi-agent systems under fixed and switching topologies ⋮ Distributed Kalman consensus filter with intermittent observations ⋮ Decentralized piecewise \(\mathcal H_\infty\) fuzzy filtering design for discrete-time large-scale nonlinear systems with time-varying delay ⋮ 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 ⋮ A novel analysis on the efficiency of hierarchy among leader-following systems ⋮ Suboptimal event-triggered consensus of multiagent systems ⋮ 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) ⋮ Nonlinear Consensus Algorithms with Uncertain Couplings ⋮ Cooperative linear output regulation for networked systems by dynamic measurement output feedback ⋮ Output Consensus of Heterogeneous Linear Multi-agent Systems Subject to Different Disturbances ⋮ State estimation of heterogeneous oscillators by means of proximity measurements

Cites Work

• A note on connectivity of multi-agent systems with proximity graphs and linear feedback protocol
• Distributed consensus in multi-vehicle cooperative control. Theory and applications.
• The Multi-Agent Rendezvous Problem. Part 1: The Synchronous Case
• Reaching a Consensus in a Dynamically Changing Environment: A Graphical Approach
• Consensus and Cooperation in Networked Multi-Agent Systems
• Asynchronous Consensus in Continuous-Time Multi-Agent Systems With Switching Topology and Time-Varying Delays
• Hybrid Control for Connectivity Preserving Flocking
• Consensus Over Ergodic Stationary Graph Processes
• Maintaining Limited-Range Connectivity Among Second-Order Agents
• 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
• On Maximizing the Second Smallest Eigenvalue of a State-Dependent Graph Laplacian
• Robust Rendezvous for Mobile Autonomous Agents via Proximity Graphs in Arbitrary Dimensions
• Flocking in Fixed and Switching Networks
• On the Rendezvous Problem for Multiple Nonholonomic Agents

This page was built for publication: A novel approach to coordination of multiple robots with communication failures via proximity graph