scientific article; zbMATH DE number 1049494
From MaRDI portal
Publication:4348608
Cited in
(33)- Gathering few fat mobile robots in the plane
- Distributed algorithms for partitioning a swarm of autonomous mobile robots
- Distributed computing by mobile robots: uniform circle formation
- Team assembling problem for asynchronous heterogeneous mobile robots
- A tight lower bound for semi-synchronous collaborative grid exploration
- Randomized gathering of asynchronous mobile robots
- Time-optimal coverage control for multiple unicycles in a drift field
- Fault-induced dynamics of oblivious robots on a line
- Forming sequences of geometric patterns with oblivious mobile robots
- Distributed hybrid controllers for multi-agent mass games by a variable number of player agents
- Finite-time formation control of multiple nonholonomic mobile robots
- Uniform scattering of autonomous mobile robots in a grid
- Gathering fat mobile robots with slim omnidirectional cameras
- Remembering without Memory: Tree Exploration by Asynchronous Oblivious Robots
- Position discovery for a system of bouncing robots
- Quantifying Robotic Swarm Coverage
- A tight lower bound for semi-synchronous collaborative grid exploration
- Mutual visibility by luminous robots without collisions
- Computing by mobile robotic sensors
- Gathering of asynchronous robots with limited visibility
- 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
- Tight bounds for deterministic high-dimensional grid exploration
- Parking problem by oblivious mobile robots in infinite grids
- Compatibility of convergence algorithms for autonomous mobile robots
- Efficient coverage algorithm for mobile sensor network with unknown density function
- Computational power of autonomous robots: transparency vs. opaqueness
- Circle formation of weak robots and Lyndon words
- Non-uniform circle formation algorithm for oblivious mobile robots with convergence toward uniformity
- Local spreading algorithms for autonomous robot systems
- Self-deployment of mobile sensors on a ring
- Arbitrary pattern formation by asynchronous, anonymous, oblivious robots
- Remembering without memory: tree exploration by asynchronous oblivious robots
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)
