Sciweavers

25 search results - page 1 / 5
» Optimal Semicomputable Approximations to Reachable and Invar...
Sort
View
MST
2007
90views more  MST 2007»
13 years 10 months ago
Optimal Semicomputable Approximations to Reachable and Invariant Sets
In this paper we consider the computation of reachable, viable and invariant sets for discrete-time systems. We use the framework of type-two effectivity, in which computations a...
Pieter Collins
AUTOMATICA
2006
73views more  AUTOMATICA 2006»
13 years 11 months ago
Robust MPC of constrained discrete-time nonlinear systems based on approximated reachable sets
A robust MPC for constrained nonlinear systems with uncertainties is presented. Outer bounds of the reachable sets of the system are used to predict the evolution of the system un...
J. M. Bravo, T. Alamo, Eduardo F. Camacho
AUTOMATICA
2006
111views more  AUTOMATICA 2006»
13 years 11 months ago
The minimal disturbance invariant set: Outer approximations via its partial sums
This paper is concerned with outer approximations of the minimal disturbance invariant set (MDIS) of a discrete-time linear system with an additive set-bounded disturbance. The k-...
Chong Jin Ong, Elmer G. Gilbert
NIPS
2007
14 years 13 days ago
What makes some POMDP problems easy to approximate?
Point-based algorithms have been surprisingly successful in computing approximately optimal solutions for partially observable Markov decision processes (POMDPs) in high dimension...
David Hsu, Wee Sun Lee, Nan Rong
SIAMCO
2010
124views more  SIAMCO 2010»
13 years 5 months ago
Reachability and Minimal Times for State Constrained Nonlinear Problems without Any Controllability Assumption
We consider a target problem for a nonlinear system under state constraints. We give a new continuous level-set approach for characterizing the optimal times and the backward-reach...
Olivier Bokanowski, Nicolas Forcadel, Hasnaa Zidan...