scispace - formally typeset
Proceedings ArticleDOI

Virtual Leader Approach to Coordinated Control of Multiple Mobile Agents with Asymmetric Interactions

Reads0
Chats0
TLDR
In this article, a set of coordination control laws that enable the group to generate the desired stable flocking motion is introduced. But the control laws are a combination of attractive/repulsive and alignment forces, and the control law acting on each agent relies on the state information of its flockmates and the external reference signal.
Abstract
This paper considers multiple mobile agents moving in the space with point mass dynamics. We introduce a set of coordination control laws that enable the group to generate the desired stable flocking motion. The control laws are a combination of attractive/repulsive and alignment forces, and the control law acting on each agent relies on the state information of its flockmates and the external reference signal. By using the control laws, all agent velocities asymptotically approach the desired velocity, collisions are avoided between the agents, and the final tight formation minimizes all agent global potentials. Moreover, we show that the velocity of the center of mass either is equal to the desired velocity or exponentially converges to it. Furthermore, when the velocity damping is taken into account, we can properly modify the control laws to generate the same stable flocking motion. Finally, for the case that not all agents know the desired common velocity, we show that the desired flocking motion can still be guaranteed. Numerical simulations are worked out to illustrate our theoretical results.

read more

Content maybe subject to copyright    Report

Citations
More filters
Posted Content

Distributed Observers Design for Leader-Following Control of Multi-Agent Networks (Extended Version)

TL;DR: It is proved that each agent can follow the active leader of a multi-agent system with a switching interconnection topology with an explicitly constructed common Lyapunov function (CLF).

Asynchronous Consensus in Continuous-Time Multi-Agent Systems With Switching

Feng Xiao, +1 more
TL;DR: 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.
Journal ArticleDOI

Technical communique: Consensus of second-order discrete-time multi-agent systems with nonuniform time-delays and dynamically changing topologies

TL;DR: It is shown that arbitrary bounded time-delays can safely be tolerated, even though the communication structures between agents dynamically change over time and the corresponding directed graphs may not have spanning trees.
Journal ArticleDOI

Controllability of a Leader–Follower Dynamic Network With Switching Topology

TL;DR: A simple controllability condition is derived for the leader-follower network of dynamic agents linked via neighbor rules, which indicates that the controllable of the whole network does not need to rely on that of the network for every specific topology.
Journal ArticleDOI

A connectivity-preserving flocking algorithm for multi-agent systems based only on position measurements

TL;DR: A provably-stable flocking algorithm is proposed, in which an output vector is produced by distributed filters based on position information alone but not velocity information, which not only can steer a group of agents to a stable flocking motion but also can preserve the connectivity of the interactive network during the dynamical evolution.
References
More filters
Book

Matrix Analysis

TL;DR: In this article, the authors present results of both classic and recent matrix analyses using canonical forms as a unifying theme, and demonstrate their importance in a variety of applications, such as linear algebra and matrix theory.
Journal ArticleDOI

Consensus problems in networks of agents with switching topology and time-delays

TL;DR: A distinctive feature of this work is to address consensus problems for networks with directed information flow by establishing a direct connection between the algebraic connectivity of the network and the performance of a linear consensus protocol.
Book

Algebraic Graph Theory

TL;DR: The Laplacian of a Graph and Cuts and Flows are compared to the Rank Polynomial.
Journal ArticleDOI

Coordination of groups of mobile autonomous agents using nearest neighbor rules

TL;DR: A theoretical explanation for the observed behavior of the Vicsek model, which proves to be a graphic example of a switched linear system which is stable, but for which there does not exist a common quadratic Lyapunov function.
Related Papers (5)