Abstract
Abstract The problem of the approximate construction of the viability kernel for a generalized dynamical system, the evolution of which is specified directly by an attainability set, is investigated under phase constraints. A backward grid method, based on the substitution of the phase space by pixels and a consideration of “inverse” attainability sets, is proposed. The convergence of the method is proved.
Full Text
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call