The following pages link to (Q4449250):
Displaying 38 items.
- Convergecast and broadcast by power-aware mobile agents (Q261352) (← links)
- Gathering asynchronous oblivious agents with local vision in regular bipartite graphs (Q392198) (← links)
- Self-stabilizing gathering with strong multiplicity detection (Q418745) (← links)
- The optimal tolerance of uniform observation error for mobile robot convergence (Q442269) (← links)
- The kissing problem: how to end a gathering when everyone kisses everyone else goodbye (Q489765) (← links)
- Connectivity preserving network transformers (Q529024) (← links)
- Separation of circulating tokens (Q555311) (← links)
- Gathering of asynchronous robots with limited visibility (Q557818) (← links)
- Asynchronous deterministic rendezvous in bounded terrains (Q650932) (← links)
- Optimal strategies for maintaining a chain of relays between an explorer and a base camp (Q838151) (← links)
- Local spreading algorithms for autonomous robot systems (Q930905) (← links)
- How to meet in anonymous network (Q930910) (← links)
- Arbitrary pattern formation by asynchronous, anonymous, oblivious robots (Q955018) (← links)
- Remembering without memory: tree exploration by asynchronous oblivious robots (Q962164) (← links)
- Characterizing geometric patterns formable by oblivious anonymous mobile robots (Q974737) (← links)
- Taking advantage of symmetries: Gathering of many asynchronous oblivious robots on a ring (Q986558) (← links)
- Gathering few fat mobile robots in the plane (Q1004312) (← links)
- Distributed algorithms for partitioning a swarm of autonomous mobile robots (Q1008735) (← links)
- The projection median of a set of points (Q1025289) (← links)
- On the transformation capability of feasible mechanisms for programmable matter (Q1741488) (← links)
- How many oblivious robots can explore a line (Q1944194) (← links)
- Deterministic rendezvous of asynchronous bounded-memory agents in polygonal terrains (Q1946493) (← links)
- Leader election for anonymous asynchronous agents in arbitrary networks (Q2251147) (← links)
- Time versus space trade-offs for rendezvous in trees (Q2251152) (← links)
- Gathering anonymous, oblivious robots on a grid (Q2310768) (← links)
- Deterministic polynomial approach in the plane (Q2353250) (← links)
- Impossibility of gathering by a set of autonomous mobile robots (Q2382675) (← links)
- Computing without communicating: ring exploration by asynchronous oblivious robots (Q2392925) (← links)
- Gathering asynchronous oblivious mobile robots in a ring (Q2474070) (← links)
- Fault-tolerant gathering of asynchronous oblivious mobile robots under one-axis agreement (Q2634716) (← links)
- Price of asynchrony in mobile agents computing (Q2637351) (← links)
- A New Approach for Analyzing Convergence Algorithms for Mobile Robots (Q3012964) (← links)
- Network Exploration by Silent and Oblivious Robots (Q3057626) (← links)
- Convergence of Mobile Robots with Uniformly-Inaccurate Sensors (Q3408180) (← links)
- Fast Multidimensional Asymptotic and Approximate Consensus (Q5090919) (← links)
- Entangled rendezvous: a possible application of Bell non-locality for mobile agents on networks (Q6042397) (← links)
- Efficient live exploration of a dynamic ring with mobile robots (Q6069843) (← links)
- Optimal Gathering Over Weber Meeting Nodes in Infinite Grid (Q6169957) (← links)
