Distributed memoryless point convergence algorithm for mobile robots with limited visibility

Hideki Ando, Yoshinobu Oasa, Ichiro Suzuki, Masafumi Yamashita

Research output: Contribution to journalArticle

359 Citations (Scopus)

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; and 3) moves to that position. The robots' visibility is limited so that two robots can see each other if and only if they are within distance V of each other and there are no other robots between them. Our algorithm is memoryless in the sense that the next position of a robot is determined entirely from the positions of the robots that it can see at that moment. The correctness of the algorithm is proved formally under an abstract model of the robot system in which: 1) each robot is represented by a point that does not obstruct the view of other robots; 2) the robots' motion is instantaneous; 3) there are no sensor and control error; and 4) the issue of collision is ignored. The results of computer simulation under a more realistic model give convincing indication that the algorithm, if implemented on physical robots, will be robust against sensor and control error.

Original languageEnglish
Pages (from-to)818-828
Number of pages11
JournalIEEE Transactions on Robotics and Automation
Volume15
Issue number5
DOIs
Publication statusPublished - Dec 1 1999

Fingerprint

Visibility
Mobile robots
Robots
Sensors
Parallel algorithms

All Science Journal Classification (ASJC) codes

  • Control and Systems Engineering
  • Electrical and Electronic Engineering

Cite this

Distributed memoryless point convergence algorithm for mobile robots with limited visibility. / Ando, Hideki; Oasa, Yoshinobu; Suzuki, Ichiro; Yamashita, Masafumi.

In: IEEE Transactions on Robotics and Automation, Vol. 15, No. 5, 01.12.1999, p. 818-828.

Research output: Contribution to journalArticle

Ando, Hideki ; Oasa, Yoshinobu ; Suzuki, Ichiro ; Yamashita, Masafumi. / Distributed memoryless point convergence algorithm for mobile robots with limited visibility. In: IEEE Transactions on Robotics and Automation. 1999 ; Vol. 15, No. 5. pp. 818-828.
@article{bddbb162344f4e60a1dc77b7018e6057,
title = "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; and 3) moves to that position. The robots' visibility is limited so that two robots can see each other if and only if they are within distance V of each other and there are no other robots between them. Our algorithm is memoryless in the sense that the next position of a robot is determined entirely from the positions of the robots that it can see at that moment. The correctness of the algorithm is proved formally under an abstract model of the robot system in which: 1) each robot is represented by a point that does not obstruct the view of other robots; 2) the robots' motion is instantaneous; 3) there are no sensor and control error; and 4) the issue of collision is ignored. The results of computer simulation under a more realistic model give convincing indication that the algorithm, if implemented on physical robots, will be robust against sensor and control error.",
author = "Hideki Ando and Yoshinobu Oasa and Ichiro Suzuki and Masafumi Yamashita",
year = "1999",
month = "12",
day = "1",
doi = "10.1109/70.795787",
language = "English",
volume = "15",
pages = "818--828",
journal = "IEEE Transactions on Robotics and Automation",
issn = "1042-296X",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "5",

}

TY - JOUR

T1 - Distributed memoryless point convergence algorithm for mobile robots with limited visibility

AU - Ando, Hideki

AU - Oasa, Yoshinobu

AU - Suzuki, Ichiro

AU - Yamashita, Masafumi

PY - 1999/12/1

Y1 - 1999/12/1

N2 - 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; and 3) moves to that position. The robots' visibility is limited so that two robots can see each other if and only if they are within distance V of each other and there are no other robots between them. Our algorithm is memoryless in the sense that the next position of a robot is determined entirely from the positions of the robots that it can see at that moment. The correctness of the algorithm is proved formally under an abstract model of the robot system in which: 1) each robot is represented by a point that does not obstruct the view of other robots; 2) the robots' motion is instantaneous; 3) there are no sensor and control error; and 4) the issue of collision is ignored. The results of computer simulation under a more realistic model give convincing indication that the algorithm, if implemented on physical robots, will be robust against sensor and control error.

AB - 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; and 3) moves to that position. The robots' visibility is limited so that two robots can see each other if and only if they are within distance V of each other and there are no other robots between them. Our algorithm is memoryless in the sense that the next position of a robot is determined entirely from the positions of the robots that it can see at that moment. The correctness of the algorithm is proved formally under an abstract model of the robot system in which: 1) each robot is represented by a point that does not obstruct the view of other robots; 2) the robots' motion is instantaneous; 3) there are no sensor and control error; and 4) the issue of collision is ignored. The results of computer simulation under a more realistic model give convincing indication that the algorithm, if implemented on physical robots, will be robust against sensor and control error.

UR - http://www.scopus.com/inward/record.url?scp=0033338881&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0033338881&partnerID=8YFLogxK

U2 - 10.1109/70.795787

DO - 10.1109/70.795787

M3 - Article

VL - 15

SP - 818

EP - 828

JO - IEEE Transactions on Robotics and Automation

JF - IEEE Transactions on Robotics and Automation

SN - 1042-296X

IS - 5

ER -