Universally Optimal Gathering Under Limited Visibility

DOI10.1007/978-3-319-69084-1_23zbMath1498.68034OpenAlexW2761818636MaRDI QIDQ5045450

Gokarna Sharma, Pavan Poudel

Publication date: 4 November 2022

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-69084-1_23

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Distributed systems (68M14) Artificial intelligence for robotics (68T40) Distributed algorithms (68W15)

Related Items (5)

On fast pattern formation by autonomous robots ⋮ Gathering a Euclidean closed chain of robots in linear time ⋮ A discrete and continuous study of the \textsc{Max-Chain-Formation} problem ⋮ Local Gathering of Mobile Robots in Three Dimensions ⋮ Gathering a Euclidean closed chain of robots in linear time and improved algorithms for chain-formation

This page was built for publication: Universally Optimal Gathering Under Limited Visibility