By Topic

Neural network application to the obstacle avoidance path planning for CIM computer integrated manufacturing

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

2 Author(s)
Chung, C.H. ; Dept. of Control & Instrum. Eng., Kwangwood Univ., South Korea ; Lee, K.S.

Path planning is an important task for optimal motion of a robot in a structured or unstructured environment. The paper shows how to plan the shortest collision-free path in 3D, when a robot is navigated to pick up some tools or to repair some parts from various locations. A path coordinator is proposed having the capabilities of an obstacle avoidance strategy and a traveling salesman problem (TSP) strategy. The obstacle avoidance strategy is to plan the shortest collision-free path between each pair of n locations in 2D or in 3D. The TSP strategy is to compute a minimal system cost of a tour that is defined as a closed path navigating each location exactly once. The TSP strategy can be implemented by the neural network. The obstacle avoidance strategy can be implemented by the optimal edges by the modified genetic algorithm and computes the optimal nodes along the optimal edges by the recursive compensation algorithm

Published in:

Intelligent Robots and Systems '91. 'Intelligence for Mechanical Systems, Proceedings IROS '91. IEEE/RSJ International Workshop on

Date of Conference:

3-5 Nov 1991