3D path planning based on nonlinear geodesic equation

Wu, Kun-Lin; Lo, Chi-Wen; Lin, Yueh-Chen; Liu, Jing‐Sin

doi:10.1109/icca.2014.6870943

Cited by 4 publications

(1 citation statement)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…where 1 , 2 are the control inputs [30,36]. Equation (9) is the system of first-order differential equations (state equations) for generating the route linking two distinct locations on the manifold , which is locally the shortest path (lengthminimizing geodesic) on .…”

Section: Geodesic Due To Its Locally Shortest Length and Other Nicementioning

confidence: 99%

Path Planning and Replanning for Mobile Robot Navigation on 3D Terrain: An Approach Based on Geodesic

Huang

et al. 2016

Mathematical Problems in Engineering

Self Cite

View full text Add to dashboard Cite

In this paper, mobile robot navigation on a 3D terrain with a single obstacle is addressed. The terrain is modelled as a smooth, complete manifold with well-defined tangent planes and the hazardous region is modelled as an enclosing circle with a hazard grade tuned radius representing the obstacle projected onto the terrain to allow efficient path-obstacle intersection checking. To resolve the intersections along the initial geodesic, by resorting to the geodesic ideas from differential geometry on surfaces and manifolds, we present a geodesic-based planning and replanning algorithm as a new method for obstacle avoidance on a 3D terrain without using boundary following on the obstacle surface. The replanning algorithm generates two new paths, each a composition of two geodesics, connected via critical points whose locations are found to be heavily relying on the exploration of the terrain via directional scanning on the tangent plane at the first intersection point of the initial geodesic with the circle. An advantage of this geodesic path replanning procedure is that traversability of terrain on which the detour path traverses could be explored based on the local Gauss-Bonnet Theorem of the geodesic triangle at the planning stage. A simulation demonstrates the practicality of the analytical geodesic replanning procedure for navigating a constant speed point robot on a 3D hill-like terrain.

show abstract

Section: Geodesic Due To Its Locally Shortest Length and Other Nicementioning

confidence: 99%