Adaptive collective routing using Gaussian process dynamic congestion models

Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

Volumn Part F128815, Issue , 2013, Pages 704-712

  Liu, Siyuan ^a   Yue, Yisong ^a   Krishnan, Ramayya ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

Collective routing; Dynamic congestion model; Gaussian process

Indexed keywords

COLLECTOR EFFICIENCY; DATA MINING; FLEET OPERATIONS; GAUSSIAN DISTRIBUTION; GAUSSIAN NOISE (ELECTRONIC); TRAFFIC CONTROL; VEHICLES;

COLLECTIVE ROUTING; CONGESTION CONDITIONS; CONGESTION MODELING; CONGESTION MODELS; COOPERATIVE VEHICLES; EXPLORATION EXPLOITATIONS; GAUSSIAN PROCESSES; NEAR-OPTIMAL PERFORMANCE;

TRAFFIC CONGESTION;

EID: 85007081590     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2487575.2487598     Document Type: Conference Paper

References (34)

1. B. Awerbuch and R. Kleinberg. Adaptive routing with end-To-end feedback: Distributed learning and geometric approaches. In Proc. of STOC, 2004.
2. J. Bacon, A. I. Bejan, A. R. Beresford, D. Evans, R. J. Gibbens, and K. Moody. Dependable and historic computing. chapter Using real-Time road traffic data to evaluate congestion. 2011.
3. C. Benjamin. Detecting the onset of congestion rapidly with existing traffic detectors. Transportation Research, 2003.
4. J. Birge and F. Louveaux. Introduction to stochastic programming. Springer Verlag, 1997.
5. M. C. Bryson. Heavy-Tailed distributions: Properties and tests. Technometrics, 16(1), 1974.
6. G. Calinescu, C. Chekuri, M. Pal, and J. Vondrak. Maximizing a submodular set function subject to a matroid constraint. Integer programming and combinatorial optimization, pages 182-196, 2007.
7. P. S. Castro, D. Zhang, and S. Li. Urban traffic modelling and prediction using large scale taxi gps traces. In Proc. of Pervasive, 2012.
8. C. Chekuri, N. Korula, and M. PA, al. Improved algorithms for orienteering and related problems. In Proc. of SODA, 2008.
9. J. Cordeau, M. Gendreau, A. Hertz, G. Laporte, and J. Sormany. New heuristics for the vehicle routing problem. Logistics systems: design and optimization, pages 279-297, 2005.
10. P. Dallaire, C. Besse, S. Ross, and B. Chaib-draa. Bayesian reinforcement learning in continuous pomdps with gaussian processes. In Proc. of IROS, 2009.
11. R. He, E. Brunskill, and N. Roy. Efficient planning under uncertainty with macro-Actions. Journal of Machine Learning Research, 40:523-570, 2011.
12. J. Higle and S. Sen. Stochastic decomposition: An algorithm for two-stage linear programs with recourse. Mathematics of operations research, 16(3):650-669, 1991.
13. S. A. Hong. Distributed Market-Based Algorithms for Multi-Agent Planning with Shared Resources. PhD thesis, Carnegie Mellon University, 2013.
14. L. Kaelbling, M. Littman, and A. Cassandra. Planning and acting in partially observable stochastic domains. Artificial Intelligence, 101:99-134, 1995.
15. M. Kearns, Y. Mansour, and A. Ng. Approximate planning in large pomdps via reusable trajectories. In Proc. of NIPS, 1999.
16. A. Koning and L. Peng. Goodness-of-fit tests for a heavy tailed distribution. Econometric institute report, Erasmus University Rotterdam, Econometric Institute, Nov 2005.
17. A. Krause and C. S. Ong. Contextual gaussian process bandit optimization. In Proc. of NIPS, 2011.
18. H.-P. Kriegel, M. Renz, M. Schubert, and A. Zuee. Statistical density prediction in traffic networks. In Proc. of IEEE ICDM, 2007.
19. J. Leskovec, A. Krause, C. Guestrin, C. Faloutsos, J. Van Briesen, and N. Glance. Cost-effective outbreak detection in networks. In Proc. of KDD, 2007.
20. X. Li, J. Han, J.-G. Lee, and H. Gonzalez. Traffic density-based discovery of hot routes in road networks. In Proc. of SSTD, 2007.
21. S. Liu, Y. Liu, L. Ni, J. Fan, and M. Li. Towards mobility-based clustering. In Proc. of KDD, 2010.
22. W. Liu, Y. Zheng, S. Chawla, J. Yuan, and X. Xing. Discovering spatio-Temporal causal interactions in traffic data streams. In Proc. of KDD, 2011.
23. J. Mockus, V. Tiesis, and A. Zilinskas. The application of bayesian methods for seeking the extremum. Towards Global Optimization, 2:117-129, 1978.
24. G. Nemhauser, L. Wolsey, and M. Fisher. An analysis of the approximations for maximizing submodular set functions. Mathematical Programming, 14:265-294, 1978.
25. A. Y. Ng and M. Jordan. Pegasus: A policy search method for large mdps and pomdps. In Proc. of UAI, 2000.
26. G. Polychronopoulos and J. Ttsitsiklis. Stochastic shortest path problems with recourse. NETWORKS, 27:133-143, 1996.
27. C. Rasmussen and C. Williams. Gaussian processes for machine learning, volume 1. MIT press Cambridge, MA, 2006.
28. D. Silver and J. Veness. Monte-carlo planning in large pomdps. In Proc. of NIPS, 2010.
29. K. Sirvio and J. Hollmfien. Spatio-Temporal road condition forecasting with markov chains and artificial neural networks. In Proc. of HAIS, 2008.
30. N. Srinivas, A. Krause, S. Kakade, and M. Seeger. Gaussian process optimization in the bandit setting: No regret and experimental design. In Proc. of ICML, 2010.
31. M. Streeter, D. Golovin, and A. Krause. Online learning of assignments. In Proc. of NIPS, 2009.
32. J. Yoon, B. Noble, and M. Liu. Surface street traffic estimation. In Proc. of MobiSys, 2007.
33. J. Yuan, Y. Zheng, X. Xie, and G. Sun. Driving with knowledge from the physical world. In Proc. of KDD, 2011.
34. Y. Zheng, Y. Liu, J. Yuan, and X. Xie. Urban computing with taxicabs. In Proc. of Ubi Comp, 2011.