Cultural advice

The Australian National University acknowledges, celebrates and pays our respects to the Ngunnawal and Ngambri people of the Canberra region and to all First Nations Australians on whose traditional lands we meet and work, and whose cultures are among the oldest continuing cultures in human history.

Aboriginal and Torres Strait Islander peoples are advised that ANU Library collections may include images, names, voices, and other representations of deceased persons.

Material in the collection may contain terms, language or views that reflect the period in which the item was created and may be considered inappropriate today.

Multiagent Systems with Compasses

Loading...
Thumbnail Image

Date

Authors

Meng, Ziyang
Shi, Guodong
Johansson , Karl Henrik

Journal Title

Journal ISSN

Volume Title

Publisher

Society for Industrial and Applied Mathematics

Abstract

This paper investigates agreement protocols over cooperative and cooperativeantagonistic multiagent networks with coupled continuous-time nonlinear dynamics. To guarantee convergence for such systems, it is common in the literature to assume that the vector field of each agent is pointing inside the convex hull formed by the states of the agent and its neighbors, given that the relative states between each agent and its neighbors are available. This convexity condition is relaxed in this paper, as we show that it is enough that the vector field belongs to a strict tangent cone based on a local supporting hyperrectangle. The new condition has the natural physical interpretation of requiring shared reference directions in addition to the available local relative states. Such shared reference directions can be further interpreted as if each agent holds a magnetic compass indicating the orientations of a global frame. It is proved that the cooperative multiagent system achieves exponential state agreement if and only if the time-varying interaction graph is uniformly jointly quasi-strongly connected. Cooperative-antagonistic multiagent systems are also considered. For these systems, the relation has a negative sign for arcs corresponding to antagonistic interactions. State agreement may not be achieved, but instead it is shown that all the agents’ states asymptotically converge, and their limits agree componentwise in absolute values if and in general only if the time-varying interaction graph is uniformly jointly strongly connected.

Description

Keywords

Citation

Source

SIAM Journal on Optimization

Book Title

Entity type

Access Statement

License Rights

Restricted until

2037-12-31