State Space Search with Stochastic Costs and Risk Aversion

  • Anisse IsmailiEmail author
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9310)


In this paper we study state space search problems where the costs of transitions are uncertain. Cost uncertainty can be due to the existence of several scenarios impacting the entire set of transitions; it can also result from local random factors impacting each transition independently, or from more complex combinations of these two cases. This leads us to consider three different settings for handling cost uncertainty in state space graphs. For each of them, we recall some key properties of first-order and second-order stochastic dominance. Then we propose dominance-based heuristic search algorithms to determine the set of possibly optimal solutions with respect to the expected utility model and Yaari’s model, with and without assuming risk aversion. Finally, to preserve scalability on large-size instances, we adapt these algorithms for the fast determination of an \(\varepsilon \)-covering of the potentially optimal solutions.


State space search Uncertainty Stochastic dominance 



I wish to thank Patrice Perny and Olivier Spanjaard for their interesting discussions on the problem, and the reviewers for their comments.


  1. 1.
    Battuta, I.: The Rihla of Ibn Battuta. Ibn Juzayy (1355)Google Scholar
  2. 2.
    Bonet, B., Geffner, H.: Faster heuristic search algorithms for planning with uncertainty and full feedback. In: Proceedings of IJCAI, pp. 1233–1238 (2003)Google Scholar
  3. 3.
    Fu, L., Rilett, L.R.: Expected shortest paths in dynamic and stochastic traffic networks. Transp. Res. 32, 317–322 (1998)Google Scholar
  4. 4.
    Galand, L., Perny, P.: Search for Choquet-optimal paths under uncertainty. In: Proceedings of UAI, pp. 125–132 (2007)Google Scholar
  5. 5.
    Gao, Y.: Shortest path problem with uncertain arc lengths. Comput. Math. Appl. 62(6), 2591–2600 (2011)zbMATHMathSciNetCrossRefGoogle Scholar
  6. 6.
    Hanno: The Voyage of Hanno, commander of the Carthaginians, round the parts of Libya beyond the Pillars of Heracles, which he deposited in the Temple of Kronos. A wall in the temple of Ba’al Hammon in Carathage (500 BC)Google Scholar
  7. 7.
    Hart, P.E., Nilsson, N.J., Raphael, B.: A formal basis for the heuristic determination of minimum cost paths. IEEE Trans. Syst. Cyb. SSC–4(2), 100–107 (1968)CrossRefGoogle Scholar
  8. 8.
    Loui, R.P.: Optimal paths in graphs with stochastic or multidimensional weights. Commun. ACM 26(9), 670–676 (1983)zbMATHMathSciNetCrossRefGoogle Scholar
  9. 9.
    Muliere, P., Scarsini, M.: A note on stochastic dominance and inequality measures. J. Econ. Theory 49(2), 314–323 (1989)zbMATHMathSciNetCrossRefGoogle Scholar
  10. 10.
    Nikolova, E., Brand, M., Karger, D.R.: Optimal route planning under uncertainty. In: ICAPS, vol. 6, pp. 131–141 (2006)Google Scholar
  11. 11.
    Nilsson, N.J.: Problem-Solving Methods in Artificial Intelligence. McGraw-Hill Pub. Co., New York (1971)Google Scholar
  12. 12.
    Papadimitriou, C.H., Yannakakis, M.: Shortest paths without a map. In: Ausiello, G., Dezani-Ciancaglini, M., Rocca, S.R.D. (eds.) Automata, Languages and Programming. LNCS, vol. 372, pp. 610–620. Springer, Heidelberg (1989)CrossRefGoogle Scholar
  13. 13.
    Pearl, J.: Heuristics: Intelligent Search Strategies for Computer Problem Solving. Addison-Wesley, Reading (1984)Google Scholar
  14. 14.
    Perny, P., Spanjaard, O., Storme, L.X.: State space search for risk-averse agents. In: IJCAI, pp. 2353–2358 (2007)Google Scholar
  15. 15.
    Polo, M.: Devisement du Monde, The Travels of Marco Polo. Rustichello da Pisa (1298)Google Scholar
  16. 16.
    Puterman, M.L.: Markov Decision Processes: Discrete Stochastic Dynamic Programming, 1st edn. Wiley, New York (1994)zbMATHCrossRefGoogle Scholar
  17. 17.
    Sauma, R.: History of Mar Yahballaha III and of Rabban Sauma. A clergyman (1281–1317)Google Scholar
  18. 18.
    Savage, L.J.: The Foundations of Statistics. Wiley, New York (1954)zbMATHGoogle Scholar
  19. 19.
    Von Neumann, J., Morgenstern, O.: Theory of Games and Economic Behavior (60th Anniversary Commemorative Edition). Princeton University Press, Princeton (2007)CrossRefGoogle Scholar
  20. 20.
    Wellman, M., Larson, K., Ford, M., Wurman, P.: Path planning under time-dependent uncertainty. In: Proceedings of the Eleventh Conference on Uncertainty in Artificial Intelligence, pp. 532–539 (1995)Google Scholar
  21. 21.
    Wurman, P., Wellman, M.: Optimal factory scheduling using stochastic dominance A\(^*\). In: Proceedings of the Twelfth Conference on Uncertainty in Artificial Intelligence, pp. 554–563 (1996)Google Scholar
  22. 22.
    Yaari, M.E.: The dual theory of choice under risk. Econometrica J. Econometric Soc. 55, 95–115 (1987)zbMATHMathSciNetCrossRefGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  1. 1.Sorbonne Universités, UPMC Univ Paris 06, LIP6, UMR 7606ParisFrance

Personalised recommendations