A Mixed Receding/Shrinking Horizon MPC for Trajectory Planning at on-Ramp Merging Maneuver

This paper presents a solution to an on-ramp merging trajectory planning problem within a multiple target vehicles environment by employing model predictive control principles. The shrinking horizon MPC (SHMPC) scheme is used to guarantee that the optimal trajectories are selected among the available gaps into which the ego vehicle can merge. For each trajectory, a time-varying terminal set is used to ensure recursive feasibility and to fulfill the safety and obstacle avoidance constraints. To enhance computational efficiency, a procedure is proposed for defining the terminal set to be as large as possible, derived from the offline-calculated maximum controlled invariant set. We present a simple decision mechanism, accounting for safety, comfort, and efficiency. Then, we demonstrate the effectiveness of the proposed solution by applying it to two different scenarios.

Authors

Institutions

Publication Details

Published
2025-06-22
DOI
https://doi.org/10.1109/iv64158.2025.11097684
Primary Topic
Robotic Path Planning Algorithms
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A Mixed Receding/Shrinking Horizon MPC for Trajectory Planning at on-Ramp Merging Maneuver

Iris Ballesteros-Tolosana, Simon Mustaki, Silviu‐Iulian Niculescu, Sorin Olaru et al.
Robotic Path Planning Algorithms
article

A Mixed Receding/Shrinking Horizon MPC for Trajectory Planning at on-Ramp Merging Maneuver

Iris Ballesteros-Tolosana, Simon Mustaki, Silviu‐Iulian Niculescu, Sorin Olaru, Carlos Flores, Turan Konyahoğlu
article en

Abstract

This paper presents a solution to an on-ramp merging trajectory planning problem within a multiple target vehicles environment by employing model predictive control principles. The shrinking horizon MPC (SHMPC) scheme is used to guarantee that the optimal trajectories are selected among the available gaps into which the ego vehicle can merge. For each trajectory, a time-varying terminal set is used to ensure recursive feasibility and to fulfill the safety and obstacle avoidance constraints. To enhance computational efficiency, a procedure is proposed for defining the terminal set to be as large as possible, derived from the offline-calculated maximum controlled invariant set. We present a simple decision mechanism, accounting for safety, comfort, and efficiency. Then, we demonstrate the effectiveness of the proposed solution by applying it to two different scenarios.

Centre National de la Recherche Scientifique (FR), CentraleSupélec (FR), Aptiv (France) (FR)
Sustainable cities and communities
Openalex Percentile: Top 82%
Robotic Path Planning Algorithms
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.

A Mixed Receding/Shrinking Horizon MPC for Trajectory Planning at on-Ramp Merging Maneuver — Iris Ballesteros-Tolosana, Simon Mustaki, et al. · (2025) | TGRS Research Map | TGRS