Abstract-The reachability problem has received significant attention in the hybrid control literature with many questions still left unanswered. In this paper we solve the general problem of reaching 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 inequalities on the vertices of the simplex, and a linear affine controller is constructed that solves the reachability problem.
In this technical note we study the servomechanism problem for positive open-loop stable LTI systems under constant tracking signals and constant disturbances. In particular, we show that in general the MIMO servomechanism problem for positive systems is not solvable, but is solvable for various classes of MIMO systems, and for the class of SISO systems in which the disturbances are small compared to the tracking signal. In particular, we give existence results as to what subclass of reference and disturbance signals can be considered, for the case when either the mathematical model of the plant is known or unknown, and we provide the controller structure that solves the problem for the case of measurable or unmeasurable disturbance signals.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.