https://www.selleckchem.com/products/azd9291.html
The problem of computing the reachable set for a given system is a quintessential question in nonlinear control theory. Motivated by prior work on safety-critical online planning, this paper considers an environment where the only available information about system dynamics is that of dynamics at a single point. Limited to such knowledge, we study the problem of describing the set of all states that are guaranteed to be reachable regardless of the unknown true dynamics. We show that such a set can be underapproximated by a reachable set
Like
Comment
Share
