Direct synthesis of reduced order H controllers for a class of multivariable plants

Given an nth order, -control input, p-measured output generalized plant, this article proposes a simple, direct approach to design an output feedback H controller with order satisfying for , or for . For this purpose, the output feedback H control problem is transformed into an H state feedback problem for an augmented generalized system. A class of plants for which this transformation always exists and the ensuing controller has order as above, is identified. As a result, for such plants, the reduced order H controller gains are found just by solving a simple linear matrix inequality problem used in state feedback based H control. The efficacy of the proposed approach is studied on some benchmark examples.     

A new -gain analysis framework for discrete-time switched systems based on predictive Lyapunov function

The work proposes the pre--gain analysis framework based on the newly raised nonweighted pre--gain performance index and predictive Lyapunov function, which is devoted to nonweighted -gain analysis and relevant control of discrete-time switched systems under mode-dependent average dwell time. This also provides new ideas for other disturbance-related studies. To begin with, the predictive Lyapunov function is established for switched nonlinear systems in the sense of better reflecting future system dynamics and future external disturbances. Hence, it is achievable to develop less conservative stability and nonweighted pre--gain criteria for switched linear systems. Further, a new disturbance-output expression is devised to match with the nonweighted pre--gain, whose function is to estimate and optimize the traditional nonweighted -gain of the underlying system through discussions. Then, a solvable condition is formulated to seek the piecewise time-dependent gains of switching controller in a convex structure, ensuring the global uniform exponential stability with nonweighted pre--gain and thereby attaining much smaller non-weighted -gain. Finally, the simulation comprised of a circuit system and a numerical example manifests the impressive potential of the obtained results for the purpose of preferable disturbance attenuation performances.     

Optimal linear combination of sensors and actuators to enforce an interior conic open‐loop system

This paper presents techniques to linearly combine the sensor measurements and/or actuator inputs of a linear time‐invariant system to obtain a new system that is interior conic with prescribed bounds. In the optimal sensor combination problem, a desired system output is defined, and in the optimal actuator combination problem, a desired system input is defined, along with a frequency bandwidth in which the desired system input or output should be matched. The simultaneous optimal sensor and actuator combination problem includes desired system outputs and inputs. In all cases, the weighted or norm of the difference between the system with linearly combined sensors or actuators and the desired system is minimized while rendering the new system interior conic with prescribed bounds. The weighting transfer matrix used in the ‐ or ‐optimization problem is determined by the frequency bandwidth of interest. The individual sensor and actuator combination methods involve linear matrix inequality constraints and are posed as convex optimization problems, whereas the combined sensor and actuator method is an iterative procedure composed of convex optimization steps. Numerical examples illustrate superior tracking performance with the proposed sensor and actuator combination techniques over comparable techniques in the literature when implemented with a simple feedback controller. Robust asymptotic stability of the closed‐loop system to plant uncertainty is demonstrated in the numerical examples.     

Stability and stabilization for singularly perturbed systems with Markovian jumps

This article focuses on the stability and stabilization problems of singularly perturbed jump systems. Here, the singularly perturbed parameter (SPP) is also with Markov switching and satisfies any with positive bound predefined. First, stability conditions expressed ?_i‐free but involving its bound are developed by constructing an ?_i‐dependent Lyapunov function. Then, a method for state feedback stabilization controller depending on SPP is proposed, whose conditions are given in terms of linear matrix inequalities. Moreover, some special cases about deterministic SPP are considered too. Finally, two practical examples are used to demonstrate the effectiveness and superiorities of the proposed methods.     

Stabilization of the planar vertical take-off and landing using nonlinear feedback control

This article presents a new control strategy for the well-known problem of the planar vertical take-off and landing. The total thrust is computed using a nonlinear feedback compensation so that the altitude reaches the desired altitude. The horizontal position x is then controlled by choosing the orientation angle as a smooth saturation function of x and . A proof of convergence is presented using a Lyapunov approach. The proposed control strategy is successfully tested in numerical simulations.     

Discrete‐time sector based hands‐off control for nonlinear system

This article presents a hands‐off control design for discrete‐time nonlinear system with a special type of nonlinear sector termed as “discrete‐time sector.” The design method to define the boundary of a discrete‐time sector is done with control‐Lyapunov function. The generalization of nonlinear system is viewed in the perspective of a comparison function. By means of a proposed sector, a switching control is designed such that no control action is experienced inside the sector thus, saving unnecessary control efforts. However, to study the robustness for discrete‐time system, a hands‐off control is modified to ensure the monotonic decrease in the energy of the system. Finally, the proposed approach is verified with the simulation results.     

Sparse control for continuous-time systems

In this survey article, we give a comprehensive review of sparse control for continuous-time systems, called maximum hands-off control. The maximum hands-off control is the optimal control, for which we introduce fundamental properties such as necessary conditions, existence, and equivalence to the optimal control. We also show an efficient numerical computation algorithm for the maximum hands-off control based on the time discretization and ADMM (alternating direction method of multipliers). A numerical example is shown with an available MATLAB program.     

Network‐based robust event‐triggered control for continuous‐time uncertain semi‐Markov jump systems

This article investigates the event‐triggered (ET) states feedback robust control problem for a class of continuous‐time networked semi‐Markov jump systems (S‐MJSs). An ET scheme, which depends on semi‐Markov process, is presented to design a suitable controller and save communication resources. To cope with the network transmission delay phenomenon, a time‐delay S‐MJSs model under the ET scheme is introduced to describe this phenomenon. Then, it is assumed that the communication links between event detector and zero‐order holder are imperfect, where the signal quantization and the actuator fault occur simultaneously. The sufficient conditions are derived by means of linear matrix inequalities approach, which guarantees the stochastic stability of the constructed time‐delay S‐MJSs in an optimized performance level. Based on these criteria, the parameters of controller under the ET scheme are readily calculated. Some simulation results with respect to F‐404 aircraft engine system for two kinds of ET parameters are given to validate the proposed method.     

Stubborn state estimation for nonlinear distributed parameter systems subject to measurement outliers

In this article, the state estimation problem is investigated for a class of distributed parameter systems (DPSs). In order to estimate the state of DPSs, we give a partition of spatial interval with a finite sequence and, on each subinterval, one sensor is placed to receive the measurements from the DPS. Due to the unexpected environment changes, the measurements will probably contain some outliers. To eliminate the effects of the possibly occurring outliers, we construct a stubborn state estimator where the innovation is constrained by a saturation function. By using Lyapunov functional, Wirtinger inequality and piecewise integration, some sufficient conditions are obtained under which the resulting estimation error system is exponentially stable and the performance requirement is satisfied. According to the obtained analysis results, the desired state estimator is designed in terms of the solution to a set of matrix inequalities. Finally, a numerical simulation example is given to verify the effectiveness of the proposed state estimation scheme.     

Fast vision‐based autonomous detection of moving cooperative target for unmanned aerial vehicle landing

We propose a fast and effective method, fast target detection (FTD), to detect the moving cooperative target for the unmanned aerial vehicle landing, and the target is composed of double circles and a cross. The purpose of our strategy is to land on the target. The FTD method needs to detect the target at the high and low heights. At the high height, the target appears completely and stably in the camera field. The FTD method can detect the circle and cross to rapidly reach the target center, named cross and circle–FTD (). To detect the cross, we propose a slope distance equation to obtain the distance between two slopes. The proposed slopes cluster method, based on the distance equation and K‐means, is used to determine the cross center. At the low height, the target appears incompletely and unstably. Therefore, FTD methods detect only the cross, named cross–FTD (). We extract the cross features ( CFs) based on line segments. Then, four CFs are combined based on graph theory. Experiments on our four datasets show that FTD has rapid speed and good performance. (Our method is implemented in C++ and is available at https://github.com/Li-Zhaoxi/UAV-Vision-Servo .) On the Mohamed Bin Zayed International Robotics Challenge datasets made we constructed, detects the target from a image approximately per pipeline with F‐measure and tracks target approximately per pipeline with F‐measure. detects centers from a image at approximately per image with F‐measure.     

Sliding Mode Control for Markovian Jump Systems with Generalized Switching

In this paper, the sliding mode control (SMC) problem for continuous‐time Markovian jump systems (MJSs) is considered, in which the transition rate matrix (TRM) is partially unknown and uncertain. Firstly, the sliding mode surface S(t) = 0 is designed, which is mode‐dependent. Therefore, is used instead of in the SMC algorithm. Via adopting a linear matrix inequality (LMI) approach, sufficient conditions are proposed to ensure that the reduced order system is exponentially stable in mean square. Furthermore, the reduced order system is completely insensitive to the external disturbance. Secondly, SMC law is designed correspondingly which dominated by a Markov process. It could drive the state trajectories onto the specified sliding mode surface in finite time quickly and maintain them on the surface in subsequently time. Thirdly, a new term in will be introduced in the designed SMC and should be handled by a new approach. Finally, a numerical example is provided to show the effectiveness of the proposed method.     

Robust control of the Hill's problem with drag

There are significant advantages associated with the analysis of satellite trajectory control problems in the Hill's analysis framework. As with the circular restricted three‐body problem (CRTBP) equations, the Hill's equations support three‐dimensional “halo” orbits that require station‐keeping control. These orbits are typically in regions of space close to a libration point. In most cases these orbits are unstable, with drag effects introducing uncertain exogenous forces. A two‐degree‐of‐freedom control strategy is used to maintain a pre‐selected orbit and introduce a quantifiable robust stability margin. The control study presented is based on a time‐periodic state feedback law, and a time‐periodic feed‐forward control that is based on a linearized drag model. The efficacy of these ideas is demonstrated by simulation.     

Mixed coordination mechanisms for scheduling games on hierarchical machines

In this paper, we study scheduling games under mixed coordination mechanisms on hierarchical machines. The two scheduling policies involved are ‐ and ‐, where ‐ (resp., ‐) policy sequences jobs in nondecreasing order of their hierarchies, and jobs of the same hierarchy in nonincreasing (resp., nondecreasing) order of their processing times. We first show the existence of a Nash equilibrium. Then we present the price of anarchy and the price of stability for the games with social costs of minimizing the makespan and maximizing the minimum machine load. All the bounds given in this paper are tight.     

Hidden Markov model based filtering for singular semi-Markov jump systems

This article investigates the hidden Markov model based filter design problem for the singular semi-Markov jump systems (SSMJSs). The considered semi-Markov process is a generalization of Markov process, which can eliminate the restriction on the exponential distribution of sojourn time. Besides, the hidden Markov model based filter is introduced to tackle the asynchronous phenomenons occurred between the system modes and filter modes. To ensure the stochastic stability of the SSMJSs and derive solvable filter parameters, a filter design technic is constructed. First, the direct evolution of the states between two arbitrary close time instants is constructed from the filtering error system according to slow-fast decomposition, sufficient conditions are then proposed based on the consistent projector of the filtering error system and the constructed direct state evolution. Second, a new linear decoupling strategy is presented to deal with the coupled terms under the established stability conditions, which further derives the desired hidden Markov model based filter parameters. A numerical example is given to illustrate the effectiveness of the proposed method.     

Observer-based consensus control for multi-agent systems with measurement noises and external disturbances

This study presents a distributed observer-based consensus control for general linear multi-agent systems under measurement noises and external disturbances. By using the state linear transformation with the matrix constructed from the incidence matrix of a virtual chained directed spanning tree, we transform the observer-based consensus problem into an asymptotic stability problem of a corresponding augmented linear system. The augmented linear system consists of the reduced-order system deduced from dynamic equations of the agents and state estimation error system. Based on asymptotic stability of the augmented linear system, we present some sufficient conditions in terms of linear matrix inequalities for the existence of the distributed observer-based consensus controller. Finally, the effectiveness of the proposed approach is illustrated by a numerical example.     

Robust nonfragile observer‐based control of switched discrete singular systems with time‐varying delays: A sliding mode control design

This paper is devoted to the robust sliding mode control issue for a type of switched discrete singular systems with time‐varying delays under arbitrary switching. Since the system states are not available, the nonfragile observer strategy is used to generate the state estimation. By designing a novel sliding surface function, which is established on the estimation, new sufficient conditions via linear matrix inequalities are derived so that the closed‐loop system is admissible with an disturbance attenuation level γ. Furthermore, sliding mode controllers are given to guarantee the reachability of the quasi‐sliding mode and weaken the chattering. At last, examples are presented to verify the validity of our provided approach.     

Constrained shortest path tour problem: models,valid inequalities,and Lagrangian heuristics

The constrained shortest path tour problem (CSPTP) is an NP‐hard combinatorial optimization problem defined on a connected directed graph , where V is the set of nodes and A is the set of nonnegative weighted arcs. Given two distinct nodes , an integer value , and node disjoint subsets , , the CSPTP aims at finding the shortest trail from s to t while visiting at least one node in every subset , in this order. In this paper, we perform a comparative analysis between two integer programming (IP) models for the problem. We also propose valid inequalities and a Lagrangian‐based heuristic framework. Branch‐and‐bound algorithms from the literature, as well as a metaheuristic approach, are used for comparison. Extensive computational experiments carried out on benchmark data sets show the effective use of valid inequalities and the quality of bounds obtained by the Lagrangian framework. Because benchmark instances do not require a great computational effort of IP models in the sense that their optimality is reached at the root node of the CPLEX branch‐and‐cut search tree, we introduce new challenging CSPTP instances for which our solution approaches outperform existing ones for the problem.     

TDBF: Two-dimensional belief function

How to efficiently handle uncertain information is still an open issue. In this paper, a new method to deal with uncertain information, named as two-dimensional belief function (TDBF), is presented. A TDBF has two components, T = (), both and are classical belief functions, while is a measure of reliable of . The definition of TDBF and the discounting algorithm are proposed. Compared with the classical discounting model, the proposed TDBF is more flexible and reasonable. Numerical examples are used to show the efficiency and application of the proposed method.     

Structural Analogy from a Single Image Pair

The task of unsupervised image‐to‐image translation has seen substantial advancements in recent years through the use of deep neural networks. Typically, the proposed solutions learn the characterizing distribution of two large, unpaired collections of images, and are able to alter the appearance of a given image, while keeping its geometry intact. In this paper, we explore the capabilities of neural networks to understand image structure given only a single pair of images, and . We seek to generate images that are structurally aligned: that is, to generate an image that keeps the appearance and style of , but has a structural arrangement that corresponds to . The key idea is to map between image patches at different scales. This enables controlling the granularity at which analogies are produced, which determines the conceptual distinction between style and content. In addition to structural alignment, our method can be used to generate high quality imagery in other conditional generation tasks utilizing images and only: guided image synthesis, style and texture transfer, text translation as well as video translation. Our code and additional results are available in https://github.com/rmokady/structural-analogy/