By Topic

Optimal path planning on 3D space using a DNA computing algorithm

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Chun-Liang Lin ; Dept. of Electr. Eng., Nat. Chung Hsing Univ., Taichung, Taiwan ; Jr-Rung Lin ; Horn-Yong Jan ; Nanjou Lin

This paper proposes a new DNA computation-based optimal path planning algorithm on 3D space. In the proposed approach, the working space is converted into several slices by the DNA coding scheme during the evolutionary process, where less blocks of every slices correspond to the areas containing loosely dense obstacles and vice versa. The molecular programming algorithm imitates the biological evolution mechanism through artificial programming to enhance the opportunities for searching the shortest moving path while avoiding obstacles. Simulation results are presented to show the effectiveness of the proposed approach.

Published in:

Industrial Electronics, 2004 IEEE International Symposium on  (Volume:1 )

Date of Conference:

4-7 May 2004