A Genetic Approach to Planning in Heterogeneous Computing Environments

  • Authors:
  • Han Yu;Dan C. Marinescu;Annie S. Wu;Howard Jay Siegel

  • Affiliations:
  • -;-;-;-

  • Venue:
  • IPDPS '03 Proceedings of the 17th International Symposium on Parallel and Distributed Processing
  • Year:
  • 2003

Quantified Score

Hi-index 0.01

Visualization

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 aheterogenous grid. We report results for two planning problems, the Towers of Hanoi and the Sliding-tile puzzle.