In this paper, first of all, we introduce the basic concepts of generating function in combinatorics and some combinatorial identities. In order to facilitate the understanding of m-order time optimal control synthesis function of discrete system (referred as m-order synthesis function), secondly, we introduce the derivation process and control ideas of 2nd-order synthesis function, and then deduce in detail the m-order synthesis function by means of generating function. By use of the m-order tracking-form synthesis function with filter factor, the methods of signal extraction and its predictive compensation are presented in this paper, and their immunity and effectiveness are verified by numerical simulation.
In this paper, first of all, we introduce the basic concepts of generating function in combinatorics and some combinatorial identities. In order to facilitate the understanding of m(greater than 1)-order time optimal control synthesis function of discrete system (referred as m-order synthesis function), secondly, we introduce the derivation process and control ideas of 2nd-order synthesis function fsun(), and then deduce in detail the m-order synthesis function by means of generating function. By use of the m-order tracking-form synthesis function with filter factor, the methods of signal extr…
We consider the time-optimal problem for a classical system of "double integrator" under the presence of a linear state constraint. By using the Maximum Principle of Dubovitskii and Milyutin, we determine a complete synthesis of optimal trajectories and qualitatively analyze the corresponding Lagrange multipliers.
Supervisory control of discrete-event systems with a global safety specification and with only local supervisors is a difficult problem. For global specifications the equivalent conditions for local control synthesis to equal global control synthesis may not be met. This paper formulates and solves a control synthesis problem for a generator with a global specification and with a combination of a coordinator and local controllers. Conditional controllability is proven to be an equivalent condition for the existence of such a coordinated controller. A procedure to compute the least restrictive …
Global optimality analysis in sub-Riemannian problem on the Lie group SH(2) is considered. We cutout open dense domains in the preimage and in the image of the exponential mapping based on the description of Maxwell strata. We then prove that the exponential mapping restricted to these domains is a diffeomorphism. Based on the proof of diffeomorphism, the cut time, i.e., time of loss of global optimality is computed on SH(2). We also consider the global structure of the exponential mapping and obtain an explicit description of cut locus and optimal synthesis.
This paper reviews several uses of harmonic information in the synthesis of mechanisms and shows that such information can be put to even greater use in this field. Results are presented for both single and multi-degree of freedom systems which support this claim. In both cases, the inclusion of harmonic information into the objective function aids the search to locate high quality solutions.
For a particular class of planar dynamics that are linear with respect to the control variable, we show that the feedback strategy ''null-singular null'' is minimizing the maximum of a coordinate over infinite horizon, under a L 1 budget constraint on the control. Moreover, we characterize the optimal cost as a function of the budget. The proof is based on an unusual use of the clock form. This result generalizes the one obtained formerly for the SIR epidemiological model to more general Kolmogorov dynamics, that we illustrate on other biological models.
Flexible manufacturing has been the trend in the area of the modern chemical process nowadays. One of the essential characteristics of flexible manufacturing is to track time-varying target trajectories (e.g. diversity and quantity of products). A possible tool to achieve time-varying targets is contraction theory. However, the contraction theory was developed for continuous time systems and there lacks analysis and synthesis tools for discrete-time systems. This article develops a systematic approach to discrete-time contraction analysis and control synthesis using Discrete-time Control Contr…
This paper addresses the problem of control synthesis for nonlinear optimal control problems in the presence of state and input constraints. The presented approach relies upon transforming the given problem into an infinite-dimensional linear program over the space of measures. To generate approximations to this infinite-dimensional program, a sequence of Semi-Definite Programs (SDP)s is formulated in the instance of polynomial cost and dynamics with semi-algebraic state and bounded input constraints. A method to extract a polynomial control function from each SDP is also given. This paper pro…
We consider optimal distributed controller synthesis for an interconnected system subject to communication constraints, in linear quadratic settings. Motivated by the problem of finite heavy duty vehicle platooning, we study systems composed of interconnected subsystems over a chain graph. By decomposing the system into orthogonal modes, the cost function can be separated into individual components. Thereby, derivation of the optimal controllers in state-space follows immediately. The optimal controllers are evaluated under the practical setting of heavy duty vehicle platooning with communicat…
A systematic procedure to synthesize interval observers for nonlinear discrete-time systems is proposed. The feedback gains and other matrices are found from the solutions to semidefinite feasibility programs. Two cases are considered: (1) the interval observer is in the same coordinate frame as the given system, and (2) the interval observer uses a coordinate transformation. The conditions where coordinate transformations are necessary are detailed. Numerical examples are provided to showcase the effectiveness of the interval observers and demonstrate their application to sampled-data systems…
The first part of this paper proposed a family of penalized convex relaxations for solving optimization problems with bilinear matrix inequality (BMI) constraints. In this part, we generalize our approach to a sequential scheme which starts from an arbitrary initial point (feasible or infeasible) and solves a sequence of penalized convex relaxations in order to find feasible and near-optimal solutions for BMI optimization problems. We evaluate the performance of the proposed method on the H2 and Hinfinity optimal controller design problems with both centralized and decentralized structures. Th…
A dynamical system entrains to a periodic input if its state converges globally to an attractor with the same period. In particular, for a constant input the state converges to a unique equilibrium point for any initial condition. We consider the problem of maximizing a weighted average of the system's output along the periodic attractor. The gain of entrainment is the benefit achieved by using a non-constant periodic input relative to a constant input with the same time average. Such a problem amounts to optimal allocation of resources in a periodic manner. We formulate this problem as a peri…
The use of deceptive strategies is important for an agent that attempts not to reveal his intentions in an adversarial environment. We consider a setting in which a supervisor provides a reference policy and expects an agent to follow the reference policy and perform a task. The agent may instead follow a different, deceptive policy to achieve a different task. We model the environment and the behavior of the agent with a Markov decision process, represent the tasks of the agent and the supervisor with reachability specifications, and study the synthesis of optimal deceptive policies for such …
This paper studies the bioremediation, in minimal time, of a water resource or reservoir using a single continuous bioreactor. The bioreactor is connected to two pumps, at different locations in the reservoir, that pump polluted water and inject back sufficiently clean water with the same flow rate. This leads to a minimal-time optimal control problem where the control variables are related to the inflow rates of both pumps. We obtain a non-convex problem for which it is not possible to directly prove the existence of its solutions. We overcome this difficulty and fully solve the studied probl…
This paper addresses the problem of designing an anti-windup like compensator for discrete-time linear control systems with quantized input. The proposed compensator provides a correction signal proportional to the quantization error that fed to the controller. The compensator is designed to ensure that solutions to the closed-loop systems converge in finite time into a compact set containing the origin that can be tuned by the designer. A numerically tractable algorithm with feasibility guarantees is provided for the design of the compensator. The proposed results are illustrated on an academ…
A deterministic method for synthesizing the interconnect topologies optimized for the required properties is proposed. The method is based on the original description of graphs by projections, on establishing the bijective correspondence of the required properties and the projection properties of the initial graph, on postulating the corresponding restrictions of modified projections and on iteratively applying these restrictions to them either until the projection system is solved and the projections of the desired graph are obtained, or until its incompatibility with the given initial condit…
This paper considers the synthesis of optimal safe controllers based on density functions. We present an algorithm for robust constrained optimal control synthesis using the duality relationship between the density function and the value function. The density function follows the Liouville equation and is the dual of the value function, which satisfies Bellman's optimality principle. Thanks to density functions, constraints over the distribution of states, such as safety constraints, can be posed straightforwardly in an optimal control problem. The constrained optimal control problem is then s…
Although quantum computers have the potential to efficiently solve certain problems considered difficult by known classical approaches, the design of a quantum circuit remains computationally difficult. It is known that the optimal gate design problem is equivalent to the solution of an associated optimal control problem, the solution to which is also computationally intensive. Hence, in this article, we introduce the application of a class of numerical methods (termed the max-plus curse of dimensionality free techniques) that determine the optimal control thereby synthesizing the desired unit…
Indian Institute of Technology Kanpur（印度理工学院坎普尔分校）
We propose a framework for synthesizing a feedback control policy that maximizes the region of attraction (ROA) of a closed-loop nonlinear dynamical system. Our synthesis technique relies on stochastic optimization, which involves computation of an objective function capturing the ROA for a feedback control law. We employ a machine learning technique based on deep neural network to estimate the ROA for a given feedback controller. Overall, our technique is capable of synthesizing a controller co-optimizing traditional control objectives like LQR cost together with ROA. We demonstrate the effic…
