mlsanityData to 14 Oct 2026

Computationally efficient algorithm for eco-driving over long look-ahead horizons

arXiv 2002.02357 ↗First posted 6 Feb 2020eess.SY cs.SYcited by 1

Not on the map. Why?

Abstract (arXiv)

This paper presents a computationally efficient algorithm for eco-driving over long prediction horizons. The eco-driving problem is formulated as a bi-level program, where the bottom level is solved offline, pre-optimizing gear as a function of longitudinal velocity and acceleration. The top level is solved online, optimizing a nonlinear dynamic program with travel time, kinetic energy and acceleration as state variables. To further reduce computational effort, the travel time is adjoined to the objective by applying necessary Pontryagin Maximum Principle conditions, and the nonlinear program is solved using real-time iteration sequential quadratic programming scheme in a model predictive control framework. Compared to standard cruise control, the energy savings of using the proposed algorithm is up to 15.71%.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). First posted on arXiv 6 Feb 2020.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 1.

1 paper.