Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
From MaRDI portal
Publication:4268714
DOI10.1137/S009753979628292XzbMath0940.68145OpenAlexW3182674124MaRDI QIDQ4268714
Ichiro Suzuki, Masafumi Yamashita
Publication date: 28 October 1999
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s009753979628292x
multiagent systemsdistributed algorithmsmobile robotsformation of geometric patternsanonymous robots
Related Items (only showing first 100 items - show all)
Relative formation control of mobile agents for gradient climbing and target capturing ⋮ Information Spreading by Mobile Particles on a Line ⋮ Wait-Free Gathering Without Chirality ⋮ Mobile Robots with Uncertain Visibility Sensors: Possibility Results and Lower Bounds ⋮ Model Checking of Robot Gathering ⋮ Plane formation by synchronous mobile robots without chirality ⋮ Ring exploration of myopic luminous robots with visibility more than one ⋮ Almost universal anonymous rendezvous in the plane ⋮ Unifying gathering protocols for swarms of mobile robots ⋮ Optimal \(\mathcal{L} \)-algorithms for rendezvous of asynchronous mobile robots with external-lights ⋮ A structured methodology for designing distributed algorithms for mobile entities ⋮ Distributed algorithms for filling MIS vertices of an arbitrary graph by myopic luminous robots ⋮ Brief announcement: Mutually-visible uniform circle formation by asynchronous mobile robots on grid plane ⋮ Molecular robots with chirality on grids ⋮ Molecular pattern formation on grids in the \textsc{Moblot} model ⋮ Compatibility of convergence algorithms for autonomous mobile robots (extended abstract) ⋮ Rendezvous of Asynchronous Mobile Robots with Lights ⋮ Gathering Asynchronous and Oblivious Robots on Basic Graph Topologies Under the Look-Compute-Move Model ⋮ Gathering Problem of Two Asynchronous Mobile Robots with Semi-dynamic Compasses ⋮ Remembering without Memory: Tree Exploration by Asynchronous Oblivious Robots ⋮ Shape formation by programmable particles ⋮ Optimum Gathering of Asynchronous Robots ⋮ Gathering Asynchronous Robots in the Presence of Obstacles ⋮ Explicit Communication Among Stigmergic Robots ⋮ Computing by Mobile Robotic Sensors ⋮ UNIFORM SCATTERING OF AUTONOMOUS MOBILE ROBOTS IN A GRID ⋮ On robust control algorithms for nonlinear network consensus protocols ⋮ A New Approach for Analyzing Convergence Algorithms for Mobile Robots ⋮ Flocking under hierarchical leadership with a free‐will leader ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Network Exploration by Silent and Oblivious Robots ⋮ Connectivity Preserving Network Transformers ⋮ Gathering in the plane of location-aware robots in the presence of spies ⋮ Simple and efficient local codes for distributed stable network construction ⋮ Rendezvous with constant memory ⋮ Self-stabilizing robots in highly dynamic environments ⋮ Synchronous gathering without multiplicity detection: a certified algorithm ⋮ Stand up indulgent gathering ⋮ Stand up indulgent gathering ⋮ Distributed transformations of Hamiltonian shapes based on line moves ⋮ Arbitrary pattern formation by asynchronous opaque robots with lights ⋮ Arbitrary pattern formation on infinite grid by asynchronous oblivious robots ⋮ ON THE CRITICAL EXPONENT FOR FLOCKS UNDER HIERARCHICAL LEADERSHIP ⋮ The Random Bit Complexity of Mobile Robots Scattering ⋮ Synchronous Rendezvous for Location-Aware Agents ⋮ Control of group of mobile autonomous agents via local strategies ⋮ Broadcasting Automata and Patterns on ℤ2 ⋮ Probabilistic Gathering of Agents with Simple Sensors ⋮ Optimal Probabilistic Ring Exploration by Semi-synchronous Oblivious Robots ⋮ Convergence of Mobile Robots with Uniformly-Inaccurate Sensors ⋮ A tight lower bound for semi-synchronous collaborative grid exploration ⋮ Pattern Formation by Oblivious Asynchronous Mobile Robots ⋮ TuringMobile: a Turing machine of oblivious mobile robots with limited visibility and its applications ⋮ Optimal dispersion on an anonymous ring in the presence of weak Byzantine robots ⋮ Formal verification of mobile robot protocols ⋮ Characterizing the computational power of mobile robots on graphs and implications for the Euclidean plane ⋮ Optimal strategies for maintaining a chain of relays between an explorer and a base camp ⋮ Gathering fat mobile robots with slim omnidirectional cameras ⋮ Search by a metamorphic robotic system in a finite 2D square grid ⋮ On fast pattern formation by autonomous robots ⋮ Ring exploration with myopic luminous robots ⋮ \(k\)-circle formation by disoriented asynchronous robots ⋮ Circle formation of weak robots and Lyndon words ⋮ Price of asynchrony in mobile agents computing ⋮ On time complexity for connectivity-preserving scattering of mobile robots ⋮ Impossibility of gathering by a set of autonomous mobile robots ⋮ Computing without communicating: ring exploration by asynchronous oblivious robots ⋮ Terminating distributed construction of shapes and patterns in a fair solution of automata ⋮ Bounded and inverse optimal formation stabilization of second-order agents ⋮ Shape formation by programmable particles ⋮ Optimal probabilistic ring exploration by semi-synchronous oblivious robots ⋮ Gathering asynchronous oblivious agents with local vision in regular bipartite graphs ⋮ Distributed computing by mobile robots: uniform circle formation ⋮ Trochoidal patterns generation using generalized consensus strategy for single-integrator kinematic agents ⋮ Deterministic geoleader election in disoriented anonymous systems ⋮ Gathering problems for autonomous mobile robots with lights ⋮ Asynchronous arbitrary pattern formation: the effects of a rigorous approach ⋮ Gathering of robots on anonymous grids and trees without multiplicity detection ⋮ Autonomous mobile robots with lights ⋮ Mapping simple polygons: how robots benefit from looking back ⋮ Patterned linear systems ⋮ Uniform multi-agent deployment on a ring ⋮ Self-stabilizing gathering with strong multiplicity detection ⋮ How many oblivious robots can explore a line ⋮ Team assembling problem for asynchronous heterogeneous mobile robots ⋮ Self-stabilizing gathering of mobile robots under crash or Byzantine faults ⋮ Deterministic network exploration by a single agent with Byzantine tokens ⋮ Location functions for self-stabilizing Byzantine tolerant swarms ⋮ The agreement power of disagreement ⋮ The optimal tolerance of uniform observation error for mobile robot convergence ⋮ Practical formation control of multiple unicycle-type mobile robots with limited sensing ranges ⋮ Gathering robots in graphs: the central role of synchronicity ⋮ Non-uniform circle formation algorithm for oblivious mobile robots with convergence toward uniformity ⋮ Controlling anonymous mobile agents with unidirectional locomotion to form formations on a circle ⋮ A tight lower bound for semi-synchronous collaborative grid exploration ⋮ Randomized gathering of asynchronous mobile robots ⋮ The cost of probabilistic agreement in oblivious robot networks ⋮ Building a nest by an automaton
This page was built for publication: Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
