Robust distributed convergence algorithm for autonomous mobile robots

Yoshionobu Oasa, Ichiro Suzuki, Masafumi Yamashita

Research output: Contribution to journalConference article

11 Citations (Scopus)

Abstract

A common x-y coordinate system shared by the robots of a multi-robot system can function as a central mechanism for solving many multi-robot motion coordination problems. Under the assumption that the robots have infinite visibility, Suzuki and Yamashita considered the problem of generating such a common coordinate system using autonomous mobile robots. The idea was to reduce the problem to a motion coordination problem of forming certain geometric patterns such as a point, line segment and circle. Motivated by possible applications to physical robots, Ando et al. then proposed a point formation algorithm for the robots under the assumption that the robots have only a limited visibility range, but the correctness proof of the algorithm was still based on the following strong, unrealistic assumptions: (1) each robot is represented as a point, and (2) there are no sensor and control errors. The goal of this paper is to analyze the performance of the algorithm using computer simulation for the case where these assumptions are not satisfied, and demonstrate that the algorithm is expected to work sufficiently well even for physical robots that cannot be modeled by a point and that are subject to sensor and control errors.

Original languageEnglish
Pages (from-to)287-292
Number of pages6
JournalProceedings of the IEEE International Conference on Systems, Man and Cybernetics
Volume1
Publication statusPublished - Dec 1 1997
EventProceedings of the 1997 IEEE International Conference on Systems, Man, and Cybernetics. Part 1 (of 5) - Orlando, FL, USA
Duration: Oct 12 1997Oct 15 1997

Fingerprint

Mobile robots
Robots
Visibility
Sensors
Computer simulation

All Science Journal Classification (ASJC) codes

  • Control and Systems Engineering
  • Hardware and Architecture

Cite this

Robust distributed convergence algorithm for autonomous mobile robots. / Oasa, Yoshionobu; Suzuki, Ichiro; Yamashita, Masafumi.

In: Proceedings of the IEEE International Conference on Systems, Man and Cybernetics, Vol. 1, 01.12.1997, p. 287-292.

Research output: Contribution to journalConference article

@article{7e43aa271b2b40eca3ec09af7575b3a9,
title = "Robust distributed convergence algorithm for autonomous mobile robots",
abstract = "A common x-y coordinate system shared by the robots of a multi-robot system can function as a central mechanism for solving many multi-robot motion coordination problems. Under the assumption that the robots have infinite visibility, Suzuki and Yamashita considered the problem of generating such a common coordinate system using autonomous mobile robots. The idea was to reduce the problem to a motion coordination problem of forming certain geometric patterns such as a point, line segment and circle. Motivated by possible applications to physical robots, Ando et al. then proposed a point formation algorithm for the robots under the assumption that the robots have only a limited visibility range, but the correctness proof of the algorithm was still based on the following strong, unrealistic assumptions: (1) each robot is represented as a point, and (2) there are no sensor and control errors. The goal of this paper is to analyze the performance of the algorithm using computer simulation for the case where these assumptions are not satisfied, and demonstrate that the algorithm is expected to work sufficiently well even for physical robots that cannot be modeled by a point and that are subject to sensor and control errors.",
author = "Yoshionobu Oasa and Ichiro Suzuki and Masafumi Yamashita",
year = "1997",
month = "12",
day = "1",
language = "English",
volume = "1",
pages = "287--292",
journal = "Proceedings of the IEEE International Conference on Systems, Man and Cybernetics",
issn = "0884-3627",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - JOUR

T1 - Robust distributed convergence algorithm for autonomous mobile robots

AU - Oasa, Yoshionobu

AU - Suzuki, Ichiro

AU - Yamashita, Masafumi

PY - 1997/12/1

Y1 - 1997/12/1

N2 - A common x-y coordinate system shared by the robots of a multi-robot system can function as a central mechanism for solving many multi-robot motion coordination problems. Under the assumption that the robots have infinite visibility, Suzuki and Yamashita considered the problem of generating such a common coordinate system using autonomous mobile robots. The idea was to reduce the problem to a motion coordination problem of forming certain geometric patterns such as a point, line segment and circle. Motivated by possible applications to physical robots, Ando et al. then proposed a point formation algorithm for the robots under the assumption that the robots have only a limited visibility range, but the correctness proof of the algorithm was still based on the following strong, unrealistic assumptions: (1) each robot is represented as a point, and (2) there are no sensor and control errors. The goal of this paper is to analyze the performance of the algorithm using computer simulation for the case where these assumptions are not satisfied, and demonstrate that the algorithm is expected to work sufficiently well even for physical robots that cannot be modeled by a point and that are subject to sensor and control errors.

AB - A common x-y coordinate system shared by the robots of a multi-robot system can function as a central mechanism for solving many multi-robot motion coordination problems. Under the assumption that the robots have infinite visibility, Suzuki and Yamashita considered the problem of generating such a common coordinate system using autonomous mobile robots. The idea was to reduce the problem to a motion coordination problem of forming certain geometric patterns such as a point, line segment and circle. Motivated by possible applications to physical robots, Ando et al. then proposed a point formation algorithm for the robots under the assumption that the robots have only a limited visibility range, but the correctness proof of the algorithm was still based on the following strong, unrealistic assumptions: (1) each robot is represented as a point, and (2) there are no sensor and control errors. The goal of this paper is to analyze the performance of the algorithm using computer simulation for the case where these assumptions are not satisfied, and demonstrate that the algorithm is expected to work sufficiently well even for physical robots that cannot be modeled by a point and that are subject to sensor and control errors.

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

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

M3 - Conference article

AN - SCOPUS:0031377787

VL - 1

SP - 287

EP - 292

JO - Proceedings of the IEEE International Conference on Systems, Man and Cybernetics

JF - Proceedings of the IEEE International Conference on Systems, Man and Cybernetics

SN - 0884-3627

ER -