Computing Smooth Geodesics under Two-Sided Curvature Bounds with Applications to Robotics and Image Analysis
Curvature of planar curves serves as a key regularization term for computing second-order minimal paths, due to its tight relevance to desirable geometric properties such as smoothness, rigidity, and elasticity. In this paper, we tackle a more challenging problem in computational physics and geometry problem: tracking minimal paths whose curvature is constrained by arbitrary upper and lower bounds. For that purpose, we propose a new curvature-bounded geodesic model, developed under the Hamilton-Jacobi-Bellman (HJB) partial differential equation (PDE) framework. It provides strong geometric control over minimal paths by enforcing curvature range constraints, whose paths are smooth and of bounded curvature limitation. We also present a discretization scheme for the Hamiltonian and the HJB PDE incorporating curvature bounds, allowing efficient solver for estimating numerical solutions to the model. Finally, we illustrate the capability of the proposed curvature-bounded geodesic model in applications of robot path planning and curvilinear structures tracking from images. Numerical experiments demonstrate that the proposed curvature-bounded geodesic model serves as a powerful and robust tool for finding satisfactory paths.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Shape Analysis of Euclidean Curves under Frenet-Serret Framework
Geometric frameworks for analyzing curves are common in applications as they focus on invariant features and provide visually satisfying solutions to standard problems such as computing invariant distances, averaging…
Uniqueness of equilibrium and redistributive policies: a geometric approach to efficiency
This paper examines the relationship between resource reallocation, uniqueness of equilibrium and efficiency in economics. We explore the implications of reallocation policies for stability, conflict, and decision-making…
Decision MakingShort and Straight: Geodesics on Differentiable Manifolds
Manifolds discovered by machine learning models provide a compact representation of the underlying data. Geodesics on these manifolds define locally length-minimising curves and provide a notion of distance, which are ke…
validRiemannian geometry for efficient analysis of protein dynamics data
An increasingly common viewpoint is that protein dynamics data sets reside in a non-linear subspace of low conformational energy. Ideal data analysis tools for such data sets should therefore account for such non-linear …
Geodesic Convex Optimization: Differentiation on Manifolds, Geodesics, and Convexity
Convex optimization is a vibrant and successful area due to the existence of a variety of efficient algorithms that leverage the rich structure provided by convexity. Convexity of a smooth set or a function in a Euclidea…