Distributed algorithms for carrying a ladder by omnidirectional robots in near optimal time

Yuichi Asahiro, Hajime Asama, Satoshi Fujita, Ichiro Suzuki, Masafumi Yamashita

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

Consider two omnidirectional robots carrying a ladder, one at each end, in the plane without obstacles. Given start and goal positions of the ladder, what is a time-optimal motion of the robots subject to given constraints on their kinematics such as maximum acceleration and velocity? Using optimal control theory, Chen, Suzuki and Yamashita solved this problem under a kinematic constraint that the speed of each robot must be either 0 or a given constant v at any moment during the motion. Their solution, which requires complicated calculation, is centralized and off-line. The objective of this paper is to demonstrate that even without the complicated calculation, a motion that is sufficiently close to time-optimal can be obtained using a simple distributed algorithm in which each robot decides its motion individually based on the current and goal positions of the ladder.

Original languageEnglish
Title of host publicationSensor Based Intelligent Robots - International Workshop, Selected Papers
EditorsHartmut Noltemeier, Horst Bunke, Henrik I. Christensen
PublisherSpringer Verlag
Pages240-254
Number of pages15
ISBN (Print)3540669337, 9783540669333
Publication statusPublished - Jan 1 1999
Event3rd International Workshop on Modelling and Integration of Sensor Based Intelligent Robot Systems, 1998 - Dagstuhl Castle, Germany
Duration: Sep 28 1998Oct 2 1998

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1724
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other3rd International Workshop on Modelling and Integration of Sensor Based Intelligent Robot Systems, 1998
CountryGermany
CityDagstuhl Castle
Period9/28/9810/2/98

Fingerprint

Ladders
Distributed Algorithms
Parallel algorithms
Robot
Robots
Motion
Kinematics
Optimal Control Theory
Control theory
Moment
Line
Demonstrate

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Asahiro, Y., Asama, H., Fujita, S., Suzuki, I., & Yamashita, M. (1999). Distributed algorithms for carrying a ladder by omnidirectional robots in near optimal time. In H. Noltemeier, H. Bunke, & H. I. Christensen (Eds.), Sensor Based Intelligent Robots - International Workshop, Selected Papers (pp. 240-254). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1724). Springer Verlag.

Distributed algorithms for carrying a ladder by omnidirectional robots in near optimal time. / Asahiro, Yuichi; Asama, Hajime; Fujita, Satoshi; Suzuki, Ichiro; Yamashita, Masafumi.

Sensor Based Intelligent Robots - International Workshop, Selected Papers. ed. / Hartmut Noltemeier; Horst Bunke; Henrik I. Christensen. Springer Verlag, 1999. p. 240-254 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1724).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Asahiro, Y, Asama, H, Fujita, S, Suzuki, I & Yamashita, M 1999, Distributed algorithms for carrying a ladder by omnidirectional robots in near optimal time. in H Noltemeier, H Bunke & HI Christensen (eds), Sensor Based Intelligent Robots - International Workshop, Selected Papers. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1724, Springer Verlag, pp. 240-254, 3rd International Workshop on Modelling and Integration of Sensor Based Intelligent Robot Systems, 1998, Dagstuhl Castle, Germany, 9/28/98.
Asahiro Y, Asama H, Fujita S, Suzuki I, Yamashita M. Distributed algorithms for carrying a ladder by omnidirectional robots in near optimal time. In Noltemeier H, Bunke H, Christensen HI, editors, Sensor Based Intelligent Robots - International Workshop, Selected Papers. Springer Verlag. 1999. p. 240-254. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Asahiro, Yuichi ; Asama, Hajime ; Fujita, Satoshi ; Suzuki, Ichiro ; Yamashita, Masafumi. / Distributed algorithms for carrying a ladder by omnidirectional robots in near optimal time. Sensor Based Intelligent Robots - International Workshop, Selected Papers. editor / Hartmut Noltemeier ; Horst Bunke ; Henrik I. Christensen. Springer Verlag, 1999. pp. 240-254 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{2af60ecea2984d4cb6f6e4f9f745ca3e,
title = "Distributed algorithms for carrying a ladder by omnidirectional robots in near optimal time",
abstract = "Consider two omnidirectional robots carrying a ladder, one at each end, in the plane without obstacles. Given start and goal positions of the ladder, what is a time-optimal motion of the robots subject to given constraints on their kinematics such as maximum acceleration and velocity? Using optimal control theory, Chen, Suzuki and Yamashita solved this problem under a kinematic constraint that the speed of each robot must be either 0 or a given constant v at any moment during the motion. Their solution, which requires complicated calculation, is centralized and off-line. The objective of this paper is to demonstrate that even without the complicated calculation, a motion that is sufficiently close to time-optimal can be obtained using a simple distributed algorithm in which each robot decides its motion individually based on the current and goal positions of the ladder.",
author = "Yuichi Asahiro and Hajime Asama and Satoshi Fujita and Ichiro Suzuki and Masafumi Yamashita",
year = "1999",
month = "1",
day = "1",
language = "English",
isbn = "3540669337",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "240--254",
editor = "Hartmut Noltemeier and Horst Bunke and Christensen, {Henrik I.}",
booktitle = "Sensor Based Intelligent Robots - International Workshop, Selected Papers",
address = "Germany",

}

TY - GEN

T1 - Distributed algorithms for carrying a ladder by omnidirectional robots in near optimal time

AU - Asahiro, Yuichi

AU - Asama, Hajime

AU - Fujita, Satoshi

AU - Suzuki, Ichiro

AU - Yamashita, Masafumi

PY - 1999/1/1

Y1 - 1999/1/1

N2 - Consider two omnidirectional robots carrying a ladder, one at each end, in the plane without obstacles. Given start and goal positions of the ladder, what is a time-optimal motion of the robots subject to given constraints on their kinematics such as maximum acceleration and velocity? Using optimal control theory, Chen, Suzuki and Yamashita solved this problem under a kinematic constraint that the speed of each robot must be either 0 or a given constant v at any moment during the motion. Their solution, which requires complicated calculation, is centralized and off-line. The objective of this paper is to demonstrate that even without the complicated calculation, a motion that is sufficiently close to time-optimal can be obtained using a simple distributed algorithm in which each robot decides its motion individually based on the current and goal positions of the ladder.

AB - Consider two omnidirectional robots carrying a ladder, one at each end, in the plane without obstacles. Given start and goal positions of the ladder, what is a time-optimal motion of the robots subject to given constraints on their kinematics such as maximum acceleration and velocity? Using optimal control theory, Chen, Suzuki and Yamashita solved this problem under a kinematic constraint that the speed of each robot must be either 0 or a given constant v at any moment during the motion. Their solution, which requires complicated calculation, is centralized and off-line. The objective of this paper is to demonstrate that even without the complicated calculation, a motion that is sufficiently close to time-optimal can be obtained using a simple distributed algorithm in which each robot decides its motion individually based on the current and goal positions of the ladder.

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

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

M3 - Conference contribution

AN - SCOPUS:84956984708

SN - 3540669337

SN - 9783540669333

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 240

EP - 254

BT - Sensor Based Intelligent Robots - International Workshop, Selected Papers

A2 - Noltemeier, Hartmut

A2 - Bunke, Horst

A2 - Christensen, Henrik I.

PB - Springer Verlag

ER -