Sciweavers

Share
AUTOMATICA
2006

Necessary and sufficient conditions for reachability on a simplex

9 years 4 months ago
Necessary and sufficient conditions for reachability on a simplex
In this paper we solve the general problem of designing a feedback controller to reach a set of facets of an n-dimensional simplex in finite time, for a system evolving with linear affine dynamics. Necessary and sufficient conditions are presented in the form of bilinear inequalities on the vertices of the simplex. By exploiting the structure of the problem, the bilinear inequalities are converted to a series of linear programming problems. Key words: hybrid systems; reachability; simplex; piecewise-linear affine system.
Bartek Roszak, Mireille E. Broucke
Added 10 Dec 2010
Updated 10 Dec 2010
Type Journal
Year 2006
Where AUTOMATICA
Authors Bartek Roszak, Mireille E. Broucke
Comments (0)
books