4 papers
Gathering in Non-Vertex-Transitive Graphs Under Round Robin
Serafino Cicerone, Alessia Di Fonso, Gabriele Di Stefano +1
The Gathering problem for a swarm of robots asks for a distributed algorithm that brings such entities to a common place, not known in advance. We consider the well-known OBLOT mod…
On the impact of unlimited computational power in OBLOT: consequences for synchronous robots on graphs
Serafino Cicerone, Alessia Di Fonso, Gabriele Di Stefano +1
The OBLOT model has been extensively studied in theoretical swarm robotics. It assumes weak capabilities for the involved mobile robots, such as they are anonymous, disoriented, no…
About the Infinite Windy Firebreak Location problem
Marc Demange, Alessia Di Fonso, Gabriele Di Stefano +1
The severity of wildfires can be mitigated adopting preventive measures like the construction of firebreaks that are strips of land from which the vegetation is completely removed.…
A graph theoretical approach to the firebreak locating problem
Marc Demange, Alessia Di Fonso, Gabriele Di Stefano +1
In the last decade, wildfires have become wider and more destructive. The climate change and the growth of urban areas may further increase the probability of incidence of large-sc…