WiP Abstract: Distributed Reactive Control Synthesis for Aircraft Electric Power Systems via SAT Solving

This paper considers the control synthesis problem and its solution using symbolic regression. Symbolic regression methods, which were previously called genetic programming methods, allow one to use a computer to find not only the parameters of a given regression function but also its structure. Unlike other works on solving the control synthesis problem using symbolic regression, the novelty of this paper is that for the first time this work employs a training dataset to address the problem of general control synthesis. Initially, the optimal control problem is solved from each point in a given set of initial states, resulting in a collection of control functions expressed as functions of time. A reference model is then integrated into the control object model, which generates optimal motion trajectories using the derived optimal control functions. The control synthesis problem is framed as an approximation task for all optimal trajectories, where the control function is sought as a function of the deviation of the object from the specified terminal state. The optimization criterion for solving the synthesis problem is the accuracy of the object’s movement along the optimal trajectory. The paper includes an example of solving the control synthesis problem for a mobile robot using a supervised machine learning method. A relatively new method of symbolic regression, the method of variational complete binary genetic programming, is studied and proposed for the solution of the control synthesis problem.

We consider the problem of analysis and control of discretely distributed systems in multidimensional arrays. For spatially invariant systems in one spatial dimension, we build an efficient arithmetic that preserves the rational Laurent operator structure, leading to fast iterative methods of solving Lyapunov and Riccati equations and block diagonalizations, and thus arbitrarily non-conservative stability analysis and <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">H</i> <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sub> and <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">H</i> <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">∞</sub> distributed controller synthesis. These one-dimensional results are then used to build an efficient arithmetic and controller synthesis procedure in <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">n</i> -dimensions by induction. The extension of these techniques from Laurent operators with rational symbols to sequentially semi-separable matrices yields a procedure for linear computational complexity analysis and controller synthesis for finite extent heterogeneous multidimensional systems with boundary conditions. The procedures are demonstrated on two computational examples.

An identification control is a control of an object which mathematical model is unknown. For such objects initially the problem of identification is solved, and then for the resulting object model the problem of control synthesis is solved. As a result of control synthesis we obtain a multi-dimensional function that describes the dependence of control on the object state. After the implementation of this function in the control unit of the real object, it achieves the goal of control with optimal value of the quality criteria. To solve the identification and synthesis problems we use the method of network operator, which with the help of evolutionary algorithms finds the structure and parameters of the functions describing the model and functional dependence of control from the object state. In this paper, an example of using a network operator to solve the problem of identification control synthesis for a multilink robot is given.

This work eonsiden the H, norm control of structural systems with collocated sensors and actuators using an analytical upper bound approach. A parametrization of the output feedback control gains that achieve a desired H, norm bound is obtained using an analytical solution of the Bounded Real Lemma. This approach is verified experimentally on a cantilevered aluminum beam with two collocated pairs of piezoceramic patches that serve as sensors and actuators. The finite element model of this beam is developed and the simulations show a drop of -6 dB in the H, norm of the closed loop system. Experimental results verify the simulated results and demonstrate the effectiveness of this method. The proposed control methodology has obvious computational advantages compared to traditional H, control design methods, especially for lnrge scale systems. The control of structural systems with collocated sensors and actuators has been shown to provide great advantages from a stability, passivity, robustness and an implementation viewpoint. For example, collocated control can easily be achieved in a space structure when an attitude rate sensor is placed at the same point as a torque actuator.(l)(2) The actuator placement and sizing optimization for vibration sup pression of a collocated beam structure is discussed in Ref. (3).Collocation of sensors and actuators leads to symmetric transfer functions. Several other classes of engineering sys- tems, such as circuit systems, chemical reactors and power networks, can be modelled as systems with symmetric trans- fer functions. Stabilization, robustness, model reduction and control of such systems has been examined recently.(4)(5) The H, norm control of structural systems has attracted a lot of attention recently due to the interpretation of the H, norm in the frequency domain. In early work, D-K iteration method was used to design H, controllers for a non-collocated flexible shucture. Now state space H, control based on the standard Riccati equation approach or the linear matrix inequality (LMI) formulation is a well developed control synthesis tool. The optimal static state feedback and full-order dynamic output feedback H, con- trol synthesis problems can be solved using iterations on the corresponding Riccati solutions or via the computational solution of a convex LMI optimization problem.(7)(8) On the other hand, the static output feedback and the fixed-order dynamic output feedback H, control synthesis problems are difficult computational problems since they require the

Automated Synthesis of Fixed Structure QFT Controller using Interval Constraint Satisfaction Techniques

SUMMARY In this paper, several concepts of switching frequency are introduced to analyze the properties and performance of switched systems in infinite as well as finite-time intervals. The observation is very motivating that different system properties and performances depend on different switching frequencies. Sufficient conditions ensuring asymptotic stability, l2 gain performance, and state boundness are derived on the basis of the notions of switching frequency, respectively. Then, on the basis of the analysis results, the control synthesis problems are addressed. LMI-based design algorithms are proposed to meet different control synthesis requirements. Numerical design examples are provided to demonstrate our results. Copyright © 2011 John Wiley & Sons, Ltd.

Robust controller synthesis attracts reviving research interest, driven by\nthe rise of learning-based systems where uncertainty and perturbation are\nubiquitous. Facing an uncertain situation, a robustly stabilizing controller\nshould maintain stability while operating under a perturbed system deviating\nfrom its nominal specification. There have been numerous results for robust\ncontroller synthesis in multiple forms and with various goals, including\nmu-synthesis, robust primal-dual Youla, robust input-output, and robust system\nlevel parameterizations. However, their connections with one another are not\nclear, and we lack a general approach to robust controller analysis and\nsynthesis.\n To serve this purpose, we derive robust stability conditions for general\nsystems and formulate the general robust controller synthesis problem. The\nconditions hinge on the realization-stability lemma, a recent analysis tool\nthat unifies existing controller synthesis methods. Not only can the conditions\ninfer a wide range of existing robust results, but they also lead to easier\nderivations of new ones. Together, we demonstrate the effectiveness of the\nconditions and provide a unified approach to robust controller analysis and\nsynthesis.\n

This study considers the problem of control synthesis via static output feedback for time‐delay systems with restricted frequency domain specifications. A static output‐feedback (SOF) controller is designed by a two‐stage method. The first stage is to design an initial full‐information (FI) controller, and the second stage is to explore an SOF controller heuristically from the initial FI controller. An iterative algorithm to optimise the initial FI controller is constructed. Moreover, a more effective algorithm to explore an SOF controller is also formulated. Finally, the effectiveness of the proposed method is illustrated via the classical ACC benchmark problem of cart‐spring system.

Mining frequent itemsets from transactional datasets is a well known problem. Thus, various methods have been studied to deal with this issue. Recently, original proposals have emerged from the cross-fertilization between data mining and artificial intelligence. In these declarative approaches, the itemset mining problem is modeled either as a constraint network or a propositional formula whose models correspond to the patterns of interest. In this paper, we focus on the propositional satisfiability based itemset mining framework. Our main goal is to enhance the efficiency of SAT model enumeration algorithms. This issue is particularly crucial for the scalability and competitiveness of such declarative itemset mining approaches. In this context, we deeply analyse the effect of the different SAT solver components on the efficiency of the model enumeration problem. Our analysis includes the main components of modern SAT solvers such as restarts, activity based variable ordering heuristics and clauses learning mechanism. Through extensive experiments, we show that these classical components play an essential role in such procedure to improve the performance by pushing forward the efficiency of SAT solvers. More precisely, our experimental evaluation includes a comparative study in enumerating all the models corresponding to the closed frequent itemsets. Additionally, our experimental analysis is extended to include the Top-k itemset mining problem.

The problem of optimal control synthesis of complex nonlinear and multidimensional systems oriented on the building of integrated control systems with the adaptation and self-organization properties is of much current interest. The development of optimization methods employed in control problems demonstrated their effectiveness and has led to the construction of algorithms of approximate solution of optimization problems that significantly extends the class of control problems that can be set. In this work we consider a synthesis of optimal control for affine nonlinear system, in which a special emphasis is placed on the degenerate problems of optimal control. Our approach is based on the extension of the method of minimization of generalized work function by properly transforming the initial nondegenerate problem of optimal control into degenerate problem of optimal control synthesis. The search for the solution is based on the suboptimal strategy that includes the construction of minimizing sequences that converge interval-wise to the optimal solution of the initial problem. We obtain some optimality conditions as well as the necessary and sufficient conditions of existence of optimal solution.

Given a Markov decision process (MDP) and a linear-time ($ømega$-regular or Linear Temporal Logic) specification which reasons about the infinite-trace behavior of a system, the controller synthesis problem aims to compute the optimal policy that satisfies said specification. Recently, problems that reason over the complementary infinite-frequency behavior of systems have been proposed through the lens of steady-state planning or steady-state policy synthesis. This entails finding a control policy for an MDP such that the Markov chain induced by the solution policy satisfies a given set of constraints on its steady-state distribution. This paper studies a generalization of the controller synthesis problem for a linear-time specification under steady-state constraints on the asymptotic behavior of the agent. We present an algorithm to find a deterministic policy satisfying $ømega$-regular and steady-state constraints by characterizing the solutions as an integer linear program, and experimentally evaluate our approach.

Robust control synthesis for seat suspension systems with actuator saturation and time-varying input delay

The synthesis of controllers for reactive systems can be done by computing winning strategies in two-player games. Timed (game) Automata are an appropriate formalism to model real-time embedded systems but are not easy to use for controller synthesis for two reasons: i) timed models require the knowledge of the precise timings of the system (for example, if an action must occur in the future, the deadline of this occurrence must be known) ii) in practice, the dense state space makes the computation of the controller often impossible for complex systems. This paper introduces an extension of untimed game automata with logical time. The new semantics introduces two new types of uncontrollable actions: delayed actions which are possibly avoidable, and ineluctable actions which will eventually happen if nothing is done to abort it. The controller synthesis problem is adapted to this new semantics. This paper focuses specifically on the reachability and safety objectives and gives algorithms to generate a controller. The usefulness of this new model is illustrated by a device driver synthesis example.

Many correct-by-construction control synthesis methods suffer from the curse of dimensionality. Motivated by this challenge, we seek to reduce a correct-by-construction control synthesis problem to subproblems of more modest dimension. As a step towards this goal, in this paper we consider the problem of synthesizing decoupled robustly controlled invariant sets for dynamically coupled linear subsystems with state and input constraints. Our approach, which gives sufficient conditions for decoupled invariance, is based on optimization over linear matrix inequalities which are obtained using slack variable identities. We illustrate the applicability of our method on several examples, including one where we solve local control synthesis problems in a compositional manner.

A problem of great interest in the control of hybrid systems is the design of least restrictive controllers for reachability specifications. Controller design typically uses game theoretic methods to compute the region of the state space for which there exists a control such that for all disturbances, an unsafe set is not reached. In general, the computation of the controllers requires the steady state solution of a Hamilton-Jacobi partial differential equation which is very difficult to compute, if it exists. In this paper, we show that for special classes of hybrid systems where the continuous vec-tor fields are linear, the controller synthesis problem is semi-decidable: There exists a computational algo-rithm which, if it terminates in a finite number of steps, will exactly compute the least restrictive con-troller. This result is achieved by a very interesting interaction of results from mathematical logic and o p timal control. 1