Parallel and Distributed Processing Symposium, International
Download PDF

Abstract

Planning is an artificial intelligence problem with a wide range of real-world applications. Genetic algorithms, neural networks, and simulated annealing are heuristic search methods often used to solve complex optimization problems. In this paper, we propose a genetic approach to planning in the context of workflow management and process coordination on a heterogenous grid. We report results for two planning problems, the Towers of Hanoi and the Sliding-tile puzzle.
Like what you’re reading?
Already a member?Sign In
Member Price
$11
Non-Member Price
$21
Add to CartSign In
Get this article FREE with a new membership!

Related Articles