Distributed algorithms for reaching consensus on general functions
Automatica (Journal of IFAC)
Arbitrary pattern formation by asynchronous, anonymous, oblivious robots
Theoretical Computer Science
Adaptive self-management of teams of autonomous vehicles
Proceedings of the 6th international workshop on Middleware for pervasive and ad-hoc computing
Distributed Tree Rearrangements for Reachability and Robust Connectivity
HSCC '09 Proceedings of the 12th International Conference on Hybrid Systems: Computation and Control
Practical multiagent rendezvous through modified circumcenter algorithms
Automatica (Journal of IFAC)
Automatica (Journal of IFAC)
Impact of heterogeneous link qualities and network connectivity, on binary consensus
ACC'09 Proceedings of the 2009 conference on American Control Conference
A general framework for multiple vehicle time-coordinated path following control
ACC'09 Proceedings of the 2009 conference on American Control Conference
On connectivity maintenance in linear cyclic pursuit
ICRA'09 Proceedings of the 2009 IEEE international conference on Robotics and Automation
Stabilization of a hierarchical formation of unicycle robots with velocity and curvature constraints
IEEE Transactions on Robotics
Brief paper: Visibility maintenance via controlled invariance for leader-follower vehicle formations
Automatica (Journal of IFAC)
Automatica (Journal of IFAC)
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-Management Framework for Mobile Autonomous Systems
Journal of Network and Systems Management
Asynchronous Rendezvous Analysis via Set-valued Consensus Theory
SIAM Journal on Control and Optimization
Automatica (Journal of IFAC)
Rendezvous in space with minimal sensing and coarse actuation
Automatica (Journal of IFAC)
Hi-index | 0.03 |
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 solution to this problem consisting of individual agent strategies which are mutually synchronized in the sense that all depend on a common clock.