By Topic

Reachability of a Set of Facets for Linear Affine Systems With n-1 Inputs

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

2 Author(s)
Roszak, B. ; Syst. Control Group, Univ. of Toronto, Ont. ; Broucke, M.E.

This note provides new necessary and sufficient conditions for an n-dimensional linear affine system with n-1 inputs to reach an exit facet (or set of exit facets) of a simplex. The conditions reduce the original NP-hard necessary and sufficient conditions to a set of at most n LP problems

Published in:

Automatic Control, IEEE Transactions on  (Volume:52 ,  Issue: 2 )