Sharable Clothoid-Based Continuous Motion Planning for Connected Automated Vehicles

A continuous motion planning method for connected automated vehicles (CAVs) is considered for generating feasible trajectories in real-time using three consecutive clothoids. The proposed method reduces path planning to a small set of nonlinear algebraic equations such that the generated path can be efficiently checked for feasibility and collision. After path planning, velocity planning is executed while maintaining a parallel simple structure. Key strengths of this framework include its interpretability, shareability, and ability to specify boundary conditions. Its interpretability and shareability stem from the succinct representation of the resulting local motion plan using a handful of physically meaningful parameters. Vehicles may share these parameters via vehicle-to-everything (V2X) communication so that the recipients can precisely reconstruct the planned trajectory of the senders and respond accordingly. The proposed local planner guarantees the satisfaction of boundary conditions, thus ensuring seamless integration with a wide array of higher-level global motion planners. The tunable nature of the method enables tailoring the local plans to specific maneuvers like turns at intersections, lane changes, and U-turns.

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Control Systems Technology
Published
2024-09-06
DOI
https://doi.org/10.1109/tcst.2024.3448328
Citations
6
Primary Topic
Robotic Path Planning Algorithms
Type
article
Field-Weighted Citation Impact
1.50
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Sharable Clothoid-Based Continuous Motion Planning for Connected Automated Vehicles

H. Eric Tseng, Gábor Orosz, Qi Chen, Gaurav Pandey et al.
6 citations
IEEE Transactions on Control Systems Technology
Robotic Path Planning Algorithms
1.50
article

Sharable Clothoid-Based Continuous Motion Planning for Connected Automated Vehicles

H. Eric Tseng, Gábor Orosz, Qi Chen, Gaurav Pandey, Sanghoon Oh
article en
6 citations

Abstract

A continuous motion planning method for connected automated vehicles (CAVs) is considered for generating feasible trajectories in real-time using three consecutive clothoids. The proposed method reduces path planning to a small set of nonlinear algebraic equations such that the generated path can be efficiently checked for feasibility and collision. After path planning, velocity planning is executed while maintaining a parallel simple structure. Key strengths of this framework include its interpretability, shareability, and ability to specify boundary conditions. Its interpretability and shareability stem from the succinct representation of the resulting local motion plan using a handful of physically meaningful parameters. Vehicles may share these parameters via vehicle-to-everything (V2X) communication so that the recipients can precisely reconstruct the planned trajectory of the senders and respond accordingly. The proposed local planner guarantees the satisfaction of boundary conditions, thus ensuring seamless integration with a wide array of higher-level global motion planners. The tunable nature of the method enables tailoring the local plans to specific maneuvers like turns at intersections, lane changes, and U-turns.

IEEE Transactions on Control Systems TechnologyVol. 33(4)
Ford Motor Company (United States) (US), The University of Texas at Arlington (US), University of Michigan (US), Texas A&M University (US)
Sustainable cities and communities
Openalex Percentile: Top 16%
Robotic Path Planning Algorithms
1.50
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.