Necessary and sufficient conditions for reachability on a simplex

  • Authors:
  • Bartek Roszak;Mireille E. Broucke

  • Affiliations:
  • Edward S. Rogers Sr. Department of Electrical and Computer Engineering, University of Toronto, 10 King's College, Toronto Ont., Canada M5S 3G4;Edward S. Rogers Sr. Department of Electrical and Computer Engineering, University of Toronto, 10 King's College, Toronto Ont., Canada M5S 3G4

  • Venue:
  • Automatica (Journal of IFAC)
  • Year:
  • 2006

Quantified Score

Hi-index 22.15

Visualization

Abstract

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.