AUTHORS: Mahdi F. Ghajari, Rene V. Mayorga
Download as PDF
ABSTRACT: This Paper presents a general comprehensive computationally tractable collision free path planner for hyper-redundant manipulators multiple-query. The path planner is based on a sampling approach for obstacle avoidance and 2D trajectory planning for N-DOF robotic arms. The quality of created roadmap depends on the initializing parameters such as density as well as resolutions of occupancy grid and tip distribution grid. The motion planner has been developed for all types of manipulators, different joint types and handling various cost functions. Various scenarios have been successfully simulated for manipulators with different degrees of freedom and different types of obstacles with any given start and goal configurations. The simulation results indicate that the collision free motions in highly-constrained environments can be computed in less than a minute.
KEYWORDS: Optimal Path Planning, Hyper-redundant Manipulators, Obstacle Avoidance, Trajectory Planning
REFERENCES:
[1] T. Lozano-Perez, 'A simple motion-planning algorithm for general robot manipulators,' Robotics and Automation, IEEE Journal of, 3(3), pp. 224- 238, 1987.
[2] I. D. Walker, 'Kinematically redundant manipulators,' In Springer Handbook of Robotics, pp. 245-268, 2008.
[3] A. Feizollahi and R. V. Mayorga, “On the modeling and the optimal motion planning of manipulators via a modified D* Lite search algorithm”, WSEAS Transactions on Systems and Control, vol. 12, pp. 148-157, 2017.
[4] J. H. Reif and H. Wang, 'Social potential fields: A distributed behavioral control for autonomous robot,' Robotics and Autonomous Systems, vol. 27, no. 3, pp. 171-194, 1999.
[5] M. Morales, L. Tapia, R. Pearce, S. Rodriguez, and N. M. Amato, 'A machine learning approach for feature-sensitive motion planning,' In Algorithmic Foundations of Robotics VI, pp. 361-376, 2005.
[6] R. Bohlin and E. E. Kavraki, 'Path planning using lazy PRM,' in ICRA'00. IEEE International Conference on Vol. 1, 2000, pp. 521-528.
[7] G. Song, S. Miller, and N. M. Amato, 'Customizing PRM roadmaps at query time,' in Proceedings 2001 ICRA. IEEE International Conference on Vol. 2, 2001, pp. 1500-1505.
[8] S. M. LaValle, Planning algorithms. Cambridge university press, 2006.
[9] L. E. Kavraki, P. Svestka, J. C. Latombe, and M. H. Overmars, 'Probabilistic roadmaps for path planning in high-dimensional configuration spaces,' Robotics and Automation, IEEE Transactions on, 12(4), pp. 566-580, 1996.
[10] P. Sabetian, Feizollahi, C. F. A., and S. A. A. Moosavian, 'A compound robotic hand with two under-actuated fingers and a continuous finger,' in In Safety, Security, and Rescue Robotics (SSRR), Kyoto, 2011, pp. 238-244.
[11] W. Zeng and R. L. Church, 'Finding shortest paths on real road networks: the case for A*,' International Journal of Geographical Information Science, pp. 531-543, 2009.
[12] P. E. Hart, N. J. Nilsson, and B. Raphael, 'A formal basis for the heuristic determination of minimum cost paths,' Systems Science and Cybernetics, pp. 100-107, 1968.
[13] P. E. Hart, N. J. Nilsson, and B. Raphael, ' A formal basis for the heuristic determination of minimum cost paths,' Systems Science and Cybernetics, vol. 4, no. (2), pp. 100-107, 1968.
[14] R. V. Mayorga, F. Janabi‐sharifi, and A. K. W ong, 'A Fast Approach For The Robust Trajectory Planning Of Redundant Manipulators,' Journal of Robotic Systems, vol. 12, no. 2, pp. 147-161, Feb. 1995.
