Pages that link to "Item:Q897873"
From MaRDI portal
The following pages link to Autonomous mobile robots with lights (Q897873):
Displayed 27 items.
- Characterizing the computational power of mobile robots on graphs and implications for the Euclidean plane (Q1627966) (← links)
- Gathering of robots on meeting-points: feasibility and optimal resolution algorithms (Q1699417) (← links)
- The topology of look-compute-move robot wait-free algorithms with hard termination (Q2002056) (← links)
- On the computational power of energy-constrained mobile robots: algorithms and cross-model analysis (Q2097333) (← links)
- Gathering a Euclidean closed chain of robots in linear time and improved algorithms for chain-formation (Q2098190) (← links)
- Arbitrary pattern formation on infinite regular tessellation graphs (Q2110359) (← links)
- On fast pattern formation by autonomous robots (Q2139095) (← links)
- Ring exploration with myopic luminous robots (Q2139099) (← links)
- Gathering a Euclidean closed chain of robots in linear time (Q2148881) (← links)
- Gathering robots in graphs: the central role of synchronicity (Q2215970) (← links)
- Randomized gathering of asynchronous mobile robots (Q2222092) (← links)
- Gathering problems for autonomous mobile robots with lights (Q2680865) (← links)
- The agreement power of disagreement (Q2697537) (← links)
- Uniform Dispersal of Robots with Minimum Visibility Range (Q5056060) (← links)
- Mobile Robots with Uncertain Visibility Sensors: Possibility Results and Lower Bounds (Q5087082) (← links)
- (Q5091102) (← links)
- Exploration of High-Dimensional Grids by Finite Automata (Q5092342) (← links)
- Explicit Communication Among Stigmergic Robots (Q5384466) (← links)
- Stand up indulgent gathering (Q5918567) (← links)
- Fault-tolerant complete visibility for asynchronous robots with lights under one-axis agreement (Q5919050) (← links)
- Ring exploration of myopic luminous robots with visibility more than one (Q6044461) (← links)
- Optimal exclusive perpetual grid exploration by luminous myopic opaque robots with common chirality (Q6052703) (← links)
- Optimal \(\mathcal{L} \)-algorithms for rendezvous of asynchronous mobile robots with external-lights (Q6057840) (← links)
- A structured methodology for designing distributed algorithms for mobile entities (Q6065957) (← links)
- The canonical amoebot model: algorithms and concurrency control (Q6099032) (← links)
- The mutual visibility problem for fat robots (Q6138984) (← links)
- Rendezvous of Asynchronous Mobile Robots with Lights (Q6163643) (← links)