A Heuristic Search Approach for a Nonstationary Stochastic Shortest Path Problem with Terminal Cost

References

• Bagchi A., Mahanti A. Three approaches to heuristic search in networks. J. ACM (1985) 32:1–27Crossref, Google Scholar
• Bertsekas D., Tsitsiklis J. An analysis of stochastic shortest path problems. Math. Oper. Res. (1991) 16:580–595Link, Google Scholar
• Chabini I. Discrete dynamic shortest path problems in transportation applications: Complexity and algorithms with optimal run time. Transportation Res. Rec. (1999) 1645:170–174Crossref, Google Scholar
• Chakrabarti P. P., Ghose, DeSarkar S. C. Admissibility of AO* when heuristics overestimate. Artificial Intelligence (1988) 34:97–113Crossref, Google Scholar
• Chang C. R., Slagle J. R. An admissible and optimal algorithm for searching AND/OR graphs. Artificial Intelligence (1971) 2:117–128Crossref, Google Scholar
• Eiger A. P., Mirchandani P., Soroush H. Path preferences and optimal paths in probabilistic networks. Transportation Sci. (1985) 19:75–84Link, Google Scholar
• Frank H. Shortest paths in probabilistic graphs. Oper. Res. (1969) 17:583–599Link, Google Scholar
• Frieze A., Grimmet G. The shortest path problem for graphs with random arc lengths. Discrete Appl. Math. (1985) 10:57–77Crossref, Google Scholar
• Golden B., Ball M. Shortest paths with Euclidean distances: An explanatory model. Networks (1978) 8:297–314Crossref, Google Scholar
• Hall R. The fastest path through a network with random time-dependent travel times. Transportation Sci. (1986) 20:182–188Link, Google Scholar
• Kaufmann D., Smith R. Fastest paths in time-dependent networks for intelligent vehicle highway systems application. IVHS J. (1993) 1:1–11Google Scholar
• Larsen J. B. A decision tree approach to maintaining a deteriorating physical system. (1989) . Ph.D. dissertation, University of Texas at Austin, Austin, TXGoogle Scholar
• Loui R. Optimal paths in graphs with stochastic or multidimensional weights. Comm. ACM (1983) 26:670–676Crossref, Google Scholar
• MacQueen J. A modified dynamic programming method for Markov decision problems. J. Math. Anal. Appl. (1966) 14:38–43Crossref, Google Scholar
• Martelli A., Montanari U. Additive AND/OR graphs. (1973) Third Internat. Joint Conf. Artificial Intelligence: Advanced Papers of the Conf.Stanford, CA:1–11Google Scholar
• Martelli A., Montanari U. Optimizing decision trees through heuristically guided search. Comm. ACM (1978) 21:1025–1039Crossref, Google Scholar
• Miller-Hooks E. D. Optimal routing in time-varying, stochastic networks: Algorithms and implementations. (1997) . Ph.D. dissertation, University of Texas at Austin, Austin, TXGoogle Scholar
• Mirchandani P., Soroush H. Optimal paths in probabilistic networks: A case with temporary preferences. Comput. Oper. Res. (1985) 12:365–381Crossref, Google Scholar
• Nilsson N. J.Problem Solving Methods in Artificial Intelligence (1971) (McGraw-Hill, New York) Google Scholar
• Nilsson N. J.Principles of Artificial Intelligence (1980) (Morgan Kaufmann, Palo Alto, CA) Google Scholar
• Orda A., Rom R. Minimum wait paths in time-dependent networks. Networks (1991) 21:295–319Crossref, Google Scholar
• Polychronopoulos G. H. Stochastic and dynamic shortest distance problems. (1992) . Ph.D. dissertation, Massachusetts Institute of Technology, Cambridge, MAGoogle Scholar
• Puterman M. L.Markov Decision Processes: Discrete Stochastic Dynamic Programming (1994) (Wiley, New York) Crossref, Google Scholar
• Wellman M. P., Larson K., Ford M. Path planning under time-dependent uncertainty. (1995) . Working paper, Artificial intelligence Laboratory, University of Michigan, Ann Arbor, MIGoogle Scholar