An asynchronous distributed routing system for muti-robot cooperative transportation

Tatsushi Nishi, Yoshitomi Mori, Masami Konishi, Jun Imai

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

5 Citations (Scopus)

Abstract

We propose a distributed routing system for multi-robot cooperative transportation by parallel multiple processors with an asynchronous data exchanging. In the proposed method, each robot generates a routing to minimize each objective function comprising of traveling time and the penalty for violating constraints of cooperation with other robots. A near optimal routing is generated by repeating the generation of each routing and data exchanging among the robots. The asynchronous data exchanging is adopted to reduce the computation time. In order the solution not to be trapped in a local optimum, the weighting factors violating the constraints are updated with a time-dependent method during parallel computation. The proposed method is applied to a motion planning for cooperative transportation of an experimental 4 real robots system. The effectiveness of the proposed method is investigated on various types of experimental conditions.

Original languageEnglish
Title of host publication2005 IEEE/RSJ International Conference on Intelligent Robots and Systems, IROS
Pages1983-1988
Number of pages6
DOIs
Publication statusPublished - 2005
EventIEEE IRS/RSJ International Conference on Intelligent Robots and Systems, IROS 2005 - Edmonton, AB, Canada
Duration: Aug 2 2005Aug 6 2005

Other

OtherIEEE IRS/RSJ International Conference on Intelligent Robots and Systems, IROS 2005
CountryCanada
CityEdmonton, AB
Period8/2/058/6/05

Fingerprint

Robots
Motion planning

Keywords

  • Asynchronous data exchanging
  • Constrained optimization
  • Cooperative transportation
  • Distributed routing
  • Multi-robot system

ASJC Scopus subject areas

  • Artificial Intelligence
  • Computer Vision and Pattern Recognition
  • Human-Computer Interaction
  • Control and Systems Engineering

Cite this

Nishi, T., Mori, Y., Konishi, M., & Imai, J. (2005). An asynchronous distributed routing system for muti-robot cooperative transportation. In 2005 IEEE/RSJ International Conference on Intelligent Robots and Systems, IROS (pp. 1983-1988). [1545268] https://doi.org/10.1109/IROS.2005.1545268

An asynchronous distributed routing system for muti-robot cooperative transportation. / Nishi, Tatsushi; Mori, Yoshitomi; Konishi, Masami; Imai, Jun.

2005 IEEE/RSJ International Conference on Intelligent Robots and Systems, IROS. 2005. p. 1983-1988 1545268.

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

Nishi, T, Mori, Y, Konishi, M & Imai, J 2005, An asynchronous distributed routing system for muti-robot cooperative transportation. in 2005 IEEE/RSJ International Conference on Intelligent Robots and Systems, IROS., 1545268, pp. 1983-1988, IEEE IRS/RSJ International Conference on Intelligent Robots and Systems, IROS 2005, Edmonton, AB, Canada, 8/2/05. https://doi.org/10.1109/IROS.2005.1545268
Nishi T, Mori Y, Konishi M, Imai J. An asynchronous distributed routing system for muti-robot cooperative transportation. In 2005 IEEE/RSJ International Conference on Intelligent Robots and Systems, IROS. 2005. p. 1983-1988. 1545268 https://doi.org/10.1109/IROS.2005.1545268
Nishi, Tatsushi ; Mori, Yoshitomi ; Konishi, Masami ; Imai, Jun. / An asynchronous distributed routing system for muti-robot cooperative transportation. 2005 IEEE/RSJ International Conference on Intelligent Robots and Systems, IROS. 2005. pp. 1983-1988
@inproceedings{1060eadc05124d028dcc9f714ece00f6,
title = "An asynchronous distributed routing system for muti-robot cooperative transportation",
abstract = "We propose a distributed routing system for multi-robot cooperative transportation by parallel multiple processors with an asynchronous data exchanging. In the proposed method, each robot generates a routing to minimize each objective function comprising of traveling time and the penalty for violating constraints of cooperation with other robots. A near optimal routing is generated by repeating the generation of each routing and data exchanging among the robots. The asynchronous data exchanging is adopted to reduce the computation time. In order the solution not to be trapped in a local optimum, the weighting factors violating the constraints are updated with a time-dependent method during parallel computation. The proposed method is applied to a motion planning for cooperative transportation of an experimental 4 real robots system. The effectiveness of the proposed method is investigated on various types of experimental conditions.",
keywords = "Asynchronous data exchanging, Constrained optimization, Cooperative transportation, Distributed routing, Multi-robot system",
author = "Tatsushi Nishi and Yoshitomi Mori and Masami Konishi and Jun Imai",
year = "2005",
doi = "10.1109/IROS.2005.1545268",
language = "English",
isbn = "0780389123",
pages = "1983--1988",
booktitle = "2005 IEEE/RSJ International Conference on Intelligent Robots and Systems, IROS",

}

TY - GEN

T1 - An asynchronous distributed routing system for muti-robot cooperative transportation

AU - Nishi, Tatsushi

AU - Mori, Yoshitomi

AU - Konishi, Masami

AU - Imai, Jun

PY - 2005

Y1 - 2005

N2 - We propose a distributed routing system for multi-robot cooperative transportation by parallel multiple processors with an asynchronous data exchanging. In the proposed method, each robot generates a routing to minimize each objective function comprising of traveling time and the penalty for violating constraints of cooperation with other robots. A near optimal routing is generated by repeating the generation of each routing and data exchanging among the robots. The asynchronous data exchanging is adopted to reduce the computation time. In order the solution not to be trapped in a local optimum, the weighting factors violating the constraints are updated with a time-dependent method during parallel computation. The proposed method is applied to a motion planning for cooperative transportation of an experimental 4 real robots system. The effectiveness of the proposed method is investigated on various types of experimental conditions.

AB - We propose a distributed routing system for multi-robot cooperative transportation by parallel multiple processors with an asynchronous data exchanging. In the proposed method, each robot generates a routing to minimize each objective function comprising of traveling time and the penalty for violating constraints of cooperation with other robots. A near optimal routing is generated by repeating the generation of each routing and data exchanging among the robots. The asynchronous data exchanging is adopted to reduce the computation time. In order the solution not to be trapped in a local optimum, the weighting factors violating the constraints are updated with a time-dependent method during parallel computation. The proposed method is applied to a motion planning for cooperative transportation of an experimental 4 real robots system. The effectiveness of the proposed method is investigated on various types of experimental conditions.

KW - Asynchronous data exchanging

KW - Constrained optimization

KW - Cooperative transportation

KW - Distributed routing

KW - Multi-robot system

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

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

U2 - 10.1109/IROS.2005.1545268

DO - 10.1109/IROS.2005.1545268

M3 - Conference contribution

AN - SCOPUS:34547177438

SN - 0780389123

SN - 9780780389120

SP - 1983

EP - 1988

BT - 2005 IEEE/RSJ International Conference on Intelligent Robots and Systems, IROS

ER -