Cascade controllers design based on model matching in frequency domain for stable and integrating processes with time delay

Purpose This paper aims to present an efficient and simplified proportional-integral/proportional-integral and derivative controller design method for the higher-order stable and integrating processes with time delay in the cascade control structure (CCS). Design/methodology/approach Two approaches based on model matching in the frequency domain have been proposed for tuning the controllers of the CCS. The first approach is based on achieving the desired load disturbance rejection performance, whereas the second approach is proposed to achieve the desired setpoint performance. In both the approaches, matching between the desired model and the closed-loop system with the controller is done at a low-frequency point. Model matching at low-frequency points yields a linear algebraic equation and the solution to these equations yields the controller parameters. Findings Simulations have been conducted on several examples covering high order stable, integrating, double integrating processes with time delay and nonlinear continuous stirred tank reactor. The performance of the proposed scheme has been compared with recently reported work having modified cascade control configurations, sliding mode control, model predictive control and fractional order control. The performance of both the proposed schemes is either better or comparable with the recently reported methods. However, the proposed method based on desired load disturbance rejection performance outperforms among all these schemes. Originality/value The main advantages of the proposed approaches are that they are directly applicable to any order processes, as they are free from time delay approximation and plant order reduction. In addition to this, the proposed schemes are capable of handling a wide range of different dynamical processes in a unified way.

Quingo: A Programming Framework for Heterogeneous Quantum-Classical Computing with NISQ Features

The increasing control complexity of Noisy Intermediate-Scale Quantum (NISQ) systems underlines the necessity of integrating quantum hardware with quantum software. While mapping heterogeneous quantum-classical computing (HQCC) algorithms to NISQ hardware for execution, we observed a few dissatisfactions in quantum programming languages (QPLs), including difficult mapping to hardware, limited expressiveness, and counter-intuitive code. In addition, noisy qubits require repeatedly performed quantum experiments, which explicitly operate low-level configurations, such as pulses and timing of operations. This requirement is beyond the scope or capability of most existing QPLs. We summarize three execution models to depict the quantum-classical interaction of existing QPLs. Based on the refined HQCC model, we propose the Quingo framework to integrate and manage quantum-classical software and hardware to provide the programmability over HQCC applications and map them to NISQ hardware. We propose a six-phase quantum program life-cycle model matching the refined HQCC model, which is implemented by a runtime system. We also propose the Quingo programming language, an external domain-specific language highlighting timer-based timing control and opaque operation definition, which can be used to describe quantum experiments. We believe the Quingo framework could contribute to the clarification of key techniques in the design of future HQCC systems.

Automatic verification method of progressive image model matching information based on machine learning

In order to solve the problems of large error and low performance of traditional progressive image model matching information checking methods, an automatic progressive image model matching information checking method based on machine learning is proposed. The generation method of progressive image is analyzed, and the target image sample is obtained. On this basis, machine learning algorithm is used to segment progressive image samples. In each image segmentation part, crawler technology is used to automatically collect progressive image model matching information, and under the constraint of image model matching information checking standard, automatic checking of progressive image model matching information is realized from geometric structure, image content and other aspects. Experimental results show that the verification error of the design method is reduced by 0.687 Mb, and the quality of progressive image is improved.

MFmap: A semi-supervised generative model matching cell lines to tumours and cancer subtypes

Translating in vitro results from experiments with cancer cell lines to clinical applications requires the selection of appropriate cell line models. Here we present MFmap (model fidelity map), a machine learning model to simultaneously predict the cancer subtype of a cell line and its similarity to an individual tumour sample. The MFmap is a semi-supervised generative model, which compresses high dimensional gene expression, copy number variation and mutation data into cancer subtype informed low dimensional latent representations. The accuracy (test set F1 score >90%) of the MFmap subtype prediction is validated in ten different cancer datasets. We use breast cancer and glioblastoma cohorts as examples to show how subtype specific drug sensitivity can be translated to individual tumour samples. The low dimensional latent representations extracted by MFmap explain known and novel subtype specific features and enable the analysis of cell-state transformations between different subtypes. From a methodological perspective, we report that MFmap is a semi-supervised method which simultaneously achieves good generative and predictive performance and thus opens opportunities in other areas of computational biology.

Regularization, Bayesian Inference, and Machine Learning Methods for Inverse Problems

Classical methods for inverse problems are mainly based on regularization theory, in particular those, that are based on optimization of a criterion with two parts: a data-model matching and a regularization term. Different choices for these two terms and a great number of optimization algorithms have been proposed. When these two terms are distance or divergence measures, they can have a Bayesian Maximum A Posteriori (MAP) interpretation where these two terms correspond to the likelihood and prior-probability models, respectively. The Bayesian approach gives more flexibility in choosing these terms and, in particular, the prior term via hierarchical models and hidden variables. However, the Bayesian computations can become very heavy computationally. The machine learning (ML) methods such as classification, clustering, segmentation, and regression, based on neural networks (NN) and particularly convolutional NN, deep NN, physics-informed neural networks, etc. can become helpful to obtain approximate practical solutions to inverse problems. In this tutorial article, particular examples of image denoising, image restoration, and computed-tomography (CT) image reconstruction will illustrate this cooperation between ML and inversion.

Robust Control Design for Autonomous Vehicles Using Neural Network-Based Model-Matching Approach

In this paper, a novel neural network-based robust control method is presented for a vehicle-oriented problem, in which the main goal is to ensure stable motion of the vehicle under critical circumstances. The proposed method can be divided into two main steps. In the first step, the model matching algorithm is proposed, which can adjust the nonlinear dynamics of the controlled system to a nominal, linear model. The aim of model matching is to eliminate the effects of the nonlinearities and uncertainties of the system to increase the performances of the closed-loop system. The model matching process results in an additional control input, which is computed by a neural network during the operation of the control system. Furthermore, in the second step, a robust H∞ is designed, which has double purposes: to handle the fitting error of the neural network and ensure the accurate tracking of the reference signal. The operation and efficiency of the proposed control algorithm are investigated through a complex test scenario, which is performed in the high-fidelity vehicle dynamics simulation software, CarMaker.

Regularization, Bayesian Inference and Machine Learning methods for Inverse Problems†

Classical methods for inverse problems are mainly based on regularization theory. In particular those which are based on optimization of a criterion with two parts: a data-model matching and a regularization term. Different choices for these two terms and great number of optimization algorithms have been proposed. When these two terms are distance or divergence measures, they can have a Bayesian Maximum A Posteriori (MAP) interpretation where these two terms correspond, respectively, to the likelihood and prior probability models.