Path Planning Algorithm using D* Heuristic Method Based on PSO in Dynamic Environment
Keywords:D* Algorithm, Particle Swarm Optimization (PSO), Path Planning, known Dynamic Environment.
This paper is devoted to find a short and safe path for robot in environment with moving obstacles such as different objects, humans, animals or other robots. A mixing approach of robot path planning using the heuristic method D star (D*) algorithm based on optimization technique is used. The heuristic D* method is chosen for finding the shortest path. Furthermore, to insure the path length optimality and for enhancing the final path, it has been utilized the Particle Swarm Optimization (PSO) technique. This paper focuses on computational part of motion planning in completely changing dynamic environment at every motion sample domains. Simulation results are given to show the effectiveness of the proposed method.
Hui Miao, “Robot Path Planning in Dynamic Environments using a Simulated Annealing Based Approach”, Faculty of Science and Technology Queensland University of Technology.
F. A. Raheem and Asmaa A. Hussain, “MODIFIED C-SPACE ANALYSIS AND CONSTRUCTION FOR TWO-LINK ROBOT ARM,” no. December, 2017.
F. A. Raheem and Asmaa A. Hussain, “Applying A* Path Planning Algorithm Based on Modified C-Space Analysis”,Al-Khwarizmi Engineering Journal,Vol. 13, No. 4, P.P. 124- 136 (2017).
F. A. Raheem and and Mustafa M. Bader, “Development of Modified Path Planning Algorithm Using Artificial Potential Field ( APF ) Based on PSO for Factors Optimization,” no. December, 2017.
A. T. Sadiq F. A. Raheem, and N. A. F. Abbas, “Robot Arm Path Planning Using Modified Particle Swarm Optimization based on D * algorithm problems of local minimum stacking and has,” vol. 13, no. 3, pp. 27–37, 2017.
A. T. Sadiq, F. A. Raheem, and N. A. F. Abbas, “Optimal Trajectory Planning of 2-DOF Robot Arm Using the Integration of PSO Based on D * Algorithm and Cubic Polynomial Equation,” First Int. Conf. Eng. Res., no. March, pp. 458–467, 2017.
Kikuo Fujimura, “Motion Planning in Dynamic Environments”, Springer-Verlag Tokyo, 1991.
Anthony Stentz, “The Focused D* Algorithm for Real-Time Replanning”, Robotics Institute Carnegie Mellon University Pittsburgh, Pennsylvania 15213 U. S. A. In Proceedings of the International Joint Conference on Artificial Intelligence, August 1995.
Enric Cervera I Mateu, “Perception –Based Learning for fine motin planning in robot manipulation” , 1997
Zvi Shiller, Frederic Large and Sepanta Sekhavat, “Motion Planning in Dynamic Environments: Obstacles Moving Along Arbitrary Trajectories”, Mechanical and Aerospace Engineering,University of California, Proceedings of the 2001 IEEE.
Roudabe Seif, Mohammadreza Asghari and Oskoei,Allameh Tabataba , “Mobile Robot Path Planning by RRT* in Dynamic Environments”, April 2015 in MECS
Behnam Asadi, “Single and Dual Arm Manipulator Motion Planning Library”, 2015
Anirudh Vemula, “Safe and Efficient Navigation in Dynamic Environments,” no. July, 2017
Anthony Stentz , “The D* Algorithm for Real-Time Planning of Optimal Traverses” , The Robotics Institute Carnegie Mellon University Pittsburgh, Pennsylvania 15213 September 1994.
P. Boonyaritdachochai, et al., "Optimal congestion management in an electricity market using particle swarm optimization with time-varying acceleration coefficients," Computers & Mathematics with Applications, vol. In Press, Corrected Proof, 2010.
Riccardo Poli, James Kennedy and Tim Blackwell “Particle swarm optimization An overview “ Springer Science 1 August 2007
Enric Cervera and I Mateu, Perception –Based Learning for fine motin planning in robot manipulation, 1997.
Behnam Asadi, Single and Dual Arm Manipulator Motion Planning Library, 2015.
James Kennedy and Russell Eberhart Purdue School of Engineering and Technology (1995 IEEE).
K. T. Chaturvedi, et al., "Particle swarm optimization with time varying acceleration coefficients for non-convex economic power dispatch," International Journal of Electrical Power & Energy Systems, vol. 31, pp. 249-257, 2009.
How to Cite
Authors who submit papers with this journal agree to the following terms.