A distributed ladder transportation algorithm for two robots in a corridor

Yuichi Asahiro, Eric Chung Hui Chang, Amol Mali, Ichiro Suzuki, Masafumi Yamashita

Research output: Contribution to journalArticle

4 Citations (Scopus)

Abstract

We consider the problem of transporting a long object, such as a ladder, through a 90 degree corner in a corridor using two omni-directional robots that do not necessarily have identical characteristics. A distributed algorithm is presented in which each robot computes its own motion based on the current and goal positions of the ladder, the locations of the walls, and the motion of the other robot observed indirectly through the link between the robot and the ladder. We evaluate the performance and robustness of the algorithm using extensive computer simulation by changing several parameter values that affect the key characteristics of the robots, including the maximum speed, the guide path through the corner, and sensitivity and reaction to the motion of the other robot. The simulation results indicate that if the parameter values are chosen within certain reasonable ranges, then overall the algorithm works quite well even for robots having different characteristics. It is also shown that the robustnes s of the algorithm critically depends on the differences between the robots in the values of two parameters.

Original languageEnglish
Pages (from-to)3016-3021
Number of pages6
JournalProceedings - IEEE International Conference on Robotics and Automation
Volume3
DOIs
Publication statusPublished - Jan 1 2001

Fingerprint

Ladders
Robots
Parallel algorithms
Computer simulation

All Science Journal Classification (ASJC) codes

  • Software
  • Control and Systems Engineering
  • Artificial Intelligence
  • Electrical and Electronic Engineering

Cite this

A distributed ladder transportation algorithm for two robots in a corridor. / Asahiro, Yuichi; Chang, Eric Chung Hui; Mali, Amol; Suzuki, Ichiro; Yamashita, Masafumi.

In: Proceedings - IEEE International Conference on Robotics and Automation, Vol. 3, 01.01.2001, p. 3016-3021.

Research output: Contribution to journalArticle

Asahiro, Yuichi ; Chang, Eric Chung Hui ; Mali, Amol ; Suzuki, Ichiro ; Yamashita, Masafumi. / A distributed ladder transportation algorithm for two robots in a corridor. In: Proceedings - IEEE International Conference on Robotics and Automation. 2001 ; Vol. 3. pp. 3016-3021.
@article{29e965d0693b4afba8eab66025c6c9c2,
title = "A distributed ladder transportation algorithm for two robots in a corridor",
abstract = "We consider the problem of transporting a long object, such as a ladder, through a 90 degree corner in a corridor using two omni-directional robots that do not necessarily have identical characteristics. A distributed algorithm is presented in which each robot computes its own motion based on the current and goal positions of the ladder, the locations of the walls, and the motion of the other robot observed indirectly through the link between the robot and the ladder. We evaluate the performance and robustness of the algorithm using extensive computer simulation by changing several parameter values that affect the key characteristics of the robots, including the maximum speed, the guide path through the corner, and sensitivity and reaction to the motion of the other robot. The simulation results indicate that if the parameter values are chosen within certain reasonable ranges, then overall the algorithm works quite well even for robots having different characteristics. It is also shown that the robustnes s of the algorithm critically depends on the differences between the robots in the values of two parameters.",
author = "Yuichi Asahiro and Chang, {Eric Chung Hui} and Amol Mali and Ichiro Suzuki and Masafumi Yamashita",
year = "2001",
month = "1",
day = "1",
doi = "10.1109/ROBOT.2001.933080",
language = "English",
volume = "3",
pages = "3016--3021",
journal = "Proceedings - IEEE International Conference on Robotics and Automation",
issn = "1050-4729",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - JOUR

T1 - A distributed ladder transportation algorithm for two robots in a corridor

AU - Asahiro, Yuichi

AU - Chang, Eric Chung Hui

AU - Mali, Amol

AU - Suzuki, Ichiro

AU - Yamashita, Masafumi

PY - 2001/1/1

Y1 - 2001/1/1

N2 - We consider the problem of transporting a long object, such as a ladder, through a 90 degree corner in a corridor using two omni-directional robots that do not necessarily have identical characteristics. A distributed algorithm is presented in which each robot computes its own motion based on the current and goal positions of the ladder, the locations of the walls, and the motion of the other robot observed indirectly through the link between the robot and the ladder. We evaluate the performance and robustness of the algorithm using extensive computer simulation by changing several parameter values that affect the key characteristics of the robots, including the maximum speed, the guide path through the corner, and sensitivity and reaction to the motion of the other robot. The simulation results indicate that if the parameter values are chosen within certain reasonable ranges, then overall the algorithm works quite well even for robots having different characteristics. It is also shown that the robustnes s of the algorithm critically depends on the differences between the robots in the values of two parameters.

AB - We consider the problem of transporting a long object, such as a ladder, through a 90 degree corner in a corridor using two omni-directional robots that do not necessarily have identical characteristics. A distributed algorithm is presented in which each robot computes its own motion based on the current and goal positions of the ladder, the locations of the walls, and the motion of the other robot observed indirectly through the link between the robot and the ladder. We evaluate the performance and robustness of the algorithm using extensive computer simulation by changing several parameter values that affect the key characteristics of the robots, including the maximum speed, the guide path through the corner, and sensitivity and reaction to the motion of the other robot. The simulation results indicate that if the parameter values are chosen within certain reasonable ranges, then overall the algorithm works quite well even for robots having different characteristics. It is also shown that the robustnes s of the algorithm critically depends on the differences between the robots in the values of two parameters.

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

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

U2 - 10.1109/ROBOT.2001.933080

DO - 10.1109/ROBOT.2001.933080

M3 - Article

AN - SCOPUS:0034869469

VL - 3

SP - 3016

EP - 3021

JO - Proceedings - IEEE International Conference on Robotics and Automation

JF - Proceedings - IEEE International Conference on Robotics and Automation

SN - 1050-4729

ER -