Practical multiagent rendezvous through modified circumcenter algorithms
Automatica (Journal of IFAC)
Leader-follower dynamics for unicycles
ACC'09 Proceedings of the 2009 conference on American Control Conference
A convergence result for multiagent systems subject to noise
ACC'09 Proceedings of the 2009 conference on American Control Conference
On the computational power of oblivious robots: forming a series of geometric patterns
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Connectivity preservation for multi-agent rendezvous with link failure
Automatica (Journal of IFAC)
Distributed optimal cooperative tracking control of multiple autonomous robots
Robotics and Autonomous Systems
Self-triggered coordination of robotic networks for optimal deployment
Automatica (Journal of IFAC)
Asynchronous Rendezvous Analysis via Set-valued Consensus Theory
SIAM Journal on Control and Optimization
Automatica (Journal of IFAC)
Consensus in switching networks with sectorial nonlinear couplings: Absolute stability approach
Automatica (Journal of IFAC)
Rendezvous in space with minimal sensing and coarse actuation
Automatica (Journal of IFAC)
| Hi-index | 0.01 |
This paper is concerned with the collective behavior of a group of $n1$ mobile autonomous agents, labelled $1$ through $n$, which can all move in the plane. Each agent is able to continuously track the positions of all other agents currently within its “sensing region,” where by an agent's sensing region we mean a closed disk of positive radius $r$ centered at the agent's current position. The multi-agent rendezvous problem is to devise “local” control strategies, one for each agent, which without any active communication between agents cause all members of the group to eventually rendezvous at a single unspecified location. This paper describes a family of unsynchronized strategies for solving the problem. Correctness is established appealing to the concept of “analytic synchronization.”