Divide and Conquer Evolutionary TSP Solution for Vehicle Path Planning
This document has been relocated to http://scholarsmine.mst.edu/ele_comeng_facwork/1556
There were 8 downloads as of 28 Jun 2016.
Abstract
The problem of robotic area coverage is applicable to many domains, such as search, agriculture, cleaning, and machine tooling. The robotic area coverage task is concerned with moving a vehicle with an effector, or sensor, through the task space such that the sensor passes over every point in the space. For covering complex areas, back and forth paths are inadequate. This paper presents a real-time path planning architecture consisting of layers of a clustering method to divide and conquer the problem combined with a two layered, global and local optimization method. This architecture is able to optimize the execution of a series of waypoints for a restricted mobility vehicle, a fixed wing airplane.
