Finding the shortest path by evolving junctions on obstacle boundaries (E-JOB): an initial value ODE's approach

DOI10.1016/J.ACHA.2012.11.002MaRDI QIDQ2252135zbMATH OpenOpenAlexFDO

Authors Shui-Nee Chow, Jun Lu, Haomin Zhou

Publication date 16 July 2014

Published in Applied and Computational Harmonic Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.acha.2012.11.002

zbMATH Keywords

algorithmglobal optimizationinitial value problemintermittent diffusionlevel set methodobstaclesshortest pathstochastic differential equations

Mathematics Subject Classification ID

Ordinary differential equations and systems with randomness (34F05) Stochastic ordinary differential equations (aspects of stochastic analysis) (60H10) Computational methods for stochastic equations (aspects of stochastic analysis) (60H35) Numerical solutions to stochastic differential and integral equations (65C30) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26)

Recommendations

• Fast numerical methods based on SDEs for several problems related to the shortest path
• scientific article; zbMATH DE number 4216992
• A Newton-like algorithm for the shortest path based on the method of evolving junctions
• Application of the A^* algorithm to problems of the Euclidean shortest paths in the plane with polygonal obstacles
• An algorithm for shortest-path motion in three dimensions

Cites work

• \(L_ 1\) shortest paths among polygonal obstacles in the plane
• A course in metric geometry
• A fast marching level set method for monotonically advancing fronts.
• A fast sweeping method for Eikonal equations
• A hybrid multiagent approach for global trajectory optimization
• An efficient label setting/correcting shortest path algorithm
• An Optimal Algorithm for Euclidean Shortest Paths in the Plane
• Approximate Euclidean shortest paths amid convex obstacles
• Approximate solutions to several visibility optimization problems
• Computing geodesic paths on manifolds
• Equation of state calculations by fast computing machines
• Fast Sweeping Algorithms for a Class of Hamilton--Jacobi Equations
• Global optimization and stochastic differential equations
• Gradient flows in metric spaces and in the space of probability measures
• scientific article; zbMATH DE number 3766528 (Why is no real title available?)
• scientific article; zbMATH DE number 52737 (Why is no real title available?)
• scientific article; zbMATH DE number 1349965 (Why is no real title available?)
• scientific article; zbMATH DE number 910885 (Why is no real title available?)
• Level set methods and dynamic implicit surfaces
• Monte Carlo algorithm for trajectory optimization based on Markovian readings
• New results on shortest paths in three dimensions
• Optimization by simulated annealing
• Planning Algorithms
• Visibility and its dynamics in a PDE based implicit framework

Cited in

(4)

• Fast numerical methods based on SDEs for several problems related to the shortest path
• A Newton-like algorithm for the shortest path based on the method of evolving junctions
• Method of evolving junctions: a new approach to optimal control with constraints
• Path optimization with limited sensing ability

This page was built for publication: Finding the shortest path by evolving junctions on obstacle boundaries (E-JOB): an initial value ODE's approach

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2252135)