On the computational complexity of dynamic graph problems
Theoretical Computer Science
Fully dynamic algorithms for maintaining shortest paths trees
Journal of Algorithms
Handbook of Evolutionary Computation
Handbook of Evolutionary Computation
Semi-Dynamic Shortest Paths and Breadth-First Search in Digraphs
STACS '97 Proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science
Designing Evolutionary Algorithms for Dynamic Environments
Designing Evolutionary Algorithms for Dynamic Environments
Population-based incremental learning with memory scheme for changing environments
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
Learning, anticipation and time-deception in evolutionary online dynamic optimization
GECCO '05 Proceedings of the 7th annual workshop on Genetic and evolutionary computation
Stochastic learning automata-based dynamic algorithms for the single source shortest path problem
IEA/AIE'2004 Proceedings of the 17th international conference on Innovations in applied artificial intelligence
Dynamic multi-objective optimization with evolutionary algorithms: a forward-looking approach
Proceedings of the 8th annual conference on Genetic and evolutionary computation
An Improved Genetic Algorithm of Optimum Path Planning for Mobile Robots
ISDA '06 Proceedings of the Sixth International Conference on Intelligent Systems Design and Applications - Volume 02
The gambler's ruin problem, genetic algorithms, and the sizing of populations
Evolutionary Computation
Genetic Algorithm for Shortest Driving Time in Intelligent Transportation Systems
MUE '08 Proceedings of the 2008 International Conference on Multimedia and Ubiquitous Engineering
Multiple UAVs path planning algorithms: a comparative study
Fuzzy Optimization and Decision Making
Path planning for multiple unmanned aerial vehicles by parameterized Cornu-Spirals
ACC'09 Proceedings of the 2009 conference on American Control Conference
IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews
Reduction approaches for robust shortest path problems
Computers and Operations Research
A genetic-algorithm-based approach to UAV path planning problem
SMO'05 Proceedings of the 5th WSEAS international conference on Simulation, modelling and optimization
Evolutionary Route Planner for Unmanned Air Vehicles
IEEE Transactions on Robotics
A genetic algorithm for shortest path routing problem and the sizing of populations
IEEE Transactions on Evolutionary Computation
Hi-index | 0.00 |
Navigation planning can be considered as a combination of searching and executing themost 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.