arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1901.06452eess.SYcs.SY
收藏

使用伴随方法将跟车模型快速校准至轨迹数据

Fast Calibration of Car Following models to Trajectory data using the Adjoint Method

Ronan Keane, H. Oliver Gao

AI总结:

本文将跟车模型校准表述为优化问题,利用伴随方法解析推导梯度以克服无梯度优化的计算成本随参数扩展的缺陷,实验证明拟牛顿算法比遗传算法更快且精度略高。

摘要:

在跟车模型能够实际应用之前,必须先在一个被称为校准的过程中与真实数据进行验证。本文讨论了将校准表述为优化问题,并比较了用于求解该问题的不同算法。该优化问题包含将一个任意的跟车模型(被表述为常微分方程或延迟微分方程)校准至任意的轨迹数据源,这些数据源可能包含车道变换。通常,校准问题使用无梯度优化来求解。在本研究中,使用伴随方法解析地推导了优化问题的梯度。伴随方法的计算成本不随模型参数的数量而扩展,这使得它比使用有限差分数值评估梯度更高效。给出的数值结果表明,使用伴随方法的拟牛顿算法比遗传算法快得多,并且也实现了略好的校准模型精度。

英文摘要:

Before a car-following model can be applied in practice, it must first be validated against real data in a process known as calibration. This paper discusses the formulation of calibration as an optimization problem, and compares different algorithms for its solution. The optimization consists of an arbitrary car following model, posed as either an ordinary or delay differential equation, being calibrated to an arbitrary source of trajectory data which may include lane changes. Typically, the calibration problem is solved using gradient free optimization. In this work, the gradient of the optimization problem is derived analytically using the adjoint method. The computational cost of the adjoint method does not scale with the number of model parameters, which makes it more efficient than evaluating the gradient numerically using finite differences. Numerical results are presented which show that quasi-newton algorithms using the adjoint method are significantly faster than a genetic algorithm, and also achieve slightly better accuracy of the calibrated model.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑