Flexible inspection path planning based on Adaptive Genetic Algorithm

Author(s):  
Yang Zeqing ◽  
Liu Libing ◽  
Yang Weidong
2012 ◽  
Vol 468-471 ◽  
pp. 2745-2748
Author(s):  
Sheng Long Yu ◽  
Yu Ming Bo ◽  
Zhi Min Chen ◽  
Kai Zhu

A particle swarm optimization algorithm (PSO) is presented for vehicle path planning in the paper. Particle swarm optimization proposed by Kennedy and Eberhart is derived from the social behavior of the birds foraging. Particle swarm optimization algorithm a kind of swarm-based optimization method.The simulation experiments performed in this study show the better vehicle path planning ability of PSO than that of adaptive genetic algorithm and genetic algorithm. The experimental results show that the vehicle path planning by using PSO algorithm has the least cost and it is indicated that PSO algorithm has more excellent vehicle path planning ability than adaptive genetic algorithm,genetic algorithm.


2013 ◽  
Vol 446-447 ◽  
pp. 1292-1297 ◽  
Author(s):  
Da Qiao Zhang ◽  
Jiu Fen Zhao ◽  
Gang Lei ◽  
Shun Hong Wang ◽  
Xiao Long Zheng

During formation flying, Unmanned Aerial Vehicles (UAV) may need to arrive at target ahead of schedule by hurry path. Given fixed flight high mode, hurry planning method was proposed based on Adaptive Genetic Algorithm (AGA), which makes the new path shorter by locally adjusting the default path. By full considering the risk of UAV flight, the hurry path got by AGA meets the requirements of the risk cost and time amount in advance. Simulation results show that the path gotten by AGA can better meet the requirements of the time amount in advance, and evade the threat area effectively too.


2016 ◽  
Vol 2016 ◽  
pp. 1-10 ◽  
Author(s):  
Yong-feng Dong ◽  
Hong-mei Xia ◽  
Yan-cong Zhou

In the smart home environment, aiming at the disordered and multiple destinations path planning, the sequencing rule is proposed to determine the order of destinations. Within each branching process, the initial feasible path set is generated according to the law of attractive destination. A sinusoidal adaptive genetic algorithm is adopted. It can calculate the crossover probability and mutation probability adaptively changing with environment at any time. According to the cultural-genetic algorithm, it introduces the concept of reducing turns by parallelogram and reducing length by triangle in the belief space, which can improve the quality of population. And the fallback strategy can help to jump out of the “U” trap effectively. The algorithm analyses the virtual collision in dynamic environment with obstacles. According to the different collision types, different strategies are executed to avoid obstacles. The experimental results show that cultural-genetic algorithm can overcome the problems of premature and convergence of original algorithm effectively. It can avoid getting into the local optimum. And it is more effective for mobile robot path planning. Even in complex environment with static and dynamic obstacles, it can avoid collision safely and plan an optimal path rapidly at the same time.


Actuators ◽  
2021 ◽  
Vol 11 (1) ◽  
pp. 4
Author(s):  
Haoting Liu ◽  
Jianyue Ge ◽  
Yuan Wang ◽  
Jiacheng Li ◽  
Kai Ding ◽  
...  

An optimal mission assignment and path planning method of multiple unmanned aerial vehicles (UAVs) for disaster rescue is proposed. In this application, the UAVs include the drug delivery UAV, image collection UAV, and communication relay UAV. When implementing the modeling and simulation, first, three threat sources are built: the weather threat source, transmission tower threat source, and upland threat source. Second, a cost-revenue function is constructed. The flight distance, oil consumption, function descriptions of UAV, and threat source factors above are considered. The analytic hierarchy process (AHP) method is utilized to estimate the weights of cost-revenue function. Third, an adaptive genetic algorithm (AGA) is designed to solve the mission allocation task. A fitness function which considers the current and maximum iteration numbers is proposed to improve the AGA convergence performance. Finally, an optimal path plan between the neighboring mission points is computed by an improved artificial bee colony (IABC) method. A balanced searching strategy is developed to modify the IABC computational effect. Extensive simulation experiments have shown the effectiveness of our method.


2013 ◽  
Vol 325-326 ◽  
pp. 1475-1478
Author(s):  
Shen Li

In this paper, the improved adaptive genetic algorithm has been presented, which not only can overcome the early maturity and slow convergence speed of traditional genetic algorithm, and greatly improve the efficiency of genetic algorithm. This method can improve the quality of stacker path planning and work efficiency for modern automated building materials warehouse. Using the genetic algorithm toolbox of Matlab, the simulation results can further verified the feasibility and effectiveness of this method.


Sign in / Sign up

Export Citation Format

Share Document