scientific article; zbMATH DE number 1049494
From MaRDI portal
Publication:4348608
DOI10.1002/(SICI)1097-4563(199603)13:3%3C127::AID-ROB1%3E3.0.CO;2-UzbMATH Open0875.70032MaRDI QIDQ4348608FDOQ4348608
Authors: Kazuo Sugihara, Ichiro Suzuki 
Publication date: 9 November 1997
Title of this publication is not available (Why is that?)
Cites Work
Cited In (30)
- A case study of the collision-avoidance problem based on Bernstein-Bézier path tracking for multiple robots with known constraints
- A tight lower bound for semi-synchronous collaborative grid exploration
- Circle formation of weak robots and Lyndon words
- A tight lower bound for semi-synchronous collaborative grid exploration
- Local spreading algorithms for autonomous robot systems
- Gathering of asynchronous robots with limited visibility
- Quantifying Robotic Swarm Coverage
- Distributed algorithms for partitioning a swarm of autonomous mobile robots
- Computing by mobile robotic sensors
- Remembering without memory: tree exploration by asynchronous oblivious robots
- Gathering fat mobile robots with slim omnidirectional cameras
- Forming sequences of geometric patterns with oblivious mobile robots
- Arbitrary pattern formation by asynchronous, anonymous, oblivious robots
- Gathering few fat mobile robots in the plane
- Distributed hybrid controllers for multi-agent mass games by a variable number of player agents
- Time-optimal coverage control for multiple unicycles in a drift field
- Uniform multi-agent deployment on a ring
- Non-uniform circle formation algorithm for oblivious mobile robots with convergence toward uniformity
- Self-deployment of mobile sensors on a ring
- Distributed computing by mobile robots: uniform circle formation
- Finite-time formation control of multiple nonholonomic mobile robots
- Parking problem by oblivious mobile robots in infinite grids
- Remembering without Memory: Tree Exploration by Asynchronous Oblivious Robots
- Position discovery for a system of bouncing robots
- Tight bounds for deterministic high-dimensional grid exploration
- Randomized gathering of asynchronous mobile robots
- Fault-induced dynamics of oblivious robots on a line
- Team assembling problem for asynchronous heterogeneous mobile robots
- Uniform scattering of autonomous mobile robots in a grid
- Mutual visibility by luminous robots without collisions
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4348608)
