IDEAS home Printed from https://ideas.repec.org/a/inm/ortrsc/v58y2024i6p1371-1388.html
   My bibliography  Save this article

Two-Step Quadratic Programming for Physically Meaningful Smoothing of Longitudinal Vehicle Trajectories

Author

Listed:
  • Ximeng Fan

    (Institute of Transportation Studies, University of California, Irvine, California 92697; Stantec Inc., Portland, Oregon 97204)

  • Wen-Long Jin

    (Department of Civil and Environmental Engineering, California Institute for Telecommunications and Information Technology, Institute of Transportation Studies, University of California, Irvine, California 92697)

  • Penghang Yin

    (Department of Mathematics and Statistics, University at Albany, Albany, New York 12222)

Abstract

Longitudinal vehicle trajectories suffer from errors and noise because of detection and extraction techniques, challenging their applications. Existing smoothing methods either lack physical meaning or cannot ensure solution existence and uniqueness. To address this, we propose a two-step quadratic programming method that aligns smoothed speeds and higher-order derivatives with physical laws, drivers’ behaviors, and vehicle characteristics. Unlike the well-known smoothing splines method, which minimizes a weighted sum of discrepancy and roughness in a single quadratic programming problem, our method incorporates prior knowledge of position errors into two sequential quadratic programming problems. Step 1 solves half-smoothed positions by minimizing the discrepancy between them and raw positions, subject to physically meaningful bounds on speeds and higher-order derivatives of half-smoothed positions. Step 2 solves smoothed positions by minimizing the roughness while maintaining physically meaningful bounds and allowing the deviations from raw data of smoothed positions by at most those of the half-smoothed positions and prior position errors. The second step’s coefficient matrix is not positive definite, necessitating the matching of the first few smoothed positions with corresponding half-smoothed ones, with equality constraints equaling the highest order of derivatives. We establish the solution existence and uniqueness for both problems, ensuring their well-defined nature. Numerical experiments using Next Generation Simulation (NGSIM) data demonstrate that a third-order derivative constraint yields an efficient method and produces smoothed trajectories comparable with manually re-extracted ones, consistent with the minimum jerk principle for human movements. Comparisons with an existing approach and application to the Highway Drone data set further validate our method’s efficacy. Notably, our method is a postprocessing smoothing technique based on trajectory data and is not intended for systematic errors. Future work will extend this method to lateral vehicle trajectories and trajectory prediction and planning for both human-driven and automated vehicles. This approach also holds potential for broader smoothing problems with known average error in raw data.

Suggested Citation

  • Ximeng Fan & Wen-Long Jin & Penghang Yin, 2024. "Two-Step Quadratic Programming for Physically Meaningful Smoothing of Longitudinal Vehicle Trajectories," Transportation Science, INFORMS, vol. 58(6), pages 1371-1388, November.
  • Handle: RePEc:inm:ortrsc:v:58:y:2024:i:6:p:1371-1388
    DOI: 10.1287/trsc.2024.0524
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/trsc.2024.0524
    Download Restriction: no

    File URL: https://libkey.io/10.1287/trsc.2024.0524?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:ortrsc:v:58:y:2024:i:6:p:1371-1388. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.