Universal systems of oblivious mobile robots
From MaRDI portal
Abstract: An oblivious mobile robot is a stateless computational entity located in a spatial universe, capable of moving in that universe. When activated, the robot observes the universe and the location of the other robots, chooses a destination, and moves there. The computation of the destination is made by executing an algorithm, the same for all robots, whose sole input is the current observation. No memory of all these actions is retained after the move. When the universe is a graph, distributed computations by oblivious mobile robots have been intensively studied focusing on the conditions for feasibility of basic problems (e.g., gathering, exploration) in specific classes of graphs under different schedulers. In this paper, we embark on a different, more general, type of investigation. With their movements from vertices to neighboring vertices, the robots make the system transition from one configuration to another. Viewing this transition as the computation of an abstract function, we ask which functions are computed by which systems. Our main interest is on identifying sets of systems that are "universal", in the sense that they can collectively compute all finite functions. We are able to identify several such classes of fully synchronous systems. In particular, among other results, we prove the universality of the set of all graphs with at least one robot, of any set of graphs with at least two robots whose quotient graphs contain arbitrarily long paths, and of any set of graphs with at least three robots and arbitrarily large finite girths. We then focus on the minimum size that a network must have for the robots to be able to compute all functions on a given finite set. We are able to approximate the minimum size of such a network up to a factor that tends to 2 as goes to infinity.
Recommendations
- Distributed computing by mobile robots: gathering
- Pattern formation by oblivious asynchronous mobile robots
- Network exploration by silent and oblivious robots
- Characterizing geometric patterns formable by oblivious anonymous mobile robots
- Forming sequences of geometric patterns with oblivious mobile robots
Cites work
- Computing on rings by oblivious robots: a unified approach for different tasks
- Computing without communicating: ring exploration by asynchronous oblivious robots
- Distributed computing by mobile robots: gathering
- Drawing planar graphs using the canonical ordering
- Exclusive perpetual ring exploration without chirality
- Gathering an even number of robots in an odd ring without global multiplicity detection
- Gathering asynchronous oblivious agents with local vision in regular bipartite graphs
- Gathering asynchronous oblivious mobile robots in a ring
- Gathering of robots on anonymous grids and trees without multiplicity detection
- Gathering on rings under the look-compute-move model
- Gathering six oblivious robots on anonymous symmetric rings
- Generation of Permutations by Adjacent Transposition
- Graph Decomposition for Improving Memoryless Periodic Exploration
- How many oblivious robots can explore a line
- Mobile robots gathering algorithm with local weak multiplicity in rings
- Network exploration by silent and oblivious robots
- On the self-stabilization of mobile oblivious robots in uniform rings
- Optimal deterministic ring exploration with oblivious asynchronous robots
- Optimal probabilistic ring exploration by semi-synchronous oblivious robots
- Remembering without memory: tree exploration by asynchronous oblivious robots
- Symmetry types of periodic sequences
- Taking advantage of symmetries: Gathering of many asynchronous oblivious robots on a ring
- Uniform multi-agent deployment on a ring
- Universal systems of oblivious mobile robots
This page was built for publication: Universal systems of oblivious mobile robots
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2835029)
