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

Ximeng Fan (), Wen-Long Jin () and Penghang Yin ()
Additional contact information
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

Transportation Science, 2024, vol. 58, issue 6, 1371-1388

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.

Keywords: longitudinal vehicle trajectories; discrepancy and roughness; two-step quadratic programming; prior position error; existence and uniqueness; NGSIM and highD data (search for similar items in EconPapers)
Date: 2024
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.2024.0524 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ortrsc:v:58:y:2024:i:6:p:1371-1388

Access Statistics for this article

More articles in Transportation Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().