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.
|Titolo:||A genetic algorithm for shortest path motion problem in three dimensions|
|Data di pubblicazione:||2007|
|Appare nelle tipologie:||4.1 Contributo in Atti di convegno|