Hatanaka, Takeshi (Kyoto Univ.), Takaba, Kiyotsugu (Kyoto Univ.)

Computations of Probabilistic Output Admissible Set for Uncertain Constrained Systems

Scheduled for presentation during the Regular Session "Systems with Saturation and Deadzone" (ThA10), Thursday, July 27, 2006, 11:15−11:40, Room 103

17th International Symposium on Mathematical Theory of Networks and Systems, July 24-28, 2006, Kyoto, Japan

This information is tentative and subject to change. Compiled on May 19, 2024

Abstract

This paper considers uncertain constrained systems, and develops a method for computing a probabilistic output admissible (POA) set which is a set of initial states probabilistically assured to satisfy the constraint. We first present the basic algorithm for computing the POA set.Though the algorithm is easily obtained by utilizing the sequential randomized algorithm, its computational effort is enormous and the termination in finite iterations is not assured. Thus, we develop an improved algorithm whose computational effort is reasonably small and the finite termination is guaranteed. A numerical simulation demonstrates the effectiveness of the present method.