66,969 research outputs found
The Most Exigent Eigenvalue: Guaranteeing Consensus under an Unknown Communication Topology and Time Delays
This document aims to answer the question of what is the minimum delay value
that guarantees convergence to consensus for a group of second order agents
operating under different protocols, provided that the communication topology
is connected but unknown. That is, for all the possible communication
topologies, which value of the delay guarantees stability? To answer this
question we revisit the concept of most exigent eigenvalue, applying it to two
different consensus protocols for agents driven by second order dynamics. We
show how the delay margin depends on the structure of the consensus protocol
and the communication topology, and arrive to a boundary that guarantees
consensus for any connected communication topology. The switching topologies
case is also studied. It is shown that for one protocol the stability of the
individual topologies is sufficient to guarantee consensus in the switching
case, whereas for the other one it is not
Consensus in multi-agent systems with non-periodic sampled-data exchange and uncertain network topology
In this paper consensus in second-order multi-agent systems with a
non-periodic sampled-data exchange among agents is investigated. The sampling
is random with bounded inter-sampling intervals. It is assumed that each agent
has exact knowledge of its own state at any time instant. The considered local
interaction rule is PD-type. Sufficient conditions for stability of the
consensus protocol to a time-invariant value are derived based on LMIs. Such
conditions only require the knowledge of the connectivity of the graph modeling
the network topology. Numerical simulations are presented to corroborate the
theoretical results.Comment: arXiv admin note: substantial text overlap with arXiv:1407.300
Similarity Decomposition Approach to Oscillatory Synchronization for Multiple Mechanical Systems With a Virtual Leader
This paper addresses the oscillatory synchronization problem for multiple
uncertain mechanical systems with a virtual leader, and the interaction
topology among them is assumed to contain a directed spanning tree. We propose
an adaptive control scheme to achieve the goal of oscillatory synchronization.
Using the similarity decomposition approach, we show that the position and
velocity synchronization errors between each mechanical system (or follower)
and the virtual leader converge to zero. The performance of the proposed
adaptive scheme is shown by numerical simulation results.Comment: 15 pages, 3 figures, published in 2014 Chinese Control Conferenc
Macro-routing: a new hierarchical routing protocol
In a continually evolving Internet, tools such as quality of service routing must be used in order to accommodate user demands. QoS routing raises scalability issues within very large networks, which can he avoided by using hierarchical routing strategies. However, such strategies can lead to inaccurate path selection due to the aggregation process. To avoid such problems, we propose a hierarchical routing protocol, called macro-routing, which can distribute the route computation more efficiently throughout the network using mobile agents. It processes more detailed information than conventional hierarchical routing protocols, so is more likely to find the best path between source and destination. Also, by using mobile agents, more than one available path can be found. This provides a fast recovery mechanism, where no protocol restart is needed in a failure situation
- …