Consensus protocols for networked multiagent systems with relative position and neighboring velocity information

Gerardo De La Torre, Tansel Yucelen, Eric N. Johnson

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Citations (Scopus)

Abstract

The consensus problem appears frequently in the coordination of muItiagent systems in science and engineering and involves the agreement of networked agents upon certain quantities of interest. In this paper, we focus on a new consensus protocol for networked multiagent systems. The proposed control protocol consists of a standard term capturing relative position information and a new term capturing neighboring velocity information. In particular, the addition of the latter term results in an increase of the rate of system convergence while maintaining a fixed graph structure and without increasing the maximum eigenvalue of the graph Laplacian. Furthermore, in certain cases, it is shown that the maximum singular value of the graph Laplacian is not increased. This departs from the traditional view that the Fiedler eigenvalue, a function of graph structure, governors the system's rate of convergence. In addition, it is shown that a connected and undirected graph topology acts as a weighted complete graph topology with the addition of this latter term to a standard consensus protocol. A comparative numerical example is provided to demonstrate the advantages of this new consensus protocol.

Original languageEnglish (US)
Title of host publication2013 IEEE 52nd Annual Conference on Decision and Control, CDC 2013
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages811-816
Number of pages6
ISBN (Print)9781467357173
DOIs
StatePublished - Jan 1 2013
Event52nd IEEE Conference on Decision and Control, CDC 2013 - Florence, Italy
Duration: Dec 10 2013Dec 13 2013

Publication series

NameProceedings of the IEEE Conference on Decision and Control
ISSN (Print)0191-2216

Other

Other52nd IEEE Conference on Decision and Control, CDC 2013
CountryItaly
CityFlorence
Period12/10/1312/13/13

Fingerprint

Multi agent systems
Multi-agent Systems
Topology
Graph Laplacian
Governors
Term
Eigenvalue
Consensus Problem
Weighted Graph
Singular Values
Graph in graph theory
Undirected Graph
Complete Graph
Connected graph
Rate of Convergence
Engineering
Numerical Examples
Demonstrate
Standards

All Science Journal Classification (ASJC) codes

  • Control and Systems Engineering
  • Modeling and Simulation
  • Control and Optimization

Cite this

De La Torre, G., Yucelen, T., & Johnson, E. N. (2013). Consensus protocols for networked multiagent systems with relative position and neighboring velocity information. In 2013 IEEE 52nd Annual Conference on Decision and Control, CDC 2013 (pp. 811-816). [6759982] (Proceedings of the IEEE Conference on Decision and Control). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/CDC.2013.6759982
De La Torre, Gerardo ; Yucelen, Tansel ; Johnson, Eric N. / Consensus protocols for networked multiagent systems with relative position and neighboring velocity information. 2013 IEEE 52nd Annual Conference on Decision and Control, CDC 2013. Institute of Electrical and Electronics Engineers Inc., 2013. pp. 811-816 (Proceedings of the IEEE Conference on Decision and Control).
@inproceedings{57427f10e4a44a3bb9386f68df9a0438,
title = "Consensus protocols for networked multiagent systems with relative position and neighboring velocity information",
abstract = "The consensus problem appears frequently in the coordination of muItiagent systems in science and engineering and involves the agreement of networked agents upon certain quantities of interest. In this paper, we focus on a new consensus protocol for networked multiagent systems. The proposed control protocol consists of a standard term capturing relative position information and a new term capturing neighboring velocity information. In particular, the addition of the latter term results in an increase of the rate of system convergence while maintaining a fixed graph structure and without increasing the maximum eigenvalue of the graph Laplacian. Furthermore, in certain cases, it is shown that the maximum singular value of the graph Laplacian is not increased. This departs from the traditional view that the Fiedler eigenvalue, a function of graph structure, governors the system's rate of convergence. In addition, it is shown that a connected and undirected graph topology acts as a weighted complete graph topology with the addition of this latter term to a standard consensus protocol. A comparative numerical example is provided to demonstrate the advantages of this new consensus protocol.",
author = "{De La Torre}, Gerardo and Tansel Yucelen and Johnson, {Eric N.}",
year = "2013",
month = "1",
day = "1",
doi = "10.1109/CDC.2013.6759982",
language = "English (US)",
isbn = "9781467357173",
series = "Proceedings of the IEEE Conference on Decision and Control",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
pages = "811--816",
booktitle = "2013 IEEE 52nd Annual Conference on Decision and Control, CDC 2013",
address = "United States",

}

De La Torre, G, Yucelen, T & Johnson, EN 2013, Consensus protocols for networked multiagent systems with relative position and neighboring velocity information. in 2013 IEEE 52nd Annual Conference on Decision and Control, CDC 2013., 6759982, Proceedings of the IEEE Conference on Decision and Control, Institute of Electrical and Electronics Engineers Inc., pp. 811-816, 52nd IEEE Conference on Decision and Control, CDC 2013, Florence, Italy, 12/10/13. https://doi.org/10.1109/CDC.2013.6759982

Consensus protocols for networked multiagent systems with relative position and neighboring velocity information. / De La Torre, Gerardo; Yucelen, Tansel; Johnson, Eric N.

2013 IEEE 52nd Annual Conference on Decision and Control, CDC 2013. Institute of Electrical and Electronics Engineers Inc., 2013. p. 811-816 6759982 (Proceedings of the IEEE Conference on Decision and Control).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - Consensus protocols for networked multiagent systems with relative position and neighboring velocity information

AU - De La Torre, Gerardo

AU - Yucelen, Tansel

AU - Johnson, Eric N.

PY - 2013/1/1

Y1 - 2013/1/1

N2 - The consensus problem appears frequently in the coordination of muItiagent systems in science and engineering and involves the agreement of networked agents upon certain quantities of interest. In this paper, we focus on a new consensus protocol for networked multiagent systems. The proposed control protocol consists of a standard term capturing relative position information and a new term capturing neighboring velocity information. In particular, the addition of the latter term results in an increase of the rate of system convergence while maintaining a fixed graph structure and without increasing the maximum eigenvalue of the graph Laplacian. Furthermore, in certain cases, it is shown that the maximum singular value of the graph Laplacian is not increased. This departs from the traditional view that the Fiedler eigenvalue, a function of graph structure, governors the system's rate of convergence. In addition, it is shown that a connected and undirected graph topology acts as a weighted complete graph topology with the addition of this latter term to a standard consensus protocol. A comparative numerical example is provided to demonstrate the advantages of this new consensus protocol.

AB - The consensus problem appears frequently in the coordination of muItiagent systems in science and engineering and involves the agreement of networked agents upon certain quantities of interest. In this paper, we focus on a new consensus protocol for networked multiagent systems. The proposed control protocol consists of a standard term capturing relative position information and a new term capturing neighboring velocity information. In particular, the addition of the latter term results in an increase of the rate of system convergence while maintaining a fixed graph structure and without increasing the maximum eigenvalue of the graph Laplacian. Furthermore, in certain cases, it is shown that the maximum singular value of the graph Laplacian is not increased. This departs from the traditional view that the Fiedler eigenvalue, a function of graph structure, governors the system's rate of convergence. In addition, it is shown that a connected and undirected graph topology acts as a weighted complete graph topology with the addition of this latter term to a standard consensus protocol. A comparative numerical example is provided to demonstrate the advantages of this new consensus protocol.

UR - http://www.scopus.com/inward/record.url?scp=84902356217&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84902356217&partnerID=8YFLogxK

U2 - 10.1109/CDC.2013.6759982

DO - 10.1109/CDC.2013.6759982

M3 - Conference contribution

AN - SCOPUS:84902356217

SN - 9781467357173

T3 - Proceedings of the IEEE Conference on Decision and Control

SP - 811

EP - 816

BT - 2013 IEEE 52nd Annual Conference on Decision and Control, CDC 2013

PB - Institute of Electrical and Electronics Engineers Inc.

ER -

De La Torre G, Yucelen T, Johnson EN. Consensus protocols for networked multiagent systems with relative position and neighboring velocity information. In 2013 IEEE 52nd Annual Conference on Decision and Control, CDC 2013. Institute of Electrical and Electronics Engineers Inc. 2013. p. 811-816. 6759982. (Proceedings of the IEEE Conference on Decision and Control). https://doi.org/10.1109/CDC.2013.6759982