Trajectory Planning of Mobile Robots Using DNA Computing | Zendy

Kazuo Kiguchi | Zendy; Keigo Watanabe | Zendy; Toshio Fukuda | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Trajectory Planning of Mobile Robots Using DNA Computing

Author(s) -

Kazuo Kiguchi,

Keigo Watanabe,

Toshio Fukuda

Publication year - 2004

Publication title -

journal of advanced computational intelligence and intelligent informatics

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.172

H-Index - 20

eISSN - 1343-0130

pISSN - 1883-8014

DOI - 10.20965/jaciii.2004.p0295

Subject(s) - trajectory , computer science , dna computing , computation , robot , process (computing) , mobile robot , artificial intelligence , theoretical computer science , algorithm , physics , astronomy , operating system

DNA computers are attracting increasing attention as next-generation replacements for conventional electronic computers. Computation is realized using the chemical reaction of DNA. This paper presents optimal trajectory planning for mobile robots using DNA computing. The working area of a mobile robot is divided into many sections and the shortest trajectory avoiding obstacles in the work area is calculated by DNA computing. The location of obstacles is known in advance. In DNA computing, Watson-Crick pairing is used to find this trajectory. DNA sequences representing locations of obstacles are removed in this process. The shortest DNA molecule that begins with the start section and terminates with the goal section represents the shortest trajectory avoiding obstacles in the robot’s work area. The proposed algorithm is especially effective with a DNA molecular computer.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research