2014•Unpublished venueRequires access

3D path planning based on nonlinear geodesic equation

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

Open publisher page 4 citations

Abstract

A lot of methods have been proposed for 2D path planning of mobile robot, which could be a mobile platform or a wheelchair, in planar maps. This paper addresses a concept of the shortest path planning for a mobile robot to traverse a 3D surface, which is a parametrized regular surface that models the non-flat terrain on which the mobile robot traverses. Geodesic curve linking a given start to a given target that is locally shortest on non-flat terrain is used as path. Nonlinear geodesic equations are computed by a gradient descent method with energy function of geodesic, which is shown to converge to the geodesic path in a neighborhood of target position in which a certain Lipschitz condition holds.We present numerical simulations to illustrate the geodesic path planning on non-flat terrains.

About this research paper

What this paper is about

A lot of methods have been proposed for 2D path planning of mobile robot, which could be a mobile platform or a wheelchair, in planar maps. This paper addresses a concept of the shortest path planning for a mobile robot to traverse a 3D surface, which is a parametrized regular surface that models the non-flat terrain on which the mobile robot traverses. Geodesic curve linking a given start to a given target that is locally shortest on non-flat terrain is used as path. Nonlinear geodesic equations are computed by a gradient descent method with energy function of geodesic, which is shown to converge to the geodesic path in a neighborhood of target position in which a certain Lipschitz condition holds.We present numerical simulations to illustrate the geodesic path planning on non-flat terrains.

Why it matters

OpenAlex reports 4 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

A lot of methods have been proposed for 2D path planning of mobile robot, which could be a mobile platform or a wheelchair, in planar maps. This paper addresses a concept of the shortest path planning for a mobile robot to traverse a 3D surface, which is a parametrized regular surface that models the non-flat terrain on which the mobile robot traverses. Geodesic curve linking a given start to a given target that is locally shortest on non-flat terrain is used as path. Nonlinear geodesic equations are computed by a gradient descent method with energy function of geodesic, which is shown to converge to the geodesic path in a neighborhood of target position in which a certain Lipschitz condition holds.We present numerical simulations to illustrate the geodesic path planning on non-flat terrains.

Key concepts: Geodesic, Motion planning, Mobile robot, Computer science, Terrain, Shortest path problem, Path (computing), Traverse

Related papers

Back to paper searchBrowse research topicsOriginal source
3D path planning based on nonlinear geodesic equation — Research Paper | ScholarLens