Coordination of groups of mobile autonomous agents using nearest neighbor rules

Abstract

In a recent Physical Review Letters article, Vicsek et al. propose a simple but compelling discrete-time model of n autonomous agents (i.e., points or particles) all moving in the plane with the same speed but with different headings. Each agent's heading is updated using a local rule based on the average of its own heading plus the headings of its "neighbors. " In their paper, Vicsek et al. provide simulation results which demonstrate that the nearest neighbor rule they are studying can cause all agents to eventually move in the same direction despite the absence of centralized coordination and despite the fact that each agent's set of nearest neighbors change with time as the system evolves. This paper provides a theoretical explanation for this observed behavior. In addition, convergence results are derived for several other similarly inspired models. The Vicsek model 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. KeywordsCooperative control, graph theory, infinite products, multiagent systems, switched systems This material is posted here with permission of the IEEE. Such permission of the IEEE does not in any way imply IEEE endorsement of any of the University of Pennsylvania's products or services. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to pubs-permissions@ieee.org. By choosing to view this document, you agree to all provisions of the copyright laws protecting it.This journal article is available at ScholarlyCommons: http://repository.upenn.edu/ese_papers/29 provide simulation results which demonstrate that the nearest neighbor rule they are studying can cause all agents to eventually move in the same direction despite the absence of centralized coordination and despite the fact that each agent's set of nearest neighbors change with time as the system evolves. This paper provides a theoretical explanation for this observed behavior. In addition, convergence results are derived for several other similarly inspired models. The Vicsek model 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.

Suboptimal Output Consensus for Time‐Delayed Singular Multi‐Agent Systems

“…Proof. We first transform guaranteed-cost output consensus problems into admissible ones of subsystems (6). Let…”

“…Because LMIs satisfy the convex property, subsystems (6) are asymptotically stable if R T E o = E T o R ⩾ 0,Φ k < 0 (k = 2, N) andΩ ⩾ 0 are feasible. In the following, we prove that R T E o = E T o R ⩾ 0 andΦ k < 0 (k = 2, N) can also ensure that subsystems (6) are impulse-free and regular.…”

“…Recently, the study of macroscopic behaviors of multi-agent systems via local interactions significantly increases in various areas such as biology, physics, computing, and engineering as shown in [1][2][3][4][5]. In real life, typical multi-agent systems include computer networks, human social networks, bird flocking, et al, as shown in [6] and [7]. Investigations on multi-agent systems cannot only help humans to understand emergent mechanisms for macroscopical behaviors, but also help engineers to effectively deal with many practical problems (e.g., the disease spread control over computer networks) by means of multi-agent system theory.…”

Consensus Control for Directed Networks Under Quantized Information Exchange

“…Consensus problems, in which the question of interest is whether states held by different agents will converge to a common value merely through agents' local interaction, have recently received considerable attention for multi-agent networks. If the common value is the exact average of agents' initial states, average consensus among agents is achieved, which is often a key issue for the solution of many problems in various areas, such as parallel computation [1], cooperative control of agents [3][4][5] and multiple aerial unmanned vechicles (AUVs) [27]. Moreover, consensus algorithms have been studied under a wide variety of conditions, e.g., networks with undirected [3] or directed links [4,5,25], time delay [4,24], and leaderless or leader-follower cases [26].…”

Connectivity Preserving Flocking without Velocity Measurement

“…Different from the leader-follower methods introduced in [3,9,21,22], where the relationship between the leader and the follower is fixed or distance-independent, the leader here is treated as an ordinary agent for the followers and will have an effect on the followers only if the distance between them is less than the sensing radius. This kind of leader-follower flocking has been studied in [23,24,25], where the followers are only subject to a simple alignment rule. In this paper, the followers will be driven by the designed controller, which further has repulsive and attractive effects.…”