Asynchronous Consensus in Continuous-Time Multi-Agent Systems With Switching Topology and Time-Varying Delays

Simple item page
dc.creatorXiao, Feng
dc.creatorWang, Long
dc.date2006-11-30
dc.date.accessioned2026-07-07T07:33:31Z
dc.date.available2026-07-07T07:33:31Z
dc.descriptionIn this paper, we study asynchronous consensus problems of continuous-time multi-agent systems with discontinuous information transmission. The proposed consensus control strategy is implemented only based on the state information at some discrete times of each agent's neighbors. The asynchronization means that each agent's update times, at which the agent adjusts its dynamics, are independent of others'. Furthermore, it is assumed that the communication topology among agents is time-dependent and the information transmission is with bounded time-varying delays. If the union of the communication topology across any time interval with some given length contains a spanning tree, the consensus problem is shown to be solvable. The analysis tool developed in this paper is based on the nonnegative matrix theory and graph theory. The main contribution of this paper is to provide a valid distributed consensus algorithm that overcomes the difficulties caused by unreliable communication channels, such as intermittent information transmission, switching communication topology, and time-varying communication delays, and therefore has its obvious practical applications. Simulation examples are provided to demonstrate the effectiveness of our theoretical results.
dc.descriptionRegular paper
dc.identifierhttps://arxiv.org/abs/math/0611932
dc.identifierhttp://arxiv.org/abs/math/0611932
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/119481
dc.subjectDynamical Systems
dc.titleAsynchronous Consensus in Continuous-Time Multi-Agent Systems With Switching Topology and Time-Varying Delays
dc.typetext

Files

Collections

arXiv