Distributed memoryless point convergence algorithm for mobile robots with limited visibility

Abstract

We present a distributed algorithm for converging autonomous mobile robots with limited visibility toward a single point. Each robot is an omnidirectional mobile processor that repeatedly: 1) observes the relative positions of those robots that are visible; 2) computes its new position based on the observation using the given algorithm; 3) moves to that… (More)
DOI: 10.1109/70.795787

Topics

11 Figures and Tables

Statistics

0204060'01'03'05'07'09'11'13'15'17
Citations per Year

468 Citations

Semantic Scholar estimates that this publication has 468 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@article{Ando1999DistributedMP, title={Distributed memoryless point convergence algorithm for mobile robots with limited visibility}, author={Hideki Ando and Yoshinobu Oasa and Ichiro Suzuki and Masafumi Yamashita}, journal={IEEE Trans. Robotics and Automation}, year={1999}, volume={15}, pages={818-828} }