Online least-squares estimation of time varying systems
with sparse temporal evolution and application to traffic estimation

  • Authors: Aude Hofleitner, Laurent El Ghaoui and Alexandre Bayen.

  • Status: Proc. Conf. Decision and Control, December 2011.

  • Abstract: Using least-squares with an l1 -norm penalty is well-known to encourage sparse solutions. In this article, we propose an algorithm that performs online least-squares estimation of a time varying system with a l1-norm penalty on the variations of the state estimate, leading to state estimates that exhibit few “jumps” over time. The algorithm analytically computes a path to update the state estimate as a new observation becomes available. The algorithm performs compu- tationally efficient and numerically robust state estimation for time varying systems in which the dynamics are slow compared to the sampling rate. We use the algorithm for arterial traffic estimation with streaming probe vehicle data provided by the Mobile Millennium system and show a significant improvement in the estimation capabilities compared to a baseline model of traffic estimation. The estimation framework filters out the inherent noise of traffic dynamics and improves the interpretability and accuracy of the results. Results from an implementation in San Francisco on a network representing more than 12.6 kilometers of roadway and using a fleet of 500 taxis sending their location every minute illustrate the possibility to use the algorithm to solve important practical estimation problems.

  • Bibtex reference:

@conference{HBE:11,
	Author = {A. Hofleitner and A. Bayen and L. {El Ghaoui}},
	Booktitle = {Proc.\ Conference on Decision and Control},
  Title = {Online least-squares estimation of time varying systems with sparse temporal evolution and application to traffic estimation},
	Year = {2011},
	Month = dec
}