A structured methodology for designing distributed algorithms for mobile entities
From MaRDI portal
Publication:6065957
DOI10.1016/J.INS.2021.05.043zbMath1529.68317MaRDI QIDQ6065957
Serafino Cicerone, Gabriele Di Stefano, Alfredo Navarra
Publication date: 11 December 2023
Published in: Information Sciences (Search for Journal in Brave)
Related Items (1)
Cites Work
- Autonomous mobile robots with lights
- Fast periodic graph exploration with constant memory
- Arbitrary pattern formation by asynchronous, anonymous, oblivious robots
- Characterizing geometric patterns formable by oblivious anonymous mobile robots
- Characterizing the computational power of mobile robots on graphs and implications for the Euclidean plane
- When patrolmen become corrupted: monitoring a graph using faulty mobile robots
- Gathering of robots in a ring with mobile faults
- An artificial moment method for conflict resolutions with robots being close to their targets
- Gathering on rings under the look-compute-move model
- Fair Hitting Sequence Problem: scheduling activities with varied frequency requirements
- Embedded pattern formation by asynchronous robots without chirality
- Forming sequences of geometric patterns with oblivious mobile robots
- Fence patrolling by mobile agents with distinct speeds
- Asynchronous arbitrary pattern formation: the effects of a rigorous approach
- Distributed Computing by Mobile Robots: Gathering
- Model Checking of Robot Gathering
- Leader Election Problem versus Pattern Formation Problem
- Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
- Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
- Pattern Formation by Oblivious Asynchronous Mobile Robots
- Arbitrary pattern formation with four robots
This page was built for publication: A structured methodology for designing distributed algorithms for mobile entities
