Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
SIAM Journal on Computing
Convex Optimization
Coordination without communication: the case of the flocking problem
Discrete Applied Mathematics - Fun with algorithms 2 (FUN 2001)
Solving the robots gathering problem
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Kinematic Control of Platoons of Autonomous Vehicles
IEEE Transactions on Robotics
Broadcast control of multi-agent systems
Automatica (Journal of IFAC)
Hi-index | 0.00 |
In this paper a strategy for controlling a group of agents to achieve positional consensus is presented. The proposed technique is based on the constraint that every agents must be given the same control input through a broadcast communication mechanism. Although the control command is computed using state information in a global framework, the control input is implemented by the agents in a local coordinate frame. We propose a novel linear programming formulation that is computationally less intensive than earlier proposed methods. Moreover, we introduce a random perturbation input in the control command that helps us to achieve perfect consensus even for a large number of agents, which was not possible with the existing strategy in the literature. Moreover, we extend the method to achieve positional consensus at a pre-specified location. The effectiveness of the approach is illustrated through simulation results.