The paper presents a GA (Genetic Algorithm) for off-line path planning of autonomous small airships in known 3D (Three-Dimensional) environments with special consideration of restricted areas. The algorithm assumes that the airship is used in fire fighting and mine detection projects, so the aircraft will fly only a few meters above the ground, which means there is a high possibility of collision with obstacles. The task of the off-line path planner algorithm is to find an optimal route to visit all the predefined locations for airborne measurement exactly once per mission, without any collisions with environmental obstacles and to avoid fly over a defined restricted area. The planner task posed here is an NP problem. This paper proposes a 3D off-line path planner using GA including chromosome representation, GA crossover and collision avoidance with known obstacles. The proposed algorithm is implemented using MATLAB with Genetic Algorithms and Mapping Toolboxes. The proposed algorithm is tested using real maps of our research airfield and the result shows that the algorithm finds a near-optimal collision free path for the airship.
3D off-line path planning for autonomous airships in restricted known environments
2011
6 Seiten, 8 Bilder, 10 Quellen
Aufsatz (Konferenz)
Datenträger
Englisch
Autonomous Cargo Airships Operations System
British Library Conference Proceedings | 2008
|Modelling and Control of Small Autonomous Airships
Springer Verlag | 2005
|NTIS | 1974