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

DOI10.1016/j.acha.2012.11.002zbMath1294.65025OpenAlexW2079848878MaRDI QIDQ2252135

Jun Lu, Shui-Nee Chow, Hao-Min 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 optimizationshortest pathstochastic differential equationsinitial value problemlevel set methodobstaclesintermittent diffusion

Mathematics Subject Classification ID

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

Related Items

Method of evolving junctions: a new approach to optimal control with constraints ⋮ Path optimization with limited sensing ability

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• An efficient label setting/correcting shortest path algorithm
• Monte Carlo algorithm for trajectory optimization based on Markovian readings
• Approximate solutions to several visibility optimization problems
• Global optimization and stochastic differential equations
• A hybrid multiagent approach for global trajectory optimization
• \(L_ 1\) shortest paths among polygonal obstacles in the plane
• Level set methods and dynamic implicit surfaces
• Visibility and its dynamics in a PDE based implicit framework
• Computing geodesic paths on manifolds
• An Optimal Algorithm for Euclidean Shortest Paths in the Plane
• Fast Sweeping Algorithms for a Class of Hamilton--Jacobi Equations
• A fast sweeping method for Eikonal equations
• A fast marching level set method for monotonically advancing fronts.
• Equation of State Calculations by Fast Computing Machines
• New results on shortest paths in three dimensions
• Planning Algorithms

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