Using Genetic Algorithms for Navigation Planning in Dynamic Environments
Navigation planning can be considered as a combination of searching and executing the most convenient flight path from an initial waypoint to a destination waypoint. Generally the aim is to follow the flight path, which provides minimum fuel consumption for the air vehicle. For dynamic environments,...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2012-01-01
|
| Series: | Applied Computational Intelligence and Soft Computing |
| Online Access: | http://dx.doi.org/10.1155/2012/560184 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832556534770434048 |
|---|---|
| author | Ferhat Uçan D. Turgay Altılar |
| author_facet | Ferhat Uçan D. Turgay Altılar |
| author_sort | Ferhat Uçan |
| collection | DOAJ |
| description | Navigation planning can be considered as a combination of searching and executing the most convenient flight path from an initial waypoint to a destination waypoint. Generally the aim is to follow the flight path, which provides minimum fuel consumption for the air vehicle. For dynamic environments, constraints change dynamically during flight. This is a special case of dynamic path planning. As the main concern of this paper is flight planning, the conditions and objectives that are most probable to be used in navigation problem are considered. In this paper, the genetic algorithm solution of the dynamic flight planning problem is explained. The evolutionary dynamic navigation planning algorithm is developed for compensating the existing deficiencies of the other approaches. The existing fully dynamic algorithms process unit changes to topology one modification at a time, but when there are several such operations occurring in the environment simultaneously, the algorithms are quite inefficient. The proposed algorithm may respond to the concurrent constraint updates in a shorter time for dynamic environment. The most secure navigation of the air vehicle is planned and executed so that the fuel consumption is minimum. |
| format | Article |
| id | doaj-art-16b9a03deef648edbf589c8626548a2d |
| institution | Kabale University |
| issn | 1687-9724 1687-9732 |
| language | English |
| publishDate | 2012-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | Applied Computational Intelligence and Soft Computing |
| spelling | doaj-art-16b9a03deef648edbf589c8626548a2d2025-02-03T05:45:08ZengWileyApplied Computational Intelligence and Soft Computing1687-97241687-97322012-01-01201210.1155/2012/560184560184Using Genetic Algorithms for Navigation Planning in Dynamic EnvironmentsFerhat Uçan0D. Turgay Altılar1Center of Research for Advanced Technologies of Informatics and Security (TÜBİTAK BILGEM), 41470 Kocaeli, TurkeyComputer Engineering Department, Istanbul Technical University, 34469 Istanbul, TurkeyNavigation planning can be considered as a combination of searching and executing the most convenient flight path from an initial waypoint to a destination waypoint. Generally the aim is to follow the flight path, which provides minimum fuel consumption for the air vehicle. For dynamic environments, constraints change dynamically during flight. This is a special case of dynamic path planning. As the main concern of this paper is flight planning, the conditions and objectives that are most probable to be used in navigation problem are considered. In this paper, the genetic algorithm solution of the dynamic flight planning problem is explained. The evolutionary dynamic navigation planning algorithm is developed for compensating the existing deficiencies of the other approaches. The existing fully dynamic algorithms process unit changes to topology one modification at a time, but when there are several such operations occurring in the environment simultaneously, the algorithms are quite inefficient. The proposed algorithm may respond to the concurrent constraint updates in a shorter time for dynamic environment. The most secure navigation of the air vehicle is planned and executed so that the fuel consumption is minimum.http://dx.doi.org/10.1155/2012/560184 |
| spellingShingle | Ferhat Uçan D. Turgay Altılar Using Genetic Algorithms for Navigation Planning in Dynamic Environments Applied Computational Intelligence and Soft Computing |
| title | Using Genetic Algorithms for Navigation Planning in Dynamic Environments |
| title_full | Using Genetic Algorithms for Navigation Planning in Dynamic Environments |
| title_fullStr | Using Genetic Algorithms for Navigation Planning in Dynamic Environments |
| title_full_unstemmed | Using Genetic Algorithms for Navigation Planning in Dynamic Environments |
| title_short | Using Genetic Algorithms for Navigation Planning in Dynamic Environments |
| title_sort | using genetic algorithms for navigation planning in dynamic environments |
| url | http://dx.doi.org/10.1155/2012/560184 |
| work_keys_str_mv | AT ferhatucan usinggeneticalgorithmsfornavigationplanningindynamicenvironments AT dturgayaltılar usinggeneticalgorithmsfornavigationplanningindynamicenvironments |