AI Chat Paper
Note: Please note that the following content is generated by AMiner AI. SciOpen does not take any responsibility related to this content.
{{lang === 'zh_CN' ? '文章概述' : 'Summary'}}
{{lang === 'en_US' ? '中' : 'Eng'}}
Chat more with AI
Article Link
Collect
Submit Manuscript
Show Outline
Outline
Show full outline
Hide outline
Outline
Show full outline
Hide outline

Local Path Planning for Nonholonomic Mobile Robots Based on Planar G2 Pythagorean Hodograph Degree 7 Bezier Transition Curves

Jianjian Liang*( ), Shoukun Wang*, Bo Wang†
School of Automation, Beijing Institute of Technology, No. 5 Zhongguancun South Street, Beijing 100081, P. R. China
Systems Engineering Research Institute China State Shipbuilding Corporation, Beijing 100094, P. R. China

This paper was recommended for publication in its revised form by editorial board member, Shupeng Lai.

Show Author Information

Abstract

The paper proposes a method that joins two line segments using planar Pythagorean hodograph (PH) degree 7 Bezier transition curves. The objective is to make use of such curvature-continuous curves for the path planning of nonholonomic constrained vehicles moving in 2D space, which requires designing a smooth path while satisfying the constraint of minimum turning radius. We initially present a novel idea that employs PH degree 7 Bezier transition curves for dealing with curvature constraints, the result of which proves to be better than the traditional method based on the “forward simulation”. The properties of PH degree 7 Bezier transition curves are then fully analyzed showing that the curves can be determined by a minimum of three parameters, each of which has an intuitive geometric meaning. The paper also proposes a path planner with direct curvature constraints during the process of path generation in 2D space. The objective function of the optimal path generation can be adjusted to minimize the length of the whole path or to closely follow the original global nonsmooth sequences of line segments. Here, the optimization problem is tactfully converted to a linear programming problem that can be solved efficiently. Finally, we use a kinematic bicycle model for simulation and compare the results with those from Dubins path showing that a G2 curve is easier to follow than a G1 one.

References

【1】
【1】
 
 
Unmanned Systems
Pages 137-151

{{item.num}}

Comments on this article

Go to comment

< Back to all reports

Review Status: {{reviewData.commendedNum}} Commended , {{reviewData.revisionRequiredNum}} Revision Required , {{reviewData.notCommendedNum}} Not Commended Under Peer Review

Review Comment

Close
Close
Cite this article:
Liang J, Wang S, Wang B. Local Path Planning for Nonholonomic Mobile Robots Based on Planar G2 Pythagorean Hodograph Degree 7 Bezier Transition Curves. Unmanned Systems, 2025, 13(1): 137-151. https://doi.org/10.1142/S2301385025500098

4

Views

0

Crossref

0

Web of Science

0

Scopus

0

CSCD

Received: 16 March 2023
Revised: 10 August 2023
Accepted: 16 August 2023
Published: 06 October 2023
© World Scientific Publishing Company