Skip to main content
We gratefully acknowledge support from the Simons Foundation, member institutions, and all contributors. Donate
arXiv logo
Cornell University Logo

Computer Science > Robotics

arXiv:2108.05711 (cs)
[Submitted on 8 Aug 2021]

Title:Hierarchical automatic lane-changing motion planning: from self-optimum to local-optimum

Authors:Yang Li, Linbo Li, Daiheng Ni, Wenxuang Wang
View PDF
Abstract:In order to minimize the impact of lane change (LC) maneuver on surrounding traffic environment, a hierarchical automatic LC algorithm that could realize local optimum has been proposed. This algorithm consists of a tactical layer planner and an operational layer controller. The former generates a local-optimum trajectory. The comfort, efficiency, and safety of the LC vehicle and its surrounding vehicles are simultaneously satisfied in the optimization objective function. The later is designed based on vehicle kinematics model and the Model Predictive Control (MPC), which aims to minimize the tracking error and control increment. Combining macro-level and micro-level analysis, we verify the effectiveness of the proposed algorithm. Our results demonstrate that our proposed algorithm could greatly reduce the impact of LC maneuver on traffic flow. This is reflected in the decrease of total loss for nearby vehicles (such as discomfort and speed reduction), and the increase of traffic speed and throughput within the LC area. In addition, in order to guide the practical application of our algorithm, we employ the HighD dataset to validate the algorithm. This research could also be regarded as a preliminary foundational work to develop locally-optimal automatic LC algorithm. We anticipate that this research could provide valuable insights into autonomous driving technology.
Comments: 24 pages 16 figures
Subjects: Robotics (cs.RO)
Cite as: arXiv:2108.05711 [cs.RO]
  (or arXiv:2108.05711v1 [cs.RO] for this version)
  https://doi.org/10.48550/arXiv.2108.05711

Submission history

From: Yang Li [view email]
[v1] Sun, 8 Aug 2021 04:44:37 UTC (2,067 KB)
Full-text links:

Access Paper:

  • View PDF
  • Other Formats
view license
Current browse context:
cs.RO
< prev   |   next >
new | recent | 2021-08
Change to browse by:
cs

References & Citations

DBLP - CS Bibliography

listing | bibtex
Yang Li
Linbo Li
export BibTeX citation

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)