51 research outputs found
Multi-objective Compositions for Collision-Free Connectivity Maintenance in Teams of Mobile Robots
Compositional barrier functions are proposed in this paper to systematically
compose multiple objectives for teams of mobile robots. The objectives are
first encoded as barrier functions, and then composed using AND and OR logical
operators. The advantage of this approach is that compositional barrier
functions can provably guarantee the simultaneous satisfaction of all composed
objectives. The compositional barrier functions are applied to the example of
ensuring collision avoidance and static/dynamical graph connectivity of teams
of mobile robots. The resulting composite safety and connectivity barrier
certificates are verified experimentally on a team of four mobile robots.Comment: To appear in 55th IEEE Conference on Decision and Control, December
12-14, 2016, Las Vegas, NV, US
Stability and Vulnerability of Bird Flocking Behaviour: A Mathematical Analysis
Given a large number of birds in the flock, we mathematically investigate the mechanism the birds move in a collective behavior. We assume that each bird is able to know its position and velocity of other birds within a radius of communication. Thus, to be able to fly in the flock, a bird has to adjust its position and velocity according to his neighbors. For this purpose, first of all, we analyze how the connectedness of the bird interaction network affects the cohesion of the stable bird flock. We further analyze a condition when the flock is vulnerable, which is mathematically indicated by means of the presence of an articulation point in bird communication network
Robust Connectivity Analysis for Multi-Agent Systems
In this report we provide a decentralized robust control approach, which
guarantees that connectivity of a multi-agent network is maintained when
certain bounded input terms are added to the control strategy. Our main
motivation for this framework is to determine abstractions for multi-agent
systems under coupled constraints which are further exploited for high level
plan generation.Comment: 20 page
A Message Passing Strategy for Decentralized Connectivity Maintenance in Agent Removal
In a multi-agent system, agents coordinate to achieve global tasks through
local communications. Coordination usually requires sufficient information
flow, which is usually depicted by the connectivity of the communication
network. In a networked system, removal of some agents may cause a
disconnection. In order to maintain connectivity in agent removal, one can
design a robust network topology that tolerates a finite number of agent
losses, and/or develop a control strategy that recovers connectivity. This
paper proposes a decentralized control scheme based on a sequence of
replacements, each of which occurs between an agent and one of its immediate
neighbors. The replacements always end with an agent, whose relocation does not
cause a disconnection. We show that such an agent can be reached by a local
rule utilizing only some local information available in agents' immediate
neighborhoods. As such, the proposed message passing strategy guarantees the
connectivity maintenance in arbitrary agent removal. Furthermore, we
significantly improve the optimality of the proposed scheme by incorporating
-criticality (i.e. the criticality of an agent in its
-neighborhood).Comment: 9 pages, 9 figure
Identification of Hessian matrix in distributed gradient-based multi-agent coordination control systems
Multi-agent coordination control usually involves a potential function that
encodes information of a global control task, while the control input for
individual agents is often designed by a gradient-based control law. The
property of Hessian matrix associated with a potential function plays an
important role in the stability analysis of equilibrium points in
gradient-based coordination control systems. Therefore, the identification of
Hessian matrix in gradient-based multi-agent coordination systems becomes a key
step in multi-agent equilibrium analysis. However, very often the
identification of Hessian matrix via the entry-wise calculation is a very
tedious task and can easily introduce calculation errors. In this paper we
present some general and fast approaches for the identification of Hessian
matrix based on matrix differentials and calculus rules, which can easily
derive a compact form of Hessian matrix for multi-agent coordination systems.
We also present several examples on Hessian identification for certain typical
potential functions involving edge-tension distance functions and
triangular-area functions, and illustrate their applications in the context of
distributed coordination and formation control
- …