Forming sequences of geometric patterns with oblivious mobile robots

DOI10.1007/S00446-014-0220-9zbMath1331.68223OpenAlexW2078130991MaRDI QIDQ2353251

Nicola Santoro, Paola Flocchini, Masafumi Yamashita, Shantanu Das

Publication date: 8 July 2015

Published in: Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00446-014-0220-9

zbMATH Keywords

pattern formationautonomous mobile robotssequence of patternsdistributed coordinationoblivioussemi-synchronous

Mathematics Subject Classification ID

Distributed systems (68M14) Artificial intelligence for robotics (68T40)

Related Items (27)

TuringMobile: a Turing machine of oblivious mobile robots with limited visibility and its applications ⋮ Search by a metamorphic robotic system in a finite 2D square grid ⋮ On fast pattern formation by autonomous robots ⋮ Terminating distributed construction of shapes and patterns in a fair solution of automata ⋮ Shape formation by programmable particles ⋮ Pushing lines helps: efficient universal centralised transformations for programmable matter ⋮ Distributed computing by mobile robots: uniform circle formation ⋮ A structured methodology for designing distributed algorithms for mobile entities ⋮ Asynchronous arbitrary pattern formation: the effects of a rigorous approach ⋮ Molecular pattern formation on grids in the \textsc{Moblot} model ⋮ Compatibility of convergence algorithms for autonomous mobile robots (extended abstract) ⋮ Shape formation by programmable particles ⋮ Team assembling problem for asynchronous heterogeneous mobile robots ⋮ Gathering robots in graphs: the central role of synchronicity ⋮ Explicit Communication Among Stigmergic Robots ⋮ Randomized gathering of asynchronous mobile robots ⋮ On the transformation capability of feasible mechanisms for programmable matter ⋮ Mutual visibility by luminous robots without collisions ⋮ Connectivity preserving network transformers ⋮ Unnamed Item ⋮ Connectivity Preserving Network Transformers ⋮ Simple and efficient local codes for distributed stable network construction ⋮ On efficient connectivity-preserving transformations in a grid ⋮ Arbitrary pattern formation by asynchronous opaque robots with lights ⋮ Arbitrary pattern formation on infinite grid by asynchronous oblivious robots ⋮ Embedded pattern formation by asynchronous robots without chirality ⋮ Arbitrary pattern formation on infinite regular tessellation graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Oracle-based flocking of mobile robots in crash-recovery model
• Gathering of asynchronous robots with limited visibility
• Non-uniform circle formation algorithm for oblivious mobile robots with convergence toward uniformity
• Local spreading algorithms for autonomous robot systems
• Arbitrary pattern formation by asynchronous, anonymous, oblivious robots
• Characterizing geometric patterns formable by oblivious anonymous mobile robots
• Coordination without communication: the case of the flocking problem
• Pattern Formation by Mobile Robots with Limited Visibility
• Distributed Computing by Mobile Robots: Gathering
• Gathering Autonomous Mobile Robots with Dynamic Compasses: An Optimal Result
• The Multi-Agent Rendezvous Problem. Part 2: The Asynchronous Case
• Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
• Asynchronous Pattern Formation by Anonymous Oblivious Mobile Robots
• Distributed Models and Algorithms for Mobile Robot Systems
• Fault-Tolerant Gathering Algorithms for Autonomous Mobile Robots

This page was built for publication: Forming sequences of geometric patterns with oblivious mobile robots