Label-Setting Methods for Multimode Stochastic Shortest Path Problems on Graphs

References

• Ahuja R. K., Magnanti T. L., Orlin J. B.Network Flows (1993) (Prentice-Hall, Upper Saddle River, NJ) Google Scholar
• Alton K., Mitchell I. M. Fast marching methods for a class of anisotropic stationary Hamilton-Jacobi equations. (2007) . Technical Report TR-2006-27, Department of Computer Science, University of British ColumbiaGoogle Scholar
• Bertsekas D. P.Network Optimization: Continuous & Discrete Models (1998) (Athena Scientific, Boston) Google Scholar
• Bertsekas D. P.Dynamic Programming and Optimal Control (2001) I and II2nd ed.(Athena Scientific, Boston) Google Scholar
• Bertsekas D. P., Tsitsiklis J. N. An analysis of stochastic shortest path problems. Math. Oper. Res. (1991) 16(3):580–595Link, Google Scholar
• Bertsekas D. P., Tsitsiklis J. N.Neuro-Dynamic Programming (1996) (Athena Scientific, Boston) Google Scholar
• Bonet B. On the speed of convergence of value iteration on stochastic shortest-path problems. Math. Oper. Res. (2007) 32(2):365–373Link, Google Scholar
• Bornemann F., Rasch C. Finite-element discretization of static Hamilton-Jacobi equations based on a local variational principle. Comput. Visualization Sci. (2006) 9(2):57–69Crossref, Google Scholar
• Branicky M. S., Hebbar R. Fast marching for hybrid control. Proc. IEEE Internat. Sympos. Comput.-Aided Control System Design (1999) Kohala-Kona, HICrossref, Google Scholar
• Crandall M. G., Lions P.-L. Viscosity solutions of Hamilton-Jacobi equations. Trans. Amer. Math. Soc. (1983) 277(1):1–42Crossref, Google Scholar
• Dial R. Algorithm 360: Shortest path forest with topological ordering. Comm. ACM (1969) 12(11):632–633Crossref, Google Scholar
• Dijkstra E. W. A note on two problems in connection with graphs. Numerische Mathematik (1959) 1:269–271Crossref, Google Scholar
• Falcone M. A numerical approach to the infinite horizon problem of deterministic control theory. Appl. Math. Optim. (1987) 15(1):1–13corrigenda 23 (1991) 213–214Crossref, Google Scholar
• Gonzales R., Rofman E. On deterministic control problems: An approximate procedure for the optimal cost, part I: The stationary problem. SIAM J. Control Optim. (1985) 23(2):242–266Crossref, Google Scholar
• Kim S. An O(N) level set method for Eikonal equations. SIAM J. Sci. Comput. (2001) 22(6):2178–2193Crossref, Google Scholar
• Kimmel R., Sethian J. A. Fast marching methods on triangulated domains. Proc. Nat. Acad. Sci. (1998) 95(15):8341–8435Crossref, Google Scholar
• Kushner H. J. Numerical approximations for stochastic differential games. SIAM J. Control Optim. (2002) 41(2):457–486Crossref, Google Scholar
• Kushner H. J., Dupuis P. G.Numerical Methods for Stochastic Control Problems in Continuous Time (1992) (Academic Press, New York) Crossref, Google Scholar
• Osher S., Fedkiw R. P. Level Set Methods: An Overview and Some Recent Results. J. Comput. Phys. (2001) 169:463–502Crossref, Google Scholar
• Patek S. D., Bertsekas D. P. Stochastic shortest path games. SIAM J. Control Optim. (1999) 37(3):804–824Crossref, Google Scholar
• Polymenakos L. C., Bertsekas D. P., Tsitsiklis J. N. Implementation of efficient algorithms for globally optimal trajectories. IEEE Trans. Automatic Control (1998) 43(2):278–283Crossref, Google Scholar
• Rasch C., Satzger T. Remarks on the O(N) implementation of the fast marching method. (2007) . Preprint, http://www.citebase.org/abstract?id=oai:arXiv.org:cs/0703082Google Scholar
• Sethian J. A. A fast marching level set method for monotonically advancing fronts. Proc. National Acad. Sci. (1996a) 93(4):1591–1595Crossref, Google Scholar
• Sethian J. A.Level Set Methods and Fast Marching Methods: Evolving Interfaces in Computational Geometry, Fluid Mechanics, Computer Vision and Materials Sciences (1996b) (Cambridge University Press, Cambridge, UK) Google Scholar
• Sethian J. A. Fast marching methods. SIAM Rev. (1999) 41(2):199–235Crossref, Google Scholar
• Sethian J. A., Vladimirsky A. Fast methods for the Eikonal and related Hamilton–Jacobi equations on unstructured meshes. Proc. National Acad. Sci. (2000) 97(11):5699–5703Crossref, Google Scholar
• Sethian J. A., Vladimirsky A. Ordered upwind methods for static Hamilton-Jacobi equations. Proc. National Acad. Sci. (2001) 98(20):11069–11074Crossref, Google Scholar
• Sethian J. A., Vladimirsky A. Ordered upwind methods for hybrid control. Proc. (LNCS 2289) 5th Internat. Workshop, HSCC 2002 (2002) Stanford, CA:393–406Crossref, Google Scholar
• Sethian J. A., Vladimirsky A. Ordered upwind methods for static Hamilton-Jacobi equations: Theory and Algorithms. SIAM J. Numer. Anal. (2003) 41(1):325–363Crossref, Google Scholar
• Stoppard T.Rosencrantz and Guildenstern Are Dead (1967) (Faber, London, UK) Google Scholar
• Szpiro A., Dupuis P. Second-order numerical methods for first-order Hamilton–Jacobi equations. SIAM J. Numer. Anal. (2002) 40(3):1136–1183Crossref, Google Scholar
• Tsitsiklis J. N. Efficient algorithms for globally optimal trajectories. Proc. IEEE 33rd Conf. Decision and Control (1994) Lake Buena Vista, FL:1368–1373Crossref, Google Scholar
• Tsitsiklis J. N. Efficient algorithms for globally optimal trajectories. IEEE Trans. Automatic Control (1995) 40(9):1528–1538Crossref, Google Scholar
• Vladimirsky A. Fast methods for static Hamilton-Jacobi partial differential equations. (2001) . Doctoral dissertation, Department of Mathematics, University of California, Berkeley, CACrossref, Google Scholar
• Yatziv L., Bartesaghi A., Sapiro G. O(N) implementation of the fast marching algorithm. J. Comput. Phys. (2006) 212(2):393–399Crossref, Google Scholar