Parking problem by oblivious mobile robots in infinite grids
From MaRDI portal
Publication:6652442
DOI10.1016/j.tcs.2024.114953MaRDI QIDQ6652442
Krishnendu Mukhopadhyaya, Abhinav Chakraborty
Publication date: 12 December 2024
Published in: Theoretical Computer Science (Search for Journal in Brave)
Distributed systems (68M14) Artificial intelligence for robotics (68T40) Distributed algorithms (68W15)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Gathering of oblivious robots on infinite grids with minimum traveled distance
- Principles of distributed systems. 14th international conference, OPODIS 2010, Tozeur, Tunisia, December 14--17, 2010. Proceedings
- Gathering of robots on anonymous grids and trees without multiplicity detection
- Arbitrary pattern formation by asynchronous, anonymous, oblivious robots
- Distributed algorithms for partitioning a swarm of autonomous mobile robots
- Gathering of robots on meeting-points: feasibility and optimal resolution algorithms
- \(k\)-circle formation by disoriented asynchronous robots
- Embedded pattern formation by asynchronous robots without chirality
- Fault-tolerant gathering of asynchronous oblivious mobile robots under one-axis agreement
- Mutual visibility on grid by asynchronous luminous robots
- Pattern Formation by Mobile Robots with Limited Visibility
- Gathering over Meeting Nodes in Infinite Grid*
- Arbitrary pattern formation by asynchronous opaque robots with lights
- Arbitrary pattern formation on infinite grid by asynchronous oblivious robots
- Optimal Gathering Over Weber Meeting Nodes in Infinite Grid
This page was built for publication: Parking problem by oblivious mobile robots in infinite grids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6652442)
