[Paper Review] A Survey on Open Problems for Mobile Robots

Alberto Bandettini, Fabio Luporini+1 more|arXiv (Cornell University)|Nov 7, 2011

Optimization and Search Problems31 references3 citations

TL;DR

This survey identifies and analyzes two major open problems in mobile robotics: (1) whether gathering is always possible for n > 4 fat (non-point, opaque) robots in an extended CORDA model, and (2) the algorithmic challenges in boundary patrolling by mobile robots with limited visibility. It proposes that pattern formation and coordination strategies—especially under limited visibility—could enable solutions, but highlights the lack of theoretical foundations for the boundary patrolling problem in current models.

ABSTRACT

Gathering mobile robots is a widely studied problem in robotic research. This survey first introduces the related work, summarizing models and results. Then, the focus shifts on the open problem of gathering fat robots. In this context, "fat" means that the robot is not represented by a point in a bidimensional space, but it has an extent. Moreover, it can be opaque in the sense that other robots cannot "see through" it. All these issues lead to a redefinition of the original problem and an extension of the CORDA model. For at most 4 robots an algorithm is provided in the literature, but is gathering always possible for n>4 fat robots? Another open problem is considered: Boundary Patrolling by mobile robots. A set of mobile robots with constraints only on speed and visibility is working in a polygonal environment having boundary and possibly obstacles. The robots have to perform a perpetual movement (possibly within the environment) so that the maximum timespan in which a point of the boundary is not being watched by any robot is minimized.

Motivation & Objective

• To investigate the feasibility of gathering n > 4 fat, opaque robots in a distributed, memoryless setting under the CORDA model.
• To address the lack of theoretical algorithms for boundary patrolling by mobile robots with limited visibility and no explicit communication.
• To explore whether pattern formation under limited visibility can enable effective boundary patrolling strategies.
• To examine the role of visibility graphs and robot coordination in enabling distributed solutions for complex robotic tasks.
• To identify fundamental algorithmic limitations in current robot models for coordination problems.

Proposed method

• Extends the CORDA model to include fat and opaque robots, redefining visibility and movement constraints.
• Analyzes existing algorithms for point robots and adapts them to fat robot models, focusing on geometric and topological constraints.
• Proposes using distributed pattern formation (e.g., regular n-gon or line formation) as a prelude to boundary patrolling.
• Considers the use of visibility graphs to ensure connectivity during formation and patrolling phases.
• Evaluates the potential of hybrid schemes where some robots act as coordinators via indirect communication.
• Assesses the necessity of memory or communication primitives (e.g., colored lights) for phase transitions in multi-step algorithms.

Experimental results

Research questions

• RQ1 Is gathering always possible for configurations of n > 4 fat robots under the extended CORDA model?
• RQ2 Can a distributed algorithm achieve optimal boundary patrolling with limited visibility and no explicit communication?
• RQ3 How can robots form a stable, uniform formation (e.g., regular n-gon or line) under limited visibility to enable patrolling?
• RQ4 What role does the connectivity of the visibility graph play in enabling coordinated motion for patrolling or gathering?
• RQ5 Can pattern formation under limited visibility serve as a foundation for solving higher-level coordination problems like boundary patrolling?

Key findings

• For n ≤ 4, gathering algorithms exist for fat robots, but the possibility of gathering for n > 4 remains an open problem.
• The boundary patrolling problem lacks theoretical algorithmic foundations in current robot models, especially under limited visibility.
• Pattern formation under limited visibility is not yet supported by existing algorithms, particularly in models like CORDA that assume unlimited visibility.
• Forming a regular n-gon or line pattern could enable uniform boundary patrolling, but requires coordination mechanisms that are not yet established for limited visibility.
• The visibility graph must remain connected or sufficiently dense to maintain coordination, but this is not guaranteed under limited visibility.
• Without memory or communication, achieving phase transitions (e.g., from formation to patrolling) is highly challenging, suggesting a need for additional robot capabilities.