Distributed Geodesic Control Laws for Flocking of Nonholonomic Agents

Abstract

We study the problem of flocking and velocity alignment in a group of kinematic nonholonomic agents in 2 and 3 dimensions. By analyzing the velocity vectors of agents on a circle (for planar motion) or sphere (for 3-D motion), we develop a geodesic control law that minimizes a misalignment potential and results in velocity alignment and flocking. The proposed control laws are distributed and will provably result in flocking when the underlying proximity graph which represents the neighborhood relation among agents is connected. We further show that flocking is possible even when the topology of the proximity graph changes over time, so long as a weaker notion of joint connectivity is preserved. 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. Distributed Geodesic Control Laws for Flocking of Nonholonomic AgentsNima Moshtagh and Ali JadbabaieAbstract-We study the problem of flocking and velocity alignment in a group of kinematic nonholonomic agents in 2 and 3 dimensions. By analyzing the velocity vectors of agents on a circle (for planar motion) or sphere (for 3-D motion), we develop a geodesic control law that minimizes a misalignment potential and results in velocity alignment and flocking. The proposed control laws are distributed and will provably result in flocking when the underlying proximity graph which represents the neighborhood relation among agents is connected. We further show that flocking is possible even when the topology of the proximity graph changes over time, so long as a weaker notion of joint connectivity is preserved.

Consensus and Cooperation in Networked Multi-Agent Systems

“…More recently, there has been a tremendous surge of interest-among researchers from various disciplines of engineering and science-in problems related to multi-agent networked systems with close ties to consensus problems. This includes subjects such as consensus [47,9,5,15,54,8,79], collective behavior of flocks and swarms [66,80,60,95,30], sensor fusion [64,71,33], random networks [34,73], synchronization of coupled oscillators [81,39,72,73,14], algebraic connectivity 6 of complex networks [65,12,43], asynchronous distributed algorithms [54,26], formation control for multi-robot systems [21,68,69,24,89,88,48,96,20], optimization-based cooperative control [75,42,37,2], dynamic graphs [56,61,40,99], complexity of coordinated tasks [36,…”

Decomposition frameworks for cooperative manipulation of a planar rigid body with multiple unilateral thrusters

“…When using mobile robots for manipulation instead of attached thrusters, the cooperative manipulation of the rigid body is not a pure manipulation or pure motion coordination problem (such as flocking [23][24][25][26][27], formation [28][29][30][31]) of the robots, it requires regulation of both motion (between mobile robots) and interaction forces (between the body and the robots), and this question is challenging and needs to be further investigated; the robustness to individual thruster/robot failure, as well as physical implementations (with communication issues between robots), also needs to be considered in future.…”

Mathematical modeling for flocking flight of autonomous multi-UAV system, including environmental factors

“…Various works have considered a reduced objective in flocking problems, where N nonholonomic agents moving at unit speed must align their velocity vectors. Moshtagh et al [21] presented a vision-based flocking control to enhance the existing control laws enabling a group of individuals to align with the leading orientation, as long as the proximity-based closed-graph representing the community topology is connected. In a similar method, Paley et al [7,22] assume an all-to-all communication topology and advance both the control laws that synchronize the group's cooperative movement and the topology of the entire communication infrastructure, that is, by aligning the agent orientation in a known flow area (e.g., a constant velocity wind).…”