#### Filter Results:

#### Publication Year

2013

2016

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

In this preliminary paper we study the stability property of a consensus on the average algorithm in arbitrary directed graphs with respect to communication/sensing time-delays. The proposed algorithm adds a storage variable to the agents' states so that the information about the average of the states is preserved despite the algorithm iterations are… (More)

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 all times. The considered local interaction rule is PD-type. The characterization of the… (More)

— Connectivity maintenance is an essential task in multi-robot systems and it has received a considerable attention during the last years. A connected system can be broken into two or more subsets simply if a single robot fails. A more robust communication can be achieved if the network connectivity is guaranteed in the case of one-robot failures. The… (More)

— The network connectivity in a group of cooperative robots can be easily broken if one of them loses its connectivity with the rest of the group. In case of having robustness with respect to one-robot-fail, the communication network is termed biconnected. In simple words, to have a biconnected network graph, we need to prove that there exists no… (More)

—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… (More)

- ‹
- 1
- ›