The shortest path AMID 3-D polyhedral obstacles

DOI10.1007/978-981-16-2701-9_10OpenAlexW3203752584MaRDI QIDQ2073355

Jun Lu, Shui-Nee Chow, Hao-Min Zhou

Publication date: 1 February 2022

Full work available at URL: https://doi.org/10.1007/978-981-16-2701-9_10

zbMATH Keywords

global optimizationstochastic differential equationspath planningobstacle avoidanceintermittent diffusion

Mathematics Subject Classification ID

Computing methodologies for image processing (68U10) Biomedical imaging and signal processing (92C55) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Machine vision and scene understanding (68T45)

Related Items

Method of evolving junctions: a new approach to optimal control with constraints

Cites Work

• Unnamed Item
• Unnamed Item
• An algorithm for shortest-path motion in three dimensions
• Logarithmic Sobolev inequalities and stochastic Ising models
• ON CONVEX SOBOLEV INEQUALITIES AND THE RATE OF CONVERGENCE TO EQUILIBRIUM FOR FOKKER-PLANCK TYPE EQUATIONS
• An Optimal Algorithm for Euclidean Shortest Paths in the Plane
• A fast sweeping method for Eikonal equations
• A fast marching level set method for monotonically advancing fronts.
• Precision-Sensitive Euclidean Shortest Path in 3-Space
• Planning Algorithms