A novel approach to coordination of multiple robots with communication failures via proximity graph
type: Item
instance of: scholarly article
title: A novel approach to coordination of multiple robots with communication failures via proximity graph
zbMATH Open document ID: 1226.68117
author: Yuan Fan
author: Gang Feng
author: Yong Wang
author: Jianbin Qiu
published in: Automatica
publication date: 2011-10-27T00:00:00Z
Mathematics Subject Classification ID: 68T40
Mathematics Subject Classification ID: 93C85
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68M14
zbMATH DE Number: 5964668
zbMATH Keywords: multi-robot coordination
zbMATH Keywords: communication failure
zbMATH Keywords: distributed algorithms
zbMATH Keywords: graph theory
MaRDI profile type: Publication
full work available at URL: j.automatica.2011.04.017
OpenAlex ID: W2014435065
cites work: Reaching a Consensus in a Dynamically Changing Environment: A Graphical Approach
cites work: Robust Rendezvous for Mobile Autonomous Agents via Proximity Graphs in Arbitrary Dimensions
cites work: On the Rendezvous Problem for Multiple Nonholonomic Agents
cites work: Agreement over random networks
cites work: Coordination of groups of mobile autonomous agents using nearest neighbor rules
cites work: On Maximizing the Second Smallest Eigenvalue of a State-Dependent Graph Laplacian
cites work: The Multi-Agent Rendezvous Problem. Part 1: The Synchronous Case
cites work: Stability of multiagent systems with time-dependent communication links
cites work: Maintaining Limited-Range Connectivity Among Second-Order Agents
cites work: Consensus and Cooperation in Networked Multi-Agent Systems
cites work: Consensus seeking in multiagent systems under dynamically changing interaction topologies
cites work: Distributed consensus in multi-vehicle cooperative control. Theory and applications.
cites work: A note on connectivity of multi-agent systems with proximity graphs and linear feedback protocol
cites work: Consensus Over Ergodic Stationary Graph Processes
cites work: Flocking in Fixed and Switching Networks
cites work: Asynchronous Consensus in Continuous-Time Multi-Agent Systems With Switching Topology and Time-Varying Delays
cites work: Hybrid Control for Connectivity Preserving Flocking
DOI: 10.1016/J.AUTOMATICA.2011.04.017
description: scientific article; zbMATH DE number 5964668