Multirobot rendezvous with visibility sensors in nonconvex environments
Anurag Ganguli, Jorge Cortes, Francesco Bullo
Abstract
This paper presents a coordination algorithm for mobile autonomous robots. Relying upon distributed sensing the robots achieve rendezvous, that is, they move to a common location. Each robot is a point mass moving in a nonconvex environment according to an omnidirectional kinematic model. Each robot is equipped with line-of-sight limited-range sensors, i.e., a robot 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 algorithm is designed using the notions of robust visibility, connectivity-preserving constraint sets, and proximity graphs. Simulations illustrate the theoretical results on the correctness of the proposed algorithm, and its performance in asynchronous setups and with sensor measurement and control errors.
Create a lesson
Related papers
GeoAAC: Geometry-Based Adaptive Action Chunking from Denoising Trajectories in VLA Policies
Xin Chen, Sen Chen, Yujuan Ding et al.
Agile-WAM: An Agile Tactile World Action Model for Contact-Rich Robot Control
Hanchu Zhou, Brendan Lynch, Raman Goyal et al.
OPTED: On-Policy Fine-Tuning for End-to-End Driving using a Render-Free Teacher
Damiano Da Col, Maximilian Igl, Peter Karkus et al.
MILER: Semantic Mid-Level Representation for Sim-to-Real Reinforcement Learning in Unstructured Autonomous Driving
Thomas Steinecker, Denis Trescher, Alexander Bienemann et al.
Underwater Visual Target Tracking with Target-Specific Depth Estimation and Adaptive Model-Fusion Predictive Control
Yuheng Zhou, Haiyang Cheng, Yanqi Feng et al.
MoWAM: Explicit Future Motion Prediction for Efficient World Action Models
Jiayu Wang, Bin Zhu, Yue Yu et al.