Beyond Pairwise Comparisons: Unveiling Structural Landscape of Mobile Robot Models
Shota Naito, Tsukasa Ninomiya, Koichi Wada

TL;DR
This paper investigates the complex interactions between robot capabilities, observability, and synchrony in distributed mobile robot systems, revealing new structural insights and separation results beyond pairwise comparisons.
Contribution
It introduces higher-order comparisons among robot models, extending the separation map and providing new impossibility criteria for computational power in mobile robot systems.
Findings
Exponential Times Expansion (ETE) solvable only in fully-synchronous, full-light models
Internal memory insufficient under weak synchrony, but full synchrony can compensate
Classified problem solvability and limitations across different robot models
Abstract
Understanding the computational power of mobile robot systems is a fundamental challenge in distributed computing. While prior work has focused on pairwise separations between models, we explore how robot capabilities, light observability, and scheduler synchrony interact in more complex ways. We first show that the Exponential Times Expansion (ETE) problem is solvable only in the strongest model -- fully-synchronous robots with full mutual lights (). We then introduce the Hexagonal Edge Traversal (HET) and TAR(d)* problems to demonstrate how internal memory and lights interact with synchrony: under weak synchrony, internal memory alone is insufficient, while full synchrony can substitute for both lights and memory. In the asynchronous setting, we classify problems such as LP-MLCv, VEC, and ZCC to show fine-grained separations between and…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
