Direct multiple shooting method for solving approximate shortest path problems
type: Item
instance of: scholarly article
title: Direct multiple shooting method for solving approximate shortest path problems
zbMATH Open document ID: 1267.65073
published in: Journal of Computational and Applied Mathematics
publication date: 2013-02-21T00:00:00Z
review text: The authors use the idea of the direct multiple shooting method to introduce an algorithm for solving some approximate shortest path problems in motion planning. The algorithm is based on a direct multiple shooting discretization that includes a collinear condition, multiple shooting structure, and approximation conditions.
Mathematics Subject Classification ID: 65K10
Mathematics Subject Classification ID: 49J15
Mathematics Subject Classification ID: 49M25
zbMATH DE Number: 6138047
zbMATH Keywords: approximation algorithm
zbMATH Keywords: direct multiple shooting method
zbMATH Keywords: memory usage
zbMATH Keywords: motion planning
zbMATH Keywords: running time
zbMATH Keywords: shortest path
author: Phan Thanh An
author: Nguyen Ngoc Hai
author: Tran Van Hoai
reviewed by: Hans Benker
MaRDI profile type: Publication
Wikidata QID: Q57659436
full work available at URL: j.cam.2012.11.001
OpenAlex ID: W1996601587
DOI: 10.1016/J.CAM.2012.11.001
description: scientific article; zbMATH DE number 6138047