1,353 research outputs found
Decentralized Multi-Subgroup Formation Control With Connectivity Preservation and Collision Avoidance
This paper proposes a formation control algorithm to create separated multiple formations for an undirected networked multi-agent system while preserving the network connectivity and avoiding collision among agents. Through the modified multi-consensus technique, the proposed algorithm can simultaneously divide a group of multiple agents into any arbitrary number of desired formations in a decentralized manner. Furthermore, the agents assigned to each formation group can be easily reallocated to other formation groups without network topological constraints as long as the entire network is initially connected; an operator can freely partition agents even if there is no spanning tree within each subgroup. Besides, the system can avoid collision without loosing the connectivity even during the transient period of formation by applying the existing potential function based on the network connectivity estimation. If the estimation is correct, the potential function not only guarantees the connectivity maintenance but also allows some extra edges to be broken if the network remains connected. Numerical simulations are performed to verify the feasibility and performance of the proposed multi-subgroup formation control
Cost Adaptation for Robust Decentralized Swarm Behaviour
Decentralized receding horizon control (D-RHC) provides a mechanism for
coordination in multi-agent settings without a centralized command center.
However, combining a set of different goals, costs, and constraints to form an
efficient optimization objective for D-RHC can be difficult. To allay this
problem, we use a meta-learning process -- cost adaptation -- which generates
the optimization objective for D-RHC to solve based on a set of human-generated
priors (cost and constraint functions) and an auxiliary heuristic. We use this
adaptive D-RHC method for control of mesh-networked swarm agents. This
formulation allows a wide range of tasks to be encoded and can account for
network delays, heterogeneous capabilities, and increasingly large swarms
through the adaptation mechanism. We leverage the Unity3D game engine to build
a simulator capable of introducing artificial networking failures and delays in
the swarm. Using the simulator we validate our method on an example coordinated
exploration task. We demonstrate that cost adaptation allows for more efficient
and safer task completion under varying environment conditions and increasingly
large swarm sizes. We release our simulator and code to the community for
future work.Comment: Accepted to IEEE/RSJ International Conference on Intelligent Robots
and Systems (IROS), 201
Multi-robot team formation control in the GUARDIANS project
Purpose
The GUARDIANS multi-robot team is to be deployed in a large warehouse in smoke. The team is to assist firefighters search the warehouse in the event or danger of a fire. The large dimensions of the environment together with development of smoke which drastically reduces visibility, represent major challenges for search and rescue operations. The GUARDIANS robots guide and accompany
the firefighters on site whilst indicating possible obstacles and the locations of danger and maintaining communications links.
Design/methodology/approach
In order to fulfill the aforementioned tasks the robots need to exhibit certain behaviours. Among the basic behaviours are capabilities to stay together as a
group, that is, generate a formation and navigate while keeping this formation.
The control model used to generate these behaviours is based on the so-called social potential field framework, which we adapt to the specific tasks required for the GUARDIANS scenario. All tasks can be achieved without central control, and some of the behaviours can be performed without explicit communication between the robots.
Findings
The GUARDIANS environment requires flexible formations of the robot team: the formation has to adapt itself to the circumstances. Thus the application has forced us to redefine the concept of a formation. Using the graph-theoretic terminology, we can say that a formation may be stretched out as a path or be compact as a star or wheel. We have implemented the developed behaviours in simulation environments as well as on real ERA-MOBI robots commonly referred to as Erratics. We discuss advantages and shortcomings of our model, based on the simulations as
well as on the implementation with a team of Erratics.</p
Verifiable control of a swarm of unmanned aerial vehicles
This article considers the distributed control of a swarm of unmanned aerial vehicles (UAVs) investigating autonomous pattern formation and reconfigurability. A behaviour-based approach to formation control is considered with a velocity field control algorithm developed through bifurcating potential fields. This new approach extends previous research into pattern formation using potential field theory by considering the use of bifurcation theory as a means of reconfiguring a swarm pattern through a free parameter change. The advantage of this kind of system is that it is extremely robust to individual failures, is scalpable, and also flexible. The potential field consists of a steering and repulsive term with the bifurcation of the steering potential resulting in a change of the swarm pattern. The repulsive potential ensures collision avoidance and an equally spaced final formation. The stability of the system is demonstrated to ensure that desired behaviours always occur, assuming that at large separation distances the repulsive potential can be neglected through a scale separation that exists between the steering and repulsive potential. The control laws developed are applied to a formation of ten UAVs using a velocity field tracking approach, where it is shown numerically that desired patterns can be formed safely ensuring collision avoidance
An Approach to Flocking of Robots Using Minimal Local Sensing and Common Orientation
A new algorithm for the control of robot flocking is presented. Flocks of mobile robots are created by the use of local control rules in a fully distributed way, using just local information from simple infra-red sensors and global heading information on each robot. Experiments were done to test the algorithm, yielding results in which robots behaved as expected, moving at a reasonable velocity and in a cohesive way. Up to seven robots were used in real experiments and up to fifty in simulation
Formation Control of Nonholonomic Multi-Agent Systems
This dissertation is concerned with the formation control problem of multiple agents modeled as nonholonomic wheeled mobile robots. Both kinematic and dynamic robot models are considered. Solutions are presented for a class of formation problems that include formation, maneuvering, and flocking. Graph theory and nonlinear systems theory are the key tools used in the design and stability analysis of the proposed control schemes. Simulation and/or experimental results are presented to illustrate the performance of the controllers.
In the first part, we present a leader-follower type solution to the formation maneuvering problem. The solution is based on the graph that models the coordination among the robots being a spanning tree. Our control law incorporates two types of position errors: individual tracking errors and coordination errors for leader-follower pairs in the spanning tree. The control ensures that the robots globally acquire a given planar formation while the formation as a whole globally tracks a desired trajectory, both with uniformly ultimately bounded errors. The control law is first designed at the kinematic level and then extended to the dynamic level. In the latter, we consider that parametric uncertainty exists in the equations of motion. These uncertainties are accounted for by employing an adaptive control scheme.
In the second part, we design a distance-based control scheme for the flocking of the nonholonomic agents under the assumption that the desired flocking velocity is known to all agents. The control law is designed at the kinematic level and is based on the rigidity properties of the graph modeling the sensing/control interactions among the robots. A simple input transformation is used to facilitate the control design by converting the nonholonomic model into the single-integrator equation. The resulting control ensures exponential convergence to the desired formation while the formation maneuvers according to a desired, time-varying translational velocity.
In the third part, we extend the previous flocking control framework to the case where only a subset of the agents know the desired flocking velocity. The resulting controllers include distributed observers to estimate the unknown quantities. The theory of interconnected systems is used to analyze the stability of the observer-controller system
- …