A Genetic Algorithm for Shortest Path Motion Problem in Three Dimensions

Authors:
Marzio Pennisi;Francesco Pappalardo;Alfredo Motta;Alessandro Cincotti
Affiliations:
Department of Mathematics and Computer Science, University of Catania,;Department of Mathematics and Computer Science, University of Catania, and Faculty of Pharmacy, University of Catania,;Politecnico di Milano, Milano, Italy;School of Information Science, Japan Advanced Institute of Science and Technology, Japan
Venue:
ICIC '07 Proceedings of the 3rd International Conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications. With Aspects of Artificial Intelligence
Year:
2009

Citing 8
Cited 0

Approximation algorithms for shortest path motion planning

STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Approximate Euclidean shortest path in 3-space

SCG '94 Proceedings of the tenth annual symposium on Computational geometry
A single-exponential upper bound for finding shortest paths in three dimensions

Journal of the ACM (JACM)
An introduction to genetic algorithms

An introduction to genetic algorithms
Practical Handbook of Genetic Algorithms

Practical Handbook of Genetic Algorithms
Genetic Algorithms in Search, Optimization and Machine Learning

Genetic Algorithms in Search, Optimization and Machine Learning
Improved AntNet routing

ACM SIGCOMM Computer Communication Review - Workshop on data communication in Latin America and the Caribbean
New results on shortest paths in three dimensions

SCG '04 Proceedings of the twentieth annual symposium on Computational geometry

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present an evolutionary approach to search for near-optimal solutions for the shortest path motion problem in three dimensions (between a starting and an ending point) in the presence of obstacles. The proposed genetic algorithm makes use of newly defined concepts of crossover and mutation and effective, problem optimized, methods for candidate solution generation. We test the performances of the algorithm on several test cases.