The patchy Method for the Infinite Horizon Hamilton-Jacobi-Bellman Equation and its Accuracy
Krener, Arthur J.
MetadataShow full item record
We introduce a modification to the patchy method of Navasca and Krener for solving the stationary Hamilton Jacobi Bellman equation. The numerical solution that we generate is a set of polynomials that approximate the optimal cost and optimal control on a partition of the state space. We derive an error bound for our numerical method under the assumption that the optimal cost is a smooth strict Lyupanov function. The error bound is valid when the number of subsets in the partition is not too large.
Showing items related by title, author, creator and subject.
Lins, Roderick William (Monterey, California ; Naval Postgraduate School, 1971-12);Solution algorithms are presented for the vertex m-center and the absolute m-center problem. Both algorithms use partitioning techniques The algorithms use special properties of the max-min node to test for optimality. ...
Schwartz, Victor Scott (Monterey, California. Naval Postgraduate School, 1998-09-01);A dynamic platform-independent solver is developed for use with network and graph algorithms of operations research. This solver allows analysts to solve a large variety of problems without writing code. Algorithms from a ...
Breckon, Thomas Joseph (Monterey, California. Naval Postgraduate School, 1970-06);The partition problem is that step in the layout problem in which it must be decided which of the elementary digital circuits are to be coalesced into a single, electronic package. A solution of the partition problem must ...