Direct multiple shooting method for solving approximate shortest path problems

DOI10.1016/j.cam.2012.11.001zbMath1267.65073OpenAlexW1996601587WikidataQ57659436 ScholiaQ57659436MaRDI QIDQ1936137

Nguyen Ngoc Hai, Phan Thanh An, Tran Van Hoai

Publication date: 21 February 2013

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cam.2012.11.001

zbMATH Keywords

shortest pathapproximation algorithmmotion planningmemory usagerunning timedirect multiple shooting method

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Existence theories for optimal control problems involving ordinary differential equations (49J15) Discrete approximations in optimal control (49M25)

Related Items (6)

Unnamed Item ⋮ Robust model predictive control of uncertain nonlinear time‐delay systems via control contraction metric technique ⋮ Robust transient oscillation reduction for rest-to-rest motion of underactuated multibody systems ⋮ Computing approximately shortest descending paths on convex terrains via multiple shooting ⋮ Unnamed Item ⋮ Multiple shooting approach for computing approximately shortest paths on convex polytopes

This page was built for publication: Direct multiple shooting method for solving approximate shortest path problems