9,547 research outputs found
Mobile Formation Coordination and Tracking Control for Multiple Non-holonomic Vehicles
This paper addresses forward motion control for trajectory tracking and
mobile formation coordination for a group of non-holonomic vehicles on SE(2).
Firstly, by constructing an intermediate attitude variable which involves
vehicles' position information and desired attitude, the translational and
rotational control inputs are designed in two stages to solve the trajectory
tracking problem. Secondly, the coordination relationships of relative
positions and headings are explored thoroughly for a group of non-holonomic
vehicles to maintain a mobile formation with rigid body motion constraints. We
prove that, except for the cases of parallel formation and translational
straight line formation, a mobile formation with strict rigid-body motion can
be achieved if and only if the ratios of linear speed to angular speed for each
individual vehicle are constants. Motion properties for mobile formation with
weak rigid-body motion are also demonstrated. Thereafter, based on the proposed
trajectory tracking approach, a distributed mobile formation control law is
designed under a directed tree graph. The performance of the proposed
controllers is validated by both numerical simulations and experiments
Decentralized Connectivity-Preserving Deployment of Large-Scale Robot Swarms
We present a decentralized and scalable approach for deployment of a robot
swarm. Our approach tackles scenarios in which the swarm must reach multiple
spatially distributed targets, and enforce the constraint that the robot
network cannot be split. The basic idea behind our work is to construct a
logical tree topology over the physical network formed by the robots. The
logical tree acts as a backbone used by robots to enforce connectivity
constraints. We study and compare two algorithms to form the logical tree:
outwards and inwards. These algorithms differ in the order in which the robots
join the tree: the outwards algorithm starts at the tree root and grows towards
the targets, while the inwards algorithm proceeds in the opposite manner. Both
algorithms perform periodic reconfiguration, to prevent suboptimal topologies
from halting the growth of the tree. Our contributions are (i) The formulation
of the two algorithms; (ii) A comparison of the algorithms in extensive
physics-based simulations; (iii) A validation of our findings through
real-robot experiments.Comment: 8 pages, 8 figures, submitted to IROS 201
A distributed optimization framework for localization and formation control: applications to vision-based measurements
Multiagent systems have been a major area of research for the last 15 years. This interest has been motivated by tasks that can be executed more rapidly in a collaborative manner or that are nearly impossible to carry out otherwise. To be effective, the agents need to have the notion of a common goal shared by the entire network (for instance, a desired formation) and individual control laws to realize the goal. The common goal is typically centralized, in the sense that it involves the state of all the agents at the same time. On the other hand, it is often desirable to have individual control laws that are distributed, in the sense that the desired action of an agent depends only on the measurements and states available at the node and at a small number of neighbors. This is an attractive quality because it implies an overall system that is modular and intrinsically more robust to communication delays and node failures
- …