Abstract
The problem of determining an optimal trajectory for an autonomous mobile robot in an environment with obstacles is considered. The Leapfrog approach is used to solve the ensuing system of equations derived from the first-order optimality conditions of the Pontryagin’s Minimum Principle. A comparison is made between a case in which the classical Newton Method and the Modified Newton Method are used in the shooting method for solving the two-point boundary value problem in the inner loop of the Leapfrog algorithm. It can be observed that with this modification there is an improvement in the convergence rate of the Leapfrog algorithm in general.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Bibliography
H. Sussmann, G. Tang, Shortest paths for the Reeds-Shepp car: a worked out example of the use of geometric techniques in nonlinear optimal control (Piscataway, NJ, 1991)
J.-D. Boissonnat, A. Cérézo, J. Leblond, Shortest paths of bounded curvature in the plane. J. Intell. Rob. Syst. 11, 5–20 (1994)
F.E. Bertolazzi, M.D. Lio, Symbolic-numeric indirect method for solving optimal control problems for large multibody systems. Multibody Sys. Dyn. 13, 233–252 (2005)
A. Rao, A survey of numerical methods for optimal control, in AAS/AIAA Astrodynamics Specialist Conference (2009)
C. Kaya, J. Noakes, Leapfrog algorithm for optimal control. SIAM J. Numer. Anal. 46, 2795–2817 (2008)
B.T. Matebese, D.J. Withey, M.K. Banda, Application of the Leapfrog method to robot path planning, in IEEE International Conference on Information and Automation (2014)
B. Matebese, D. Withey, K.B. Mapundi, Path planning with the Leapfrog method in the presence of obstacles, in IEEE International Conference on Robotics and Biomimetics (2016)
B. Matebese, D. Withey, M.K. Banda, Initialization of the leapfrog algorithm for mobile robot path planning, in Pattern Recognition Association of South Africa and Robotics and Mechatronics International Conference (2016)
A. Vamsikrishna, A.D. Mahindrakar, S. Tiwari, Numerical and experimental implementation of Leapfrog algorithm for optimal control of a mobile robot, in Indian Control Conference (2017)
R. Holsapple, R. Venkataraman, D. Doman, A modified simple shooting method for solving two-point boundary-value problems, in IEEE Aerospace Conference (2003)
J. Stoer, R. Burlirsch, Introduction to Numerical Analysis, 2nd edn. (Springer, New York, 1993), pp. 272–286
R. Holsapple, R. Venkataraman, D. Doman, A new, fast numerical method for solving two-point boundary value problems. J. Guid. Control Dyn. 26(3), 505–508 (2004)
A. Trent, R. Venkataraman, D. Damon, Trajectory generation using a modified simple shooting method, in IEEE Aerospace Conference (2004)
A. Trent, Trajectory generation using a modified simple shooting method, in Thesis, Master of Science, Texas Tech University (2004)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Matebese, B., Withey, D., Banda, M.K. (2018). Modified Newton’s Method in the Leapfrog Method for Mobile Robot Path Planning. In: Dash, S., Naidu, P., Bayindir, R., Das, S. (eds) Artificial Intelligence and Evolutionary Computations in Engineering Systems. Advances in Intelligent Systems and Computing, vol 668. Springer, Singapore. https://doi.org/10.1007/978-981-10-7868-2_7
Download citation
DOI: https://doi.org/10.1007/978-981-10-7868-2_7
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-10-7867-5
Online ISBN: 978-981-10-7868-2
eBook Packages: EngineeringEngineering (R0)