![](bga.png)
length path is not a good option. Another finding in-
dicates that, highest probability path has less variance
as it takes the most secure path, while the smallest
travel time has the lowest mean and might have a high
variance.
Possible future work is to consider salable ap-
proaches that enables this framework to handle large
number of path planning queries at the same time.
Also, we can expand the model to offer paths that are
optimal for alleviating the overall congestion of the
city rather than just the best path for each agent (opti-
mal decisions versus selfish decisions).
REFERENCES
Ahmadi, K. and Allan, V. H. (2017). Stochastic Path Find-
ing under Congestion. In 2017 International Confer-
ence on Computational Science and Computational
Intelligence (CSCI), pages 135–140.
Bachman, G., Narici, L., and Beckenstein, E. (2000).
Fourier and Wavelet Analysis. Universitext. Springer
New York, New York, NY.
Campbell, A. M., Gendreau, M., and Thomas, B. W.
(2011). The orienteering problem with stochastic
travel and service times. Annals of Operations Re-
search, 186(1):61–81.
Cao, Z. (2017). Maximizing the probability of arriving on
time : a stochastic shortest path problem.
Chiabaut, N., Buisson, C., and Leclercq, L. (2009). Fun-
damental Diagram Estimation Through Passing Rate
Measurements in Congestion. IEEE Transactions on
Intelligent Transportation Systems, 10(2):355–359.
Dijkstra, E. W. and W., E. (1959). A note on two problems
in connexion with graphs. Numerische Mathematik,
1(1):269–271.
Edler, D., Guedes, T., Zizka, A., Rosvall, M., and Antonelli,
A. (2017). Infomap Bioregions: Interactive Mapping
of Biogeographical Regions from Species Distribu-
tions. Systematic Biology, 66(2):197–204.
Fan, Y. Y., Kalaba, R. E., and Moore, J. E. (2005). Arriving
on Time. Journal of Optimization Theory and Appli-
cations, 127(3):497–513.
Garza, S. E. and Schaeffer, S. E. (2019). Community detec-
tion with the Label Propagation Algorithm: A survey.
Physica A: Statistical Mechanics and its Applications,
534:122058.
Geisberger, R., Kobitzsch, M., and Sanders, P. (2010).
Route planning with flexible objective functions.
Haklay, M. and Weber, P. (2008). OpenStreetMap: User-
Generated Street Maps. IEEE Pervasive Computing,
7(4):12–18.
Hart, P. E., Nilsson, N. J., and Raphael, B. (1968). A for-
mal basis for the heuristic determination of minimum
cost paths. IEEE Transactions on Systems Science and
Cybernetics, 4(2):100–107.
Lau, H. C., Yeoh, W., Varakantham, P., and Nguyen, D. T.
(2012). Dynamic Stochastic Orienteering Problems
for Risk-Aware Applications. Uncertainty in Artificial
Intelligence: Proceedings of the Twenty-Eighth Con-
ference: August 15-17 2012, Catalina Island, United
States.
Long, D., ICAPS 2006 (16 2006.06.06-10 Windermere, U.,
and International Conference on Automated Planning
and Scheduling (16 2006.06.06-10 Windermere, U.
(2006). Optimal route planning under uncertainty.
AAAI Press.
Miller-Hooks, E. D. and Mahmassani, H. S. (2000). Least
Expected Time Paths in Stochastic, Time-Varying
Transportation Networks. Transportation Science,
34(2):198–215.
Niknami, M. and Samaranayake, S. (2016). Tractable
Pathfinding for the Stochastic On-Time Arrival Prob-
lem. pages 231–245. Springer, Cham.
Nikolova, E. and Karger, D. R. (2008). Route Planning un-
der Uncertainty: The Canadian Traveller Problem.
Pi, X. and Qian, Z. S. (2017). A stochastic optimal control
approach for real-time traffic routing considering de-
mand uncertainties and travelers’ choice heterogene-
ity. Transportation Research Part B: Methodological,
104(Supplement C):710 – 732.
Ruaridh Clark, M. M. (2018). Eigenvector-based commu-
nity detection for identifying information hubs in neu-
ronal networks | bioRxiv.
Rus, S. L. B. K. G. R. M. (2020). Method and apparatus for
traffic-aware stochastic routing and navigation.
Sigal, C. E., Pritsker, A. A. B., and Solberg, J. J. (1980).
The Stochastic Shortest Route Problem. Operations
Research, 28:1122–1129.
Wilkie, D., Van Den Berg, J., Lin, M., and Manocha, D.
(2011). Self-Aware Traffic Route Planning.
Yang, Z., Algesheimer, R., and Tessone, C. (2016). A
Comparative Analysis of Community Detection Algo-
rithms on Artificial Networks. Scientific Reports, 6.
Yaoxin Wu, Wei Chen, Xuexi Zhang, and Guangjun Liao
(2016). Improving the performance of arrival on time
in stochastic shortest path problem. In 2016 IEEE
19th International Conference on Intelligent Trans-
portation Systems (ITSC), pages 2346–2353. IEEE.
ICAART 2021 - 13th International Conference on Agents and Artificial Intelligence
956