[go: up one dir, main page]
Skip to main content
Springer Nature Link
Log in

Semi-lazy probabilistic roadmap: a parameter-tuned, resilient and robust path planning method for manipulator robots

  • ORIGINAL ARTICLE
  • Published:
The International Journal of Advanced Manufacturing Technology Aims and scope Submit manuscript

Abstract

An indispensable feature of a modern intelligent robot is its capability to plan short and safe motions in the presence of obstacles in its workspace, which is highly important for industrial manipulators in charge of automatic picking and placing, welding, painting, etc. On the other hand, collision-free motion planning of serial manipulators becomes exponentially hard with the increase of number of joints, and so efficient methods like sampling-based ones are vastly used for most real-world problems. In this paper, we propose a new variation of sampling-based methods called semi-lazy probabilistic roadmap (SLPRM) for motion planning of industrial manipulators, which benefits from the advantages of the basic probabilistic roadmap (PRM) and lazy-PRM (LPRM) methods. Unlike the exhaustive and zero collision-checking policies implemented respectively in PRM and LPRM, the SLPRM collision-checks random configurations for only m terminal links (i.e., from end-effector backwards) of the manipulator in the roadmap construction phase. As a result, on one hand, the roadmap construction time reduces compared with PRM due to less collision checks, and on the other hand, query times decrease compared with LPRM due to a better quality of the initial roadmap. A central decision in SLPRM is to properly determine the value of m, which has a direct effect on its speed. For this purpose, a new parameter tuning approach based on a combination of Shannon’s Entropy and VIKOR methods is implemented to determine the best values for m and all other parameters of the algorithm. The proposed method has been tested and implemented in simulated and real workspace scenarios for an RV-E3J Mitsubishi industrial manipulator robot, and the results showed that the mean planning time of the SLPRM was shorter compared with that of the PRM and LPRM. To make the algorithm resilient and robust to internal faults and environmental variations such as positional errors, joint failures, and obstacle displacements, we have also proposed the resilient and robust SLPRM, which through concentrated sampling and roadmap-amending procedures, can handle unexpected failures and changes.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Nof SY (1999) Handbook of industrial robotics, John Wiley & Sons

  2. Hwang YK, Ahuja N (1992) Gross motion planning—a survey. ACM Computing Surveys (CSUR) 24(3):219–291

  3. Canny J, Donald B (1988) Simplified voronoi diagrams. Discrete Comput Geom 3(3):219–36

  4. Asano T, Asano T, Guibas L, Hershberger J, Imai H (1985) Visibility-polygon search and euclidean shortest paths. In: Proc IEEE 26th Annual Symposium on Foundations of Computer Science 155–164

  5. Canny J (1985) A Voronoi method for the piano-movers problem. In: Pro IEEE Robotics and Automation 530–535

  6. Canny J (1987) A new algebraic method for robot motion planning and real geometry In: Proc IEEE 28th Annual Symposium on Foundations of Computer Science 39–48

  7. Keil JM, Sack JR (1985) Minimum decomposition of polygonal objects. Comput Geom 197–216

  8. Khatib O (1986) Real-time obstacle avoidance for manipulators and mobile robots. Int J Robot Res 5(1):90–99

    Article  Google Scholar 

  9. Latombe JC (1991) Robot motion planning, Springer Science & Business Media

  10. Masehian E, Amin-Naseri MR (2004) A Voronoi diagram-visibility graph-potential field compound algorithm for robot path planning. J Robot Syst 21(6):275–300

    Article  Google Scholar 

  11. Huang S, Chao HH, Miranda AG, (2014) Motion planning of a 7-axis robot manipulator via Modified Tension Spline and convex optimization. In Proc IEEE Int Conf in Autom Sci and Eng (CASE), pp. 1278–1283

  12. Byrne S, Naeem W, Ferguson S (2014) Improved APF strategies for dual-arm local motion planning. Trans Inst Meas Control 37(1):73–90

    Article  Google Scholar 

  13. Gao M, Chen D, Yang Y, He Z (2015) A fixed-distance planning algorithm for 6-DOF manipulators. Ind Robot: An Int J 42(6):586–599

    Article  Google Scholar 

  14. Sheng G, Jie Z, Heago C (2003) Genetic algorithm based on path planning of coordinated multi-robot manipulators. In: Proc IEEE Int Con on Robotics, Intelligent Systems and Signal Processing, pp. 763–767

  15. Masehian E, Amin-Naseri MR (2008) Sensor-based robot motion planning—a Tabu search approach. IEEE Robot Autom Mag 15(2):48–57

    Article  Google Scholar 

  16. Masehian E, Sedighizadeh D (2010) Multi-objective robot motion planning using a particle swarm optimization model. J Zhejiang Univ 11(8):607–619

    Article  Google Scholar 

  17. Savsani P, Jhala RL, Savsani VJ (2014) Comparative study of different metaheuristics for the trajectory planning of a robotic arm. IEEE Syst J 99:1–12

    Google Scholar 

  18. Contreras-Cruz MA, Ayala-Ramirez V, Hernandez-Belmonte UH (2015) Mobile robot path planning using artificial bee colony and evolutionary programming. Appl Soft Comput 30:319–328

    Article  Google Scholar 

  19. Wang X, Shi Y, Ding D, Gu X (2015) Double global optimum genetic algorithm–particle swarm optimization-based welding robot path planning. Eng Optim:1–18

  20. Kavraki LE, Švestka P, Latombe JC, Overmars MH (1996) Probabilistic roadmaps for path planning in high-dimensional configuration spaces. IEEE Trans Robot Autom 12(4):566–580

    Article  Google Scholar 

  21. LaValle SM (1998) Rapidly–exploring random trees: a new tool for path planning. Computer Science Dept, Iowa State Univ

  22. Chakravorty S, Kumar S (2011) Generalized sampling-based motion planners. IEEE Trans Syst Man Cybern, Part B: Cybern 41(3):855–866

    Article  Google Scholar 

  23. Devaurs D, Siméon T, Cortés J (2015) Efficient sampling-based approaches to optimal path planning in complex cost spaces. In: Algorithmic Foundations of Robotics, Springer International Publishing, pp. 143–159

  24. Hsu D, Jiang T, Reif J, Sun Z (2003) The bridge test for sampling narrow passages with probabilistic roadmap planners. In: Proc IEEE Int Conf on Robotics and Automation, pp. 4420–4426

  25. Amato NM, Bayazit OB, Dale LK (1998) OBPRM: an obstacle-based PRM for 3D workspaces. In: Agarwal P, Kavraki LE, Mason M (ed.) Robotics: The Algorithmic Perspective, AK Peters, pp. 156–168

  26. Wilmarth S, Amato NM, Stiller P (1999) MAPRM: a probabilistic roadmap planner with sampling on the medial axis of the free space. In: Proc IEEE Int Conf Robot Autom (ICRA), pp. 1024–1031

  27. Geraerts RJ, Overmars MH (2004) Sampling techniques for probabilistic roadmap planners. In: Proc Intelligent Autonomous Systems, pp. 600–609

  28. Bohlin R, Kavraki LE (2000) Path planning using lazy PRM. In: Proc IEEE Int Conf Robot Autom (ICRA), pp. 521–528

  29. Simonin E, Diard J (2008) BBPRM: A behavior–based probabilistic roadmap method. In: Proc IEEE Int Conf Systems, Man and Cybernetics, p 1719–1724

  30. Karaman S, Frazzoli E (2011) Sampling-based algorithms for optimal motion planning. Int J Robot Res 30(7):846–894

    Article  MATH  Google Scholar 

  31. Noori N, Noohi E, Moradi H, Bakhtiary AH, Ahmadabadi MN (2009) A probabilistic roadmap based planning algorithm for wheeled-tip robots manipulating polygonal objects. In: Proc IEEE Int Conf Advanced Intelligent Mechatronics, pp. 1040–1046

  32. Huang Y, Gupta K (2009) Collision–probability constrained PRM for a manipulator with base pose uncertainty. In Proc IEEE/RSJ Int Conf Intel Rob Sys (IROS), pp. 1426–1432

  33. Baumann M, Leonard S, Croft EA, Little JJ (2010) Path planning for improved visibility using a probabilistic road map. IEEE Trans Robot 26(1):95–200

    Article  Google Scholar 

  34. Barbara F, Cyrill S, Nichola A, Wolfram B (2011) Efficient motion planning for manipulation robots in environments with deformable objects. In: Proc IEEE/RSJ Int Conf Intel Rob Sys (IROS), pp. 2180–2185

  35. Byrne S, Naeem W, Ferguson S (2013) An intelligent configuration-sampling based local motion planner for robotic manipulators. In: Workshop on Robot Motion and Control (RoMoCo), pp. 147–153

  36. Kaltsoukalas K, Makris S, Chryssolouris G (2015) On generating the motion of industrial robot manipulators. Robot Comput Integr Manuf 32:65–71

    Article  Google Scholar 

  37. Choset H, Lynch KM, Hutchinson S, Kantor G, Burgard W, Kavraki LE, Thrun S (2005) Principles of robot motion: theory, algorithms, and implementations. MIT Press, Cambridge, MA, USA

    MATH  Google Scholar 

  38. Talbi EG (2009) Metaheuristics: from design to implementation, Wiley

  39. Montgomery DC (2005) Design and analysis of experiments, Wiley

  40. Taguchi G, Yokoyama Y (1993) Taguchi methods: design of experiments. American Supplier Institute Press, Millersburg

    Google Scholar 

  41. Masehian E, Akbaripour H, Mohabati-Kalejahi N (2013) Landscape analysis and efficient metaheuristics for solving the N-queens problem. Comput Optim Appl 56(3):735–764

    Article  MathSciNet  MATH  Google Scholar 

  42. Akbaripour H, Masehian E (2013) Efficient and robust parameter tuning for heuristic algorithms. Int J Ind Eng 24(2):143–150

    Google Scholar 

  43. Duckstein L, Opricovic S (1980) Multiobjective optimization in river basin development. Water Resour Res 16(1):14–20

    Article  Google Scholar 

  44. Zhang WJ, Van Luttervelt CA (2011) Toward a resilient manufacturing system. CIRP Ann Manuf Technol 60(1):469–472

    Article  Google Scholar 

  45. Lussier B, Chatila R, Ingrand F, Killijian MO, Powell D (2004) On fault tolerance and robustness in autonomous systems. In: Proc. 3rd IARP-IEEE/RAS-EURON joint workshop on technical challenges for dependable robots in human environments, pp. 351–358

  46. Sun Z, Zhang B, Cheng L, Zhang WJ (2011) Application of the redundant servomotor approach to design of path generator with dynamic performance improvement. Mech Mach Theory 46(11):1784–1795

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Industrial and Systems Engineering, Tarbiat Modares University, Tehran, 14115-143, Iran

    Hossein Akbaripour & Ellips Masehian

Authors
  1. Hossein Akbaripour
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ellips Masehian
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ellips Masehian.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Akbaripour, H., Masehian, E. Semi-lazy probabilistic roadmap: a parameter-tuned, resilient and robust path planning method for manipulator robots. Int J Adv Manuf Technol 89, 1401–1430 (2017). https://doi.org/10.1007/s00170-016-9074-6

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00170-016-9074-6

Keywords

Search

Navigation