Ordered upwind methods for hybrid control

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2289, Issue , 2002, Pages 393-406

  Sethian, James A ^a   Vladimirsky, Alexander ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b Department of Obstetrics Gynecology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ANISOTROPY; COMPLEX NETWORKS; HYBRID SYSTEMS; INFORMATION DISSEMINATION; INFORMATION USE; NUMERICAL METHODS; OPTIMAL CONTROL SYSTEMS; TABU SEARCH;

DISCRETE/CONTINUOUS; HYBRID CONTROL SYSTEMS; INFORMATION PROPAGATION; NON-ITERATIVE ALGORITHMS; OPTIMAL CONTROL PROBLEM; OPTIMAL TRAJECTORIES; OPTIMALITY PRINCIPLE; PARTIAL INFORMATION;

ITERATIVE METHODS;

EID: 84958160224     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45873-5_31     Document Type: Conference Paper

References (17)

1. Bellman, R.: Introduction to the Mathematical Theory of Control Processes. (1967) Academic Press, New York.
2. Bardi, M. & Falcone, M.: An Approximation Scheme for the Minimum Time Function. (1990) SIAM J. Control Optim., 28, 950-965.
3. Branicky, M.S. & Hebbar, R.: Fast marching for hybrid control. (1999) Proceedings, IEEE Intl. Symp. Computer Aided Control System Design, Kohala-Kona, HI, August 22-27.
4. Branicky, M.S., Hebbar, R., Zhang G.: A fast marching algorithm for hybrid systems. (1999) Proceedings, IEEE Conf. on Decision and Control, Phoenix, AZ, December 7-10.
5. Dijkstra, E.W.: A Note on Two Problems in Connection with Graphs. (1959) Numerische Mathematik, 1, 269-271.
6. Gonzales, R. & Rofman, E.: On Deterministic Control Problems: an Approximate Procedure for the Optimal Cost, I, the Stationary Problem. (1985) SIAMJ. Control Optim., 23, 2, 242-266.
7. Kushner, H.J.: Probability Methods for Approximations in Stochastic Control and for Elliptic Equations. (1977) Springer-Verlag, NewY ork.
8. Kushner, H.J. & Dupuis, P.G.: Numerical Methods for Stochastic Control Problems in Continuous Time. (1992) Academic Press, New York.
9. Sethian, J.A.: A Fast Marching Level Set Method for Monotonically Advancing Fronts. (1996) Proc. Nat. Acad. Sci., 93, 4, 1591-1595.
10. Sethian, J.A.: Level Set Methods and Fast Marching Methods: Evolving Interfaces in Computational Geometry, Fluid Mechanics, Computer Vision and Materials Sciences. (1999) Cambridge University Press).
11. Sethian, J.A. & Vladimirsky, A.: Fast Methods for the Eikonal and Related Hamilton–Jacobi Equations on Unstructured Meshes. (2000) Related Hamilton– Jacobi Equations on Unstructured Meshes, Proc. Nat. Acad. Sci., 97, 11, 5699-5703.
12. Sethian, J.A. & Vladimirsky, A.: Ordered Upwind Methods for Static Hamilton- Jacobi Equations: Theory and Algorithms. (2001) Center for Pure and Applied Mathematics Technical Report PAM-792 (University of California, Berkeley).
13. Sethian, J.A. & Vladimirsky, A.: Ordered Upwind Methods for a Variety of Control Problems. Generalizations and Optimizations, in progress. (2001).
14. Soner, M.H.: Optimal control problems with state-space constraints. (1986) SIAM J. Control Optim., 24, 552-562 and 1110-1122.
15. Tsitsiklis, J.N.: Efficient algorithms for globally optimal trajectories. (1994) Proceedings, IEEE 33rd Conference on Decision and Control, Lake Buena Vista, Florida, December (1994), 1368-1373.
16. Tsitsiklis, J.N.: Efficient algorithms for globally optimal trajectories. (1995) IEEE Tran. Automatic Control, 40, 1528-1538.
17. Vladimirsky, A.: Fast Methods for Static Hamilton-Jacobi Partial Differential Equations. (2001) Ph.D. Dissertation, Dept. of Mathematics, Univ. of California, Berkeley.