Electronics Optics & Control, Volume. 21, Issue 8, 50(2014)
Path Planning for Dynamic Target Based on Kalman Filtering Algorithm and D* Algorithm
Aiming at the problems such as hysteresis and large calculation amount during path planning of moving targets we put forward a path planning method suitable for moving target in dynamic environments.First of all the Kalman filter algorithm was used to estimate the next position of the target.Then the D* algorithm was used for the path planning of the UAV by taking its current position as a starting point and the targets predicted position as a destination.In order to reduce the prediction error and ensure efficient route planning the dynamic observation periods were used.Since the Kalman filtering algorithm predicts the next state of UAV according to a recursive formula it doesnt need a lot of historical data(one at most).The prediction algorithm can not only reduce the calculation cost but also has strong real-time performance.The simulation results show that the algorithm can effectively shorten the distance and reduce the time needed for getting to the target position.
Get Citation
Copy Citation Text
WU Jian, ZHANG Dong-hao. Path Planning for Dynamic Target Based on Kalman Filtering Algorithm and D* Algorithm[J]. Electronics Optics & Control, 2014, 21(8): 50
Category:
Received: Aug. 14, 2013
Accepted: --
Published Online: Sep. 1, 2014
The Author Email: