Abstract
We propose a new offline motion planning method for autonomous mobile robots. To minimize traveling time, a smooth path and a time-optimal velocity profile should be generated under kinematic and dynamic constraints. In this study, we develop an effective and practical method to generate a good solution with lower computation time. The initial path is obtained from a Voronoi diagram and spline function, and is improved by iteratively changing via-points. We apply a dynamic programming algorithm to change the via-points, and a Hermite interpolation to generate a smooth trajectory. Simulation results are presented to verify the performance of the proposed method.
Similar content being viewed by others
References
Siegwart R, Nourbakhsh IR (2004) Introduction to autonomous mobile robots. The MIT Press, London
Choset H, Lunch KM, Hutchinson S, Kantor G (2005) Principles of robot motion: theory, algorithms, and implementations. The MIT Press, London
Bobrow JE (1988) Optimal robot path planning using the minimum-time criterion. IEEE J Robot Autom 4:443–450
Liu YH, Arimoto S (1995) Finding the shortest path of a disc among polygonal obstacles using a radius-independent graph. IEEE Trans Robot Autom 11:682–691
Munoz VF, Ollero A (1996) Smooth trajectory planning method for mobile robots. In: Conference on computational engineering in systems applications, pp 700–705
Wu W, Chen H, Woo PY (2000) Time optimal path planning for a wheeled mobile robot. J Robot Syst 17:585–591
Shiller Z, Gwo YR (1991) Dynamic motion planning of autonomous vehicles. IEEE Trans Robot Autom 7:241–249
Yamamoto M, Iwamura M, Mohri A (1999) Quasi-time- optimal motion planning of mobile platforms in the presence of obstacles. IEEE/RSJ Int Conf Intell Robot Syst 4:2958–2963
Haddad M, Chettibi T, Hanchi S, Lehtihe HE (2007) A random-profile approach for trajectory planning of wheeled mobile robots. Eur J Mech A Solids 26:519–540
Bakker B, Zivkovic Z, Krose B (2005) Hierarchical dynamic programming for robot path planning. IEEE/RSJ international conference on intelligent robots and systems, pp 2756–2761
Chien TL, Lai HC, Lin YC, Lin YC (2011) Dynamic programming algorithm based path planning of the multiple robot system. International conference on digital manufacturing and automation, pp 469–474
Radovnikovich M, Ka CC, Vempaty P (2011) Comparison of optimal path planning algorithms for an autonomous mobile robots. IEEE conference on technologies for practical robot application, pp 35–39
Michalewicz Z, Fogel DB (2000) How to solve it: modern heuristics. Springer, Berlin
Amini AA, Weymouth TE, Jain RC (1990) Using dynamic programming for solving variational problems in vision. IEEE Trans Pattern Anal Mach Intell 12:855–866
Geiger D, Gupta A, Costa LA, Vlontzos J (1991) Dynamic programming for detecting, tracking, and matching deformable contours. IEEE Trans Pattern Anal Mach Intell 17:294–302
Park TH, Lee BH (1992) An approach to robot motion analysis and planning for conveyor tracking. IEEE Trans Syst Man Cybern 22:378–384
Piazzi A, Bianco CGL, Romano M (2007) \(\eta \)3-Splines for the smooth path generation of wheeled mobile robots. IEEE Trans Robot 23:1089–1095
Anand VB (1993) Computer graphics and geometric modeling for engineers. Wiley, New York
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Yoon, HS., Park, TH. Motion planning of autonomous mobile robots by iterative dynamic programming. Intel Serv Robotics 8, 165–174 (2015). https://doi.org/10.1007/s11370-015-0170-5
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11370-015-0170-5