Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
SIAM Journal on Computing
Advanced Engineering Mathematics: Maple Computer Guide
Advanced Engineering Mathematics: Maple Computer Guide
Proceedings of the 29th annual conference on Computer graphics and interactive techniques
Cooperative Mobile Robotics: Antecedents and Directions
Autonomous Robots
Calculating the meeting point of scattered robots on weighted terrain surfaces
CATS '05 Proceedings of the 2005 Australasian symposium on Theory of computing - Volume 41
Gathering of asynchronous robots with limited visibility
Theoretical Computer Science
Modelling and accuracy estimation of a new omnidirectional depth computation sensor
Pattern Recognition Letters
Planning Algorithms
Spatial Planning: A Configuration Space Approach
IEEE Transactions on Computers
Distributed Coordination Control of Multiagent Systems While Preserving Connectedness
IEEE Transactions on Robotics
Distributed Tree Rearrangements for Reachability and Robust Connectivity
HSCC '09 Proceedings of the 12th International Conference on Hybrid Systems: Computation and Control
Shooting permanent rays among disjoint polygons in the plane
Proceedings of the twenty-fifth annual symposium on Computational geometry
Robotic Routers: Algorithms and Implementation
International Journal of Robotics Research
Tell me where i am so i can meet you sooner: asynchronous rendezvous with location information
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Exploiting multipath fading with a mobile robot
International Journal of Robotics Research
Hi-index | 0.00 |
This paper presents a coordination algorithm formobile autonomous robots. Relying on distributed sensing, the robots achieve rendezvous, i.e., they move to a common location. Each robot is a point mass moving in a simply connected, nonconvex, unknown environment according to an omnidirectional kinematic model. It is equipped with line-of-sight limited-range sensors, i.e., it can measure the relative position of any object (robots or environment boundary) if and only if the object is within a given distance and there are no obstacles in between. The perimeterminimizing algorithm is designed using the notions of robust visibility, connectivity-preserving constraint sets, and proximity graphs. The algorithm provably achieves rendezvous if the interagent sensing graph is connected at any time during the evolution of the group. Simulations illustrate the theoretical results and the performance of the proposed algorithm in asynchronous setups and with measurement errors, control errors, and nonzero robot size. Simulations to illustrate the importance of visibility constraints and comparisons with the optimal centralized algorithm are also included.