论文信息 - A min‐max version of Dijkstra's algorithm with application to perturbed optimal control problems

A min‐max version of Dijkstra's algorithm with application to perturbed optimal control problems

In this paper the computational complexity of a newly developed min-max version of Dijkstra's algorithm for solving the shortest path problem in a directed weighted hypergraph is analyzed. Together with a set oriented discretization of the state space this algorithm provides a new numerical approach for the construction of an optimally stabilizing feedback under perturbations. (© 2008 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim)

Marcus von Lossow

[1] Edsger W. Dijkstra,et al. A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[2] Giorgio Gallo,et al. Directed Hypergraphs and Applications , 1993, Discret. Appl. Math..

[3] O. Junge,et al. A set oriented approach to global optimal control , 2004 .

[4] Lars Grüne,et al. A set oriented approach to optimal feedback stabilization , 2005, Syst. Control. Lett..

[5] T. Başar,et al. Dynamic Noncooperative Game Theory , 1982 .

[6] William J. Cook,et al. Combinatorial optimization , 1997 .