E. M. Arkin, M. A. Bender, S. Fekete, T.-R. Hsiang, and J. S. B. Mitchell. Algorithms for rapidly dispersing robot swarms in unknown environments. In Proc. 5th Workshop Algorithmic Found. Robot., pages 77--94, 2002. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Online Dispersion Algorithms for Swarms of Robots - Hsiang, Arkin, Bender.. Self-citation (Hsiang Arkin Bender Fekete Mitchell) (Correct)
No context found.
T.-R. Hsiang, E. M. Arkin, M. Bender, S. P. Fekete, and J. S. B. Mitchell. Algorithms for rapidly dispersing robot swarms in unknown environments. 5th International Workshop on Algorithmic Foundations of Robotics, 2002.
Online Dispersion Algorithms for Swarms of Robots - Hsiang, Arkin, Bender, Fekete Self-citation (Hsiang Arkin Bender Fekete Mitchell) (Correct)
....is lled when there is a robot in each pixel. Robots are primitive nite automata, only having local communication, local sensors, and a constant sized memory. These local autonomous agents are not centrally controlled, yet are expected to perform the global task of dispersing. In a recent paper [2], we provide a variety of theoretical results, including: Copyright is held by the author owner. SoCG 03, June 8 10, 2003, San Diego, California, USA. ACM 1 58113 663 3 03 0006. Algorithms for the single door case (i.e. k = 1) based on leader follower strategies. Our algorithms are ....
....then to go right) results in a strategy that e ectively makes the robots hug the left wall as much as possible. The robots executing this strategy ll the domain in a laminar ow behavior, which results in a provable online strategy, with makespan within a factor O(log(k 1) of optimal [2]. A gure in the video shows an instance for which this competitive ratio is optimal, assuming a strategy using only local information. The next animation shows the simulator with an environment having 3 doors (of widths 2, 3, and 7) with the Laminar Flow Leader Follower (LFLF) algorithm. The ....
T.-R. Hsiang, E. M. Arkin, M. Bender, S. P. Fekete, and J. S. B. Mitchell. Algorithms for rapidly dispersing robot swarms in unknown environments. 5th International Workshop on Algorithmic Foundations of Robotics, 2002.
On the Complexity of Randolph's Robot Game - Engels, Kamphans (2005) (Correct)
No context found.
E. M. Arkin, M. A. Bender, S. Fekete, T.-R. Hsiang, and J. S. B. Mitchell. Algorithms for rapidly dispersing robot swarms in unknown environments. In Proc. 5th Workshop Algorithmic Found. Robot., pages 77--94, 2002.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC