By Topic

Evolutionary Path Planning With Subpath Constraints

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
$33 $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

6 Author(s)
Julius S. Gyorfi ; Applied Research Center of Motorola, Schaumburg ; Daniel R. Gamota ; Swee Mean Mok ; John B. Szczech
more authors

We develop an evolutionary method of planning paths that are subject to subpath constraints. These constraints can include subpaths that must be incorporated into the solution path, path intersection restrictions, and obstacle avoidance. Our method involves two stages. In the first stage, a global solution is found without consideration of any obstacles. In the second stage, local planning is performed to modify the global path to avoid obstacles. Stage one involves a fixed-length chromosome formulation of a genetic algorithm that utilizes existing operators and a new subpath reversal operator. Stage two involves a graph search process. Our algorithm is applicable to the field of printed electronics where continuous-spray processes are used to deposit electrically functional material onto flexible substrates. These processes give rise to the kinds of subpath constraints we have investigated. We evaluate our algorithm by applying it to a representative problem in the printed electronics field.

Published in:

IEEE Transactions on Electronics Packaging Manufacturing  (Volume:33 ,  Issue: 2 )