Showing cs.DCShow all
2 papers · 1 filter
cs.DC2024
An optimal algorithm for geodesic mutual visibility on hexagonal grids
Sahar Badri, Serafino Cicerone, Alessia Di Fonso +1
For a set of robots (or agents) moving in a graph, two properties are highly desirable: confidentiality (i.e., a message between two agents must not pass through any intermediate a…
cs.DC2023
Time-optimal geodesic mutual visibility of robots on grids within minimum area
Serafino Cicerone, Alessia Di Fonso, Gabriele Di Stefano +1
The \textsc{Mutual Visibility} is a well-known problem in the context of mobile robots. For a set of robots disposed in the Euclidean plane, it asks for moving the robots witho…