Continuous Rendezvous Algorithm for Memoryless Agents with Limited Visibility in the Euclidean Space
From MaRDI portal
Publication:5065059
DOI10.1137/20M1387584zbMath1484.93001OpenAlexW4220855687WikidataQ114074117 ScholiaQ114074117MaRDI QIDQ5065059
Publication date: 18 March 2022
Published in: SIAM Journal on Control and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/20m1387584
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Gathering of asynchronous robots with limited visibility
- Graph Theory
- Emergent behaviour of a generalized Viscek-type flocking model
- Continuous-Time Average-Preserving Opinion Dynamics with Opinion-Dependent Communications
- Asymptotic dynamics for the Cucker–Smale-type model with the Rayleigh friction
- Robust Rendezvous for Mobile Autonomous Agents via Proximity Graphs in Arbitrary Dimensions
This page was built for publication: Continuous Rendezvous Algorithm for Memoryless Agents with Limited Visibility in the Euclidean Space