This paper presents a computationally efficient algorithm for eco-driving along horizons of over 100 km. The eco-driving problem is formulated as a bi-level program, where the bottom level is solved offline, pre-optimising gear as a function of longitudinal velocity (kinetic energy) and acceleration. The top level is solved online, optimising 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’s 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 average driver’s driving cycle, the energy savings of using the proposed algorithm is up to 11.60%.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Computationally Efficient Algorithm for Eco-Driving Over Long Look-Ahead Horizons


    Contributors:


    Publication date :

    2022-07-01


    Size :

    2804075 byte




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English



    Design of an efficient algorithm for fuel-optimal look-ahead control

    Hellström, Erik / Aaslund, Jan / Nielsen, Lars | Tema Archive | 2010


    A computationally efficient importance sampling tracking algorithm

    Farah, R. | British Library Online Contents | 2014



    Driving detection warning system and method that does not look ahead

    KIM SEUNG JAE | European Patent Office | 2023

    Free access

    Look ahead to LogiChem

    British Library Online Contents | 2011