This thesis studies the Reach Control Problem (RCP) for affine systems defined on simplices. The thesis focuses on cases when it is known that the problem is not solvable by continuous state feedback. Previous work has proposed (discontinuous) piecewise affine feedback to resolve the gap between solvability by open-loop controls and solvability by feedbacks. The first results on solvability by time-varying feedback are presented. Time-varying feedback has the advantage to be more robust to measurement errors circumventing problems of discontinuous controllers. The results are theoretically appealing in light of the strong analogies with the theory of stabilization for linear control systems. The method is shown to solve RCP for all cases in the literature where continuous state feedback fails, provided it is solvable by open loop control. Textbook examples are provided. The motivation for studying RCP and its relevance to complex control specifications is illustrated using a material transfer system.

This thesis provides a deep study of the Reach Control Problem (RCP) for affine systems defined on simplices. Necessary conditions for solvability of the problem by open loop control are presented, improving upon the results in the literature which are for continuous state feedback only. So-called reach control indices are introduced and developed which inform on the structural properties of the system which cause continuous state feedbacks to fail. A novel synthesis method is presented consisting of a subdivision algorithm based on these indices and an associated piecewise affine feedback. The method is shown to solve RCP for all cases in the literature where continuous state feedback fails, provided it is solvable by open loop control. Textbook examples of existing synthesis methods for RCP are provided. The motivation for studying RCP and its relevance to complex control specifications is illustrated using a biomedical application.

This thesis studies the Reach Control Problem (RCP) for affine systems defined on simplices. The thesis focuses on cases when it is known that the problem is not solvable by continuous state feedback. Previous work has proposed (discontinuous) piecewise affine feedback to resolve the gap between solvability by open-loop controls and solvability by feedbacks. The first results on solvability by time-varying feedback are presented. Time-varying feedback has the advantage to be more robust to measurement errors circumventing problems of discontinuous controllers. The results are theoretically appealing in light of the strong analogies with the theory of stabilization for linear control systems. The method is shown to solve RCP for all cases in the literature where continuous state feedback fails, provided it is solvable by open loop control. Textbook examples are provided. The motivation for studying RCP and its relevance to complex control specifications is illustrated using a material transfer system.

This thesis provides a deep study of the Reach Control Problem (RCP) for affine systems defined on simplices. Necessary conditions for solvability of the problem by open loop control are presented, improving upon the results in the literature which are for continuous state feedback only. So-called reach control indices are introduced and developed which inform on the structural properties of the system which cause continuous state feedbacks to fail. A novel synthesis method is presented consisting of a subdivision algorithm based on these indices and an associated piecewise affine feedback. The method is shown to solve RCP for all cases in the literature where continuous state feedback fails, provided it is solvable by open loop control. Textbook examples of existing synthesis methods for RCP are provided. The motivation for studying RCP and its relevance to complex control specifications is illustrated using a biomedical application.

As control systems become more integrated with high-end engineering systems as well as consumer products, they are expected to achieve specifications that may include logic rules, safety constraints, startup procedures, and so forth. Control design for such complex specifications is a relatively unexplored research area. One possible design approach is based on partitioning the state space into polytopic regions, and then formulating a certain control problem on each polytope, with the intention that the set of all controllers so obtained would collectively achieve the specification. The control problem which must be solved for each polytope is called the reach control problem, and it has been identified as turnkey to the further development of this approach. The reach control problem (RCP) is to find a state feedback to make the closed-loop trajectories of an affine (or linear) control system defined on a polytope reach and exit a prescribed facet of the polytope in finite time. This dissertation studies a number of aspects of the reach control problem, and it uses tools from convex analysis, nonsmooth analysis, and computational geometry for this study. The dissertation has three main themes. First, we formulate and solve a variant of RCP in which trajectories exit the polytope in a monotonic sense; this provides a triangulation-independent solution of RCP. Second, we develop a Lyapunov-like theory for verifying if RCP is solved using a given candidate controller. This involves the introduction of the notion of generalized flow functions, a LaSalle Principle for RCP, and several converse theorems on existence of generalized flow functions. Third, we study the relationship between affine feedbacks and continuous state feedbacks for RCP on simplices. Although the two feedback classes have been shown to be equivalent under an assumption on the triangulation of the state space, we show by a counterexample that the equivalence is no longer true under arbitrary triangulations. Then we provide for single-input systems a constructive method for the synthesis of multi-affine feedbacks for RCP on simplices.

As control systems become more integrated with high-end engineering systems as well as consumer products, they are expected to achieve specifications that may include logic rules, safety constraints, startup procedures, and so forth. Control design for such complex specifications is a relatively unexplored research area. One possible design approach is based on partitioning the state space into polytopic regions, and then formulating a certain control problem on each polytope, with the intention that the set of all controllers so obtained would collectively achieve the specification. The control problem which must be solved for each polytope is called the reach control problem, and it has been identified as turnkey to the further development of this approach. The reach control problem (RCP) is to find a state feedback to make the closed-loop trajectories of an affine (or linear) control system defined on a polytope reach and exit a prescribed facet of the polytope in finite time. This dissertation studies a number of aspects of the reach control problem, and it uses tools from convex analysis, nonsmooth analysis, and computational geometry for this study. The dissertation has three main themes. First, we formulate and solve a variant of RCP in which trajectories exit the polytope in a monotonic sense; this provides a triangulation-independent solution of RCP. Second, we develop a Lyapunov-like theory for verifying if RCP is solved using a given candidate controller. This involves the introduction of the notion of generalized flow functions, a LaSalle Principle for RCP, and several converse theorems on existence of generalized flow functions. Third, we study the relationship between affine feedbacks and continuous state feedbacks for RCP on simplices. Although the two feedback classes have been shown to be equivalent under an assumption on the triangulation of the state space, we show by a counterexample that the equivalence is no longer true under arbitrary triangulations. Then we provide for single-input systems a constructive method for the synthesis of multi-affine feedbacks for RCP on simplices.