scientific article; zbMATH DE number 1049494
From MaRDI portal
Publication:4348608
DOI<127::AID-ROB1>3.0.CO;2-U 10.1002/(SICI)1097-4563(199603)13:3<127::AID-ROB1>3.0.CO;2-UzbMath0875.70032MaRDI QIDQ4348608
Publication date: 9 November 1997
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (28)
Gathering fat mobile robots with slim omnidirectional cameras ⋮ Quantifying Robotic Swarm Coverage ⋮ Circle formation of weak robots and Lyndon words ⋮ Distributed computing by mobile robots: uniform circle formation ⋮ A case study of the collision-avoidance problem based on Bernstein-Bézier path tracking for multiple robots with known constraints ⋮ Uniform multi-agent deployment on a ring ⋮ Remembering without Memory: Tree Exploration by Asynchronous Oblivious Robots ⋮ Team assembling problem for asynchronous heterogeneous mobile robots ⋮ Non-uniform circle formation algorithm for oblivious mobile robots with convergence toward uniformity ⋮ A tight lower bound for semi-synchronous collaborative grid exploration ⋮ Randomized gathering of asynchronous mobile robots ⋮ Local spreading algorithms for autonomous robot systems ⋮ Computing by Mobile Robotic Sensors ⋮ UNIFORM SCATTERING OF AUTONOMOUS MOBILE ROBOTS IN A GRID ⋮ Self-deployment of mobile sensors on a ring ⋮ Position discovery for a system of bouncing robots ⋮ Arbitrary pattern formation by asynchronous, anonymous, oblivious robots ⋮ Mutual visibility by luminous robots without collisions ⋮ Remembering without memory: tree exploration by asynchronous oblivious robots ⋮ Gathering of asynchronous robots with limited visibility ⋮ Distributed Hybrid Controllers for Multi-Agent Mass Games By A Variable Number of Player Agents ⋮ Gathering few fat mobile robots in the plane ⋮ Time-optimal coverage control for multiple unicycles in a drift field ⋮ Distributed algorithms for partitioning a swarm of autonomous mobile robots ⋮ Fault-induced dynamics of oblivious robots on a line ⋮ A tight lower bound for semi-synchronous collaborative grid exploration ⋮ Finite-time formation control of multiple nonholonomic mobile robots ⋮ Forming sequences of geometric patterns with oblivious mobile robots
Cites Work
This page was built for publication:
