Multiple shooting approach for computing approximately shortest paths on convex polytopes

DOI10.1016/j.cam.2016.10.026zbMath1357.65024OpenAlexW2555359267WikidataQ57659426 ScholiaQ57659426MaRDI QIDQ507990

Phan Thanh An, Nguyen Ngoc Hai, Tran Van Hoai

Publication date: 9 February 2017

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.2016.10.026

zbMATH Keywords

iterative algorithmboundary value problemsconvex polytopemultiple shootingEuclidean shortest pathapproximate shortest path

Mathematics Subject Classification ID

Nonlinear boundary value problems for ordinary differential equations (34B15) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Numerical solution of boundary value problems involving ordinary differential equations (65L10)

Related Items (5)

Unnamed Item ⋮ Computing approximately shortest descending paths on convex terrains via multiple shooting ⋮ Unnamed Item ⋮ Finding Shortest Paths in a Sequence of Triangles in 3D by the Planar Unfolding ⋮ Finding shortest paths in a sequence of triangles in 3D by the method of orienting curves

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Efficiently determining a locally exact shortest path on polyhedral surfaces
• An algorithm for shortest-path motion in three dimensions
• Computing approximate shortest paths on convex polytopes
• Direct multiple shooting method for solving approximate shortest path problems
• On shooting methods for boundary value problems
• The Discrete Geodesic Problem
• Block-structured quadratic programming for the direct multiple shooting method for optimal control
• Euclidean Shortest Paths
• On Shortest Paths in Polyhedral Spaces
• Shortest Paths Help Solve Geometric Optimization Problems in Planar Regions
• Approximating shortest paths on a convex polytope in three dimensions
• SHORTEST PATHS ON A POLYHEDRON, Part I: COMPUTING SHORTEST PATHS
• Shortest paths on polyhedral surfaces and terrains
• Approximate Shortest Descending Paths
• Metric spaces, convexity and nonpositive curvature
• Pseudo-geodesics on three-dimensional surfaces and pseudo-geodesic meshes

This page was built for publication: Multiple shooting approach for computing approximately shortest paths on convex polytopes