41 research outputs found

    Boolean-controlled systems via receding horizon and linear programing.

    Get PDF
    We consider dynamic systems controlled by boolean signals or decisions. We show that in a number of cases, the receding horizon formulation of the control problem can be solved via linear programing by relaxing the binary constraints on the control. The idea behind our approach is conceptually easy: a feasible control can be forced by imposing that the boolean signal is set to one at least one time over the horizon. We translate this idea into constraints on the controls and analyze the polyhedron of all feasible controls. We specialize the approach to the stabilizability of switched and impulsively controlled systems

    Mixed integer predictive control and shortest path reformulation

    Get PDF
    Mixed integer predictive control deals with optimizing integer and real control variables over a receding horizon. The mixed integer nature of controls might be a cause of intractability for instances of larger dimensions. To tackle this little issue, we propose a decomposition method which turns the original nn-dimensional problem into nn indipendent scalar problems of lot sizing form. Each scalar problem is then reformulated as a shortest path one and solved through linear programming over a receding horizon. This last reformulation step mirrors a standard procedure in mixed integer programming. The approximation introduced by the decomposition can be lowered if we operate in accordance with the predictive control technique: i) optimize controls over the horizon ii) apply the first control iii) provide measurement updates of other states and repeat the procedure

    Finite Alphabet Control of Logistic Networks with Discrete Uncertainty

    Full text link
    We consider logistic networks in which the control and disturbance inputs take values in finite sets. We derive a necessary and sufficient condition for the existence of robustly control invariant (hyperbox) sets. We show that a stronger version of this condition is sufficient to guarantee robust global attractivity, and we construct a counterexample demonstrating that it is not necessary. Being constructive, our proofs of sufficiency allow us to extract the corresponding robust control laws and to establish the invariance of certain sets. Finally, we highlight parallels between our results and existing results in the literature, and we conclude our study with two simple illustrative examples

    Mixed-integer MPC for the temperature control of the batch reactor

    Get PDF
    Discrete Model Predictive Control (MPC) became one of the most widespread modern control principles. Process controls with a finite number of admissible values are common in a large number of relevant applications. For this type of optimization problems, the computational complexity is exponential in the number of binary optimization variables. The solver is based on a standard branch-and-bound method and interior point method is used for solution of the relaxed problem. The simulation experiment involved controlling the temperature of a batch reactor by using two on/off input valves and a discrete-position mixing valve.Ministry of Education, Youth and Sports of the Czech Republic within the National Sustainability Programme [L01303, MSMT-7778/2014

    Decomposition and Mean-Field Approach to Mixed Integer Optimal Compensation Problems

    Get PDF
    Mixed integer optimal compensation deals with optimization problems with integer- and real-valued control variables to compensate disturbances in dynamic systems. The mixed integer nature of controls could lead to intractability in problems of large dimensions. To address this challenge, we introduce a decomposition method which turns the original n-dimensional optimization problem into n independent scalar problems of lot sizing form. Each of these problems can be viewed as a two-player zero-sum game, which introduces some element of conservatism. Each scalar problem is then reformulated as a shortest path one and solved through linear programming over a receding horizon, a step that mirrors a standard procedure in mixed integer programming. We apply the decomposition method to a mean-field coupled multi-agent system problem, where each agent seeks to compensate a combination of an exogenous signal and the local state average. We discuss a large population mean-field type of approximation and extend our study to opinion dynamics in social networks as a special case of interest

    Finite Alphabet Control of Logistic Networks with Discrete Uncertainty

    Get PDF
    We consider logistic networks in which the control and disturbance inputs take values in finite sets. We derive a necessary and sufficient condition for the existence of robustly control invariant (hyperbox) sets. We show that a stronger version of this condition is sufficient to guarantee robust global attractivity, and we construct a counterexample demonstrating that it is not necessary. Being constructive, our proofs of sufficiency allow us to extract the corresponding robust control laws and to establish the invariance of certain sets. Finally, we highlight parallels between our results and existing results in the literature, and we conclude our study with two simple illustrative examples

    Formal controller synthesis for wastewater systems with signal temporal logic constraints: the Barcelona case study

    Get PDF
    © . This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativecommons.org/licenses/by-nc-nd/4.0/We present an approach for formal controller synthesis of the Barcelona wastewater system. The goal of the controller is to minimize overflow in the system and to reduce environmental contamination (pollution). Due to the influence of sudden and unpredictable weather changes within the Mediterranean climate, we propose robust model predictive control strategy. This approach synthesizes control inputs (i.e., flows through network actuators) that make the system robust to uncertainties in the weather forecast; control inputs are updated in an online fashion to incorporate the newly available measurements from the system and the disturbances. We employ signal temporal logic as a formal mechanism to express the desired behavior of the system. The quantitative semantics of the logic is then used to encode the desired behavior in both the set of constraints and the objective function of the optimization problem. We propose a solution approach for the obtained worst-case optimization, which is based on transforming the nonlinear dynamics of the system into a mixed logical dynamical model. Then, we employ Monte Carlo sampling and dual reformulation to get a mixed integer linear or quadratic programming problem. The proposed approach is applied to a catchment of the Barcelona wastewater system to illustrate its effectiveness.Peer ReviewedPostprint (author's final draft

    Mixed integer optimal compensation: Decompositions and mean-field approximations

    Get PDF
    Mixed integer optimal compensation deals with optimizing integer- and real-valued control variables to compensate disturbances in dynamic systems. The mixed integer nature of controls might be a cause of intractability for instances of larger dimensions. To tackle this issue, we propose a decomposition method which turns the original n-dimensional problem into n independent scalar problems of lot sizing form. Each scalar problem is then reformulated as a shortest path one and solved through linear programming over a receding horizon. This last reformulation step mirrors a standard procedure in mixed integer programming. We apply the decomposition method to a mean-field coupled multi-agent system problem, where each agent seeks to compensate a combination of the exogenous signal and the local state average. We discuss a large population mean-field type of approximation as well as the application of predictive control methods. © 2012 AACC American Automatic Control Council)

    Formal methods paradigms for estimation and machine learning in dynamical systems

    Get PDF
    Formal methods are widely used in engineering to determine whether a system exhibits a certain property (verification) or to design controllers that are guaranteed to drive the system to achieve a certain property (synthesis). Most existing techniques require a large amount of accurate information about the system in order to be successful. The methods presented in this work can operate with significantly less prior information. In the domain of formal synthesis for robotics, the assumptions of perfect sensing and perfect knowledge of system dynamics are unrealistic. To address this issue, we present control algorithms that use active estimation and reinforcement learning to mitigate the effects of uncertainty. In the domain of cyber-physical system analysis, we relax the assumption that the system model is known and identify system properties automatically from execution data. First, we address the problem of planning the path of a robot under temporal logic constraints (e.g. "avoid obstacles and periodically visit a recharging station") while simultaneously minimizing the uncertainty about the state of an unknown feature of the environment (e.g. locations of fires after a natural disaster). We present synthesis algorithms and evaluate them via simulation and experiments with aerial robots. Second, we develop a new specification language for tasks that require gathering information about and interacting with a partially observable environment, e.g. "Maintain localization error below a certain level while also avoiding obstacles.'' Third, we consider learning temporal logic properties of a dynamical system from a finite set of system outputs. For example, given maritime surveillance data we wish to find the specification that corresponds only to those vessels that are deemed law-abiding. Algorithms for performing off-line supervised and unsupervised learning and on-line supervised learning are presented. Finally, we consider the case in which we want to steer a system with unknown dynamics to satisfy a given temporal logic specification. We present a novel reinforcement learning paradigm to solve this problem. Our procedure gives "partial credit'' for executions that almost satisfy the specification, which can lead to faster convergence rates and produce better solutions when the specification is not satisfiable
    corecore