Preprint Article Version 1 Preserved in Portico This version is not peer-reviewed

RimJump*: Tangent Based Shortest Path Planning for Cluttered 3D Environment

Version 1 : Received: 27 April 2021 / Approved: 28 April 2021 / Online: 28 April 2021 (15:34:49 CEST)

How to cite: Yao, Z. RimJump*: Tangent Based Shortest Path Planning for Cluttered 3D Environment. Preprints 2021, 2021040754 (doi: 10.20944/preprints202104.0754.v1). Yao, Z. RimJump*: Tangent Based Shortest Path Planning for Cluttered 3D Environment. Preprints 2021, 2021040754 (doi: 10.20944/preprints202104.0754.v1).

Abstract

Path planning in 3D environment is a fundamental research area for robots and autonomous vehicles. Based on the principle ``the shortest path consists of tangents'', RimJump* is proposed as a tangent-based path planning method suitable for finding the shortest path (both off-ground and on-ground) in 3D space (e.g., octomap and point cloud) for mobile platform to follow. RimJump* searches the tangent graph in the form of a path tree and considers the geometrical properties of the locally shortest path. Therefore, the method can provide all of the locally shortest paths that connect the starting point and the target, including the globally shortest path. And the time cost of RimJump* is insensitive to map scale increases in comparison to methods that search the whole passable space rather than the surface of the obstacle, e.g., Dijkstra and A*. In the Results, RimJump* is compared with other methods in terms of path length and time cost.

Subject Areas

Path planning; 3D path; tangent

Comments (0)

We encourage comments and feedback from a broad range of readers. See criteria for comments and our diversity statement.

Leave a public comment
Send a private comment to the author(s)
Views 0
Downloads 0
Comments 0
Metrics 0


×
Alerts
Notify me about updates to this article or when a peer-reviewed version is published.
We use cookies on our website to ensure you get the best experience.
Read more about our cookies here.