A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is
Proceedings of the 2003 American Control Conference, 2003.
This paper presents applications of polytopic a p proximation methods for reachable set computation using dynamic optimization. The problem of computing exact reachable sets can be formulated in terms of a Hamilton-Jacobi partial differential equation (PDE). Numerical solutions which provide convergent approximations of this PDE have computational complexity which is exponential in the continuous variable dimension. Using dynamic optimization and polytopic a p proximation, computationallydoi:10.1109/acc.2003.1242451 fatcat:j6j2tdno6rawda6sanseipzolu