By Topic

The continual reachability set and its computation using maximal reachability techniques

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Kaynama, S. ; Dept. of Electr. & Comput. Eng., Univ. of British Columbia, Vancouver, BC, Canada ; Oishi, M. ; Mitchell, I.M. ; Dumont, G.A.

The continual reachability set, the set of initial states of a constrained dynamical system that can reach a target at any desired time, is introduced. The properties of this set are investigated and its connection with maximal reachability constructs is examined. Owing to this connection, efficient and scalable maximal reachability techniques can be used to compute the continual reachability set. An approximation of this set based on ellipsoidal techniques is presented. The results are demonstrated on a problem of control of anesthesia.

Published in:

Decision and Control and European Control Conference (CDC-ECC), 2011 50th IEEE Conference on

Date of Conference:

12-15 Dec. 2011