Label-setting methods for multimode stochastic shortest path problems on graphs

Mathematics of Operations Research

Volumn 33, Issue 4, 2008, Pages 821-838

  Vladimirsky, Alexander ^a  

^a Department of Obstetrics Gynecology   (United States)

Author keywords

Dial's method; Dijkstra's method; Dynamic programming; Fast marching method; Hamilton Jacobi PDEs; Label setting; Optimal control; Stochastic shortest path

Indexed keywords

DIAL'S METHOD; DIJKSTRA'S METHOD; FAST MARCHING METHOD; HAMILTON-JACOBI PDES; OPTIMAL CONTROL; STOCHASTIC SHORTEST PATH;

AIRCRAFT ENGINES; LABELS; MEATS; NUMERICAL METHODS; OPTIMIZATION; PARTIAL DIFFERENTIAL EQUATIONS; RANDOM PROCESSES; STOCHASTIC CONTROL SYSTEMS; SYSTEMS ENGINEERING;

DYNAMIC PROGRAMMING;

EID: 61449153735     PISSN: 0364765X     EISSN: 15265471     Source Type: Journal    
DOI: 10.1287/moor.1080.0321     Document Type: Article

References (35)

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