Trajectory planning of mobile robots using DNA computing

Kazuo Kiguchi, Keigo Watanabe, Toshio Fukuda

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

5 Citations (Scopus)

Abstract

Recently, DNA computers attract attention as computers of next generation taking over the present electronic computers. Computation can be realized by chemical reaction of DNA. This paper presents an optimal trajectory planning method of mobile robots using DNA computing. In this method, a working area of a mobile robot is divided into many sections. Then the shortest trajectory avoiding obstacles in the work area is calculated with DNA computing. The location of the obstacles is supposed to be known in advance. In the process of DNA computing, Watson-Crick pairing is performed to find the shortest trajectory in the working area. The DNA sequences representing the locations of the obstacles are removed in this process. The obtained shortest DNA molecule that begins with the start section and terminates with the goal section represents the shortest trajectory avoiding the obstacles in the work area of the mobile robot. The proposed algorithm is especially effective a DNA molecular computer.

Original languageEnglish
Title of host publicationProceedings of IEEE International Symposium on Computational Intelligence in Robotics and Automation, CIRA
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages380-385
Number of pages6
Volume2001-January
ISBN (Print)0780372034
DOIs
Publication statusPublished - 2001
Externally publishedYes
EventIEEE International Symposium on Computational Intelligence in Robotics and Automation, CIRA 2001 - Banff, Canada
Duration: Jul 29 2001Aug 1 2001

Other

OtherIEEE International Symposium on Computational Intelligence in Robotics and Automation, CIRA 2001
CountryCanada
CityBanff
Period7/29/018/1/01

Fingerprint

DNA Computing
Trajectory Planning
Mobile Robot
Mobile robots
DNA
Trajectories
Planning
Trajectory
Optimal Trajectory
Terminate
Chemical Reaction
Pairing
DNA Sequence
Molecules
Electronics
DNA sequences
Chemical reactions

ASJC Scopus subject areas

  • Computational Mathematics

Cite this

Kiguchi, K., Watanabe, K., & Fukuda, T. (2001). Trajectory planning of mobile robots using DNA computing. In Proceedings of IEEE International Symposium on Computational Intelligence in Robotics and Automation, CIRA (Vol. 2001-January, pp. 380-385). [1013229] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/CIRA.2001.1013229

Trajectory planning of mobile robots using DNA computing. / Kiguchi, Kazuo; Watanabe, Keigo; Fukuda, Toshio.

Proceedings of IEEE International Symposium on Computational Intelligence in Robotics and Automation, CIRA. Vol. 2001-January Institute of Electrical and Electronics Engineers Inc., 2001. p. 380-385 1013229.

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

Kiguchi, K, Watanabe, K & Fukuda, T 2001, Trajectory planning of mobile robots using DNA computing. in Proceedings of IEEE International Symposium on Computational Intelligence in Robotics and Automation, CIRA. vol. 2001-January, 1013229, Institute of Electrical and Electronics Engineers Inc., pp. 380-385, IEEE International Symposium on Computational Intelligence in Robotics and Automation, CIRA 2001, Banff, Canada, 7/29/01. https://doi.org/10.1109/CIRA.2001.1013229
Kiguchi K, Watanabe K, Fukuda T. Trajectory planning of mobile robots using DNA computing. In Proceedings of IEEE International Symposium on Computational Intelligence in Robotics and Automation, CIRA. Vol. 2001-January. Institute of Electrical and Electronics Engineers Inc. 2001. p. 380-385. 1013229 https://doi.org/10.1109/CIRA.2001.1013229
Kiguchi, Kazuo ; Watanabe, Keigo ; Fukuda, Toshio. / Trajectory planning of mobile robots using DNA computing. Proceedings of IEEE International Symposium on Computational Intelligence in Robotics and Automation, CIRA. Vol. 2001-January Institute of Electrical and Electronics Engineers Inc., 2001. pp. 380-385
@inproceedings{ccbaaa35bb284ad08e53c55d7a4c2918,
title = "Trajectory planning of mobile robots using DNA computing",
abstract = "Recently, DNA computers attract attention as computers of next generation taking over the present electronic computers. Computation can be realized by chemical reaction of DNA. This paper presents an optimal trajectory planning method of mobile robots using DNA computing. In this method, a working area of a mobile robot is divided into many sections. Then the shortest trajectory avoiding obstacles in the work area is calculated with DNA computing. The location of the obstacles is supposed to be known in advance. In the process of DNA computing, Watson-Crick pairing is performed to find the shortest trajectory in the working area. The DNA sequences representing the locations of the obstacles are removed in this process. The obtained shortest DNA molecule that begins with the start section and terminates with the goal section represents the shortest trajectory avoiding the obstacles in the work area of the mobile robot. The proposed algorithm is especially effective a DNA molecular computer.",
author = "Kazuo Kiguchi and Keigo Watanabe and Toshio Fukuda",
year = "2001",
doi = "10.1109/CIRA.2001.1013229",
language = "English",
isbn = "0780372034",
volume = "2001-January",
pages = "380--385",
booktitle = "Proceedings of IEEE International Symposium on Computational Intelligence in Robotics and Automation, CIRA",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - GEN

T1 - Trajectory planning of mobile robots using DNA computing

AU - Kiguchi, Kazuo

AU - Watanabe, Keigo

AU - Fukuda, Toshio

PY - 2001

Y1 - 2001

N2 - Recently, DNA computers attract attention as computers of next generation taking over the present electronic computers. Computation can be realized by chemical reaction of DNA. This paper presents an optimal trajectory planning method of mobile robots using DNA computing. In this method, a working area of a mobile robot is divided into many sections. Then the shortest trajectory avoiding obstacles in the work area is calculated with DNA computing. The location of the obstacles is supposed to be known in advance. In the process of DNA computing, Watson-Crick pairing is performed to find the shortest trajectory in the working area. The DNA sequences representing the locations of the obstacles are removed in this process. The obtained shortest DNA molecule that begins with the start section and terminates with the goal section represents the shortest trajectory avoiding the obstacles in the work area of the mobile robot. The proposed algorithm is especially effective a DNA molecular computer.

AB - Recently, DNA computers attract attention as computers of next generation taking over the present electronic computers. Computation can be realized by chemical reaction of DNA. This paper presents an optimal trajectory planning method of mobile robots using DNA computing. In this method, a working area of a mobile robot is divided into many sections. Then the shortest trajectory avoiding obstacles in the work area is calculated with DNA computing. The location of the obstacles is supposed to be known in advance. In the process of DNA computing, Watson-Crick pairing is performed to find the shortest trajectory in the working area. The DNA sequences representing the locations of the obstacles are removed in this process. The obtained shortest DNA molecule that begins with the start section and terminates with the goal section represents the shortest trajectory avoiding the obstacles in the work area of the mobile robot. The proposed algorithm is especially effective a DNA molecular computer.

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

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

U2 - 10.1109/CIRA.2001.1013229

DO - 10.1109/CIRA.2001.1013229

M3 - Conference contribution

AN - SCOPUS:49949118936

SN - 0780372034

VL - 2001-January

SP - 380

EP - 385

BT - Proceedings of IEEE International Symposium on Computational Intelligence in Robotics and Automation, CIRA

PB - Institute of Electrical and Electronics Engineers Inc.

ER -