Clothoid spline based path planning
Path planning for long vehicles plays an important role in safe and efficient operation, especially for those with very large lateral and longitudinal sizes driving in narrow spaces. To address this issue, we start with generalizing a kinematic bicycle model to represent different types of vehicles,...
Saved in:
Main Author: | |
---|---|
Other Authors: | |
Format: | Theses and Dissertations |
Language: | English |
Published: |
2017
|
Subjects: | |
Online Access: | http://hdl.handle.net/10356/72389 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
id |
sg-ntu-dr.10356-72389 |
---|---|
record_format |
dspace |
spelling |
sg-ntu-dr.10356-723892023-03-11T18:06:21Z Clothoid spline based path planning Chen, Yong Daniel Thalmann Cai Yiyu School of Mechanical and Aerospace Engineering Institute for Media Innovation DRNTU::Engineering::Mechanical engineering Path planning for long vehicles plays an important role in safe and efficient operation, especially for those with very large lateral and longitudinal sizes driving in narrow spaces. To address this issue, we start with generalizing a kinematic bicycle model to represent different types of vehicles, based on which a path planning framework composed of a local path planner and a global path planner is developed. During the local planning phase, feasible path primitives are generated subject to kinematic constraints of the curvature maxima and the angular acceleration upper bound. By designing a family of path primitives with clothoid arcs involved which can be efficiently configured according to the given environment and reference points in physical space referred to as waypoints, we are able to obtain a near-optimal solution without numerically solving the two point boundary value problem to generate a feasible path connecting two states under differential constraints. During the global planning phase, the local path planner can be conveniently integrated with sampling based frameworks like the rapidly exploring random tree, which complies with the kinematic constraints when sampling the new states and expanding towards unexplored space. Meanwhile, an efficient clothoid approximation method is presented based on the minimization of curvature profile difference. Quintic Bézier curves are used to ensure higher order geometric continuity with smaller approximation error, and the data is stored in a lookup table to reduce the computing time. The developed methodology is novel and effective, which is capable of addressing a class of nonholonomic planning problems successfully subject to curvature and angular acceleration constraints. Doctor of Philosophy (MAE) 2017-07-03T03:31:43Z 2017-07-03T03:31:43Z 2017 Thesis Chen, Y. (2017). Clothoid spline based path planning. Doctoral thesis, Nanyang Technological University, Singapore. http://hdl.handle.net/10356/72389 10.32657/10356/72389 en 172 p. application/pdf |
institution |
Nanyang Technological University |
building |
NTU Library |
continent |
Asia |
country |
Singapore Singapore |
content_provider |
NTU Library |
collection |
DR-NTU |
language |
English |
topic |
DRNTU::Engineering::Mechanical engineering |
spellingShingle |
DRNTU::Engineering::Mechanical engineering Chen, Yong Clothoid spline based path planning |
description |
Path planning for long vehicles plays an important role in safe and efficient operation, especially for those with very large lateral and longitudinal sizes driving in narrow spaces. To address this issue, we start with generalizing a kinematic bicycle model to represent different types of vehicles, based on which a path planning framework composed of a local path planner and a global path planner is developed. During the local planning phase, feasible path primitives are generated subject to kinematic constraints of the curvature maxima and the angular acceleration upper bound. By designing a family of path primitives with clothoid arcs involved which can be efficiently configured according to the given environment and reference points in physical space referred to as waypoints, we are able to obtain a near-optimal solution without numerically solving the two point boundary value problem to generate a feasible path connecting two states under differential constraints. During the global planning phase, the local path planner can be conveniently integrated with sampling based frameworks like the rapidly exploring random tree, which complies with the kinematic constraints when sampling the new states and expanding towards unexplored space. Meanwhile, an efficient clothoid approximation method is presented based on the minimization of curvature profile difference. Quintic Bézier curves are used to ensure higher order geometric continuity with smaller approximation error, and the data is stored in a lookup table to reduce the computing time. The developed methodology is novel and effective, which is capable of addressing a class of nonholonomic planning problems successfully subject to curvature and angular acceleration constraints. |
author2 |
Daniel Thalmann |
author_facet |
Daniel Thalmann Chen, Yong |
format |
Theses and Dissertations |
author |
Chen, Yong |
author_sort |
Chen, Yong |
title |
Clothoid spline based path planning |
title_short |
Clothoid spline based path planning |
title_full |
Clothoid spline based path planning |
title_fullStr |
Clothoid spline based path planning |
title_full_unstemmed |
Clothoid spline based path planning |
title_sort |
clothoid spline based path planning |
publishDate |
2017 |
url |
http://hdl.handle.net/10356/72389 |
_version_ |
1761781960098709504 |