Multi-objective Path Planning of Fire Fighting Vehicle Based on Monotone Simulated Annealing Algorithm and A*Algorithm
The conventional path planning algorithm is designed to reduce the optimal local path optimization problem of a fire fighting vehicle.This paper proposes a route planning method that traverses multiple target points by combining an improved simula-tion annealing algorithm and A*algorithm.In the conventional simulation annealing algorithm,by increasing artificially increasing the operating temperature of the algorithm,it is possible to increase the probability of acceptance for the bad confection of the simu-lation annealing algorithm and increase the probability of jumping out of the local optimum.The simulation of the monotonous heat-ing is carried out,and the search sequence of multi-target points is obtained,and A*algorithm is used to avoid obstacles according to the travel sequence.The experimental simulation annealing algorithm has a stronger resolution and the itinerary path plan is short-er,and the combination of the simulation annealing algorithm and the A*algorithm improves the fire quenching car has good effect in the multiple objectives itinerary path planning in the complicated environment.It is found that the higher the number of target points are,the better the effect of path planning is.
fire extinguishing vehiclepath planningsimulated annealing algorithm for monotone heatingA*algorithm
国家科技期刊平台
NSTL
万方数据
