This paper studies the data-driven finite-time control (FTC) problem of unknown discrete-time linear time-invariant (LTI) systems with unknown and bounded noise. The proposed FTC aims to guarantee that the state of su...
This paper studies the data-driven finite-time control (FTC) problem of unknown discrete-time linear time-invariant (LTI) systems with unknown and bounded noise. The proposed FTC aims to guarantee that the state of such a system does not exceed a given bound over a finite time interval under bounded initial conditions. Data-dependent representations are built for the unknown system without and with noise from pre-collected input/state data, based on which a finite-time controller is designed. Sufficient conditions of finite-time stability/boundness of the closed-loop system without/with noise are derived. Compared with model-based FTC methods that strongly depend on some accurate system models, the proposed method is model-free and only relies on pre-collected data. Numerical simulations are performed to illustrate the effectiveness of the proposed scheme.
Particle Swarm Optimization (PSO) is an optimization method grounded in swarm intelligence, designed to mimic the social behaviors of bird flocks during hunting. By sharing information about their positions, the entir...
详细信息
In this paper, we solve the optimal output regulation problem for discrete-time systems without precise knowledge of the system model. Drawing inspiration from reinforcement learning and adaptive dynamic programming, ...
In this paper, we solve the optimal output regulation problem for discrete-time systems without precise knowledge of the system model. Drawing inspiration from reinforcement learning and adaptive dynamic programming, a data-driven solution is developed that enables asymptotic tracking and disturbance rejection. Notably, it is discovered that the proposed approach for discrete-time output regulation differs from the continuous-time approach in terms of the persistent excitation condition required for policy iteration to be unique and convergent. To address this issue, a new persistent excitation condition is introduced to ensure both uniqueness and convergence of the data-driven policy iteration. The efficacy of the proposed methodology is validated by an inverted pendulum on a cart example.
process industry is the pillar industry of national economy, particularly, the process of producing magnesia by fused magnesia furnace system is a typical category of process industry. Due to the complex smelting mech...
详细信息
Operando monitoring of gelation kinetics and exploring the gelation law are crucial for optimizing the performance of hydrogels. In this paper, we propose a novel superposition sensing structure based on an integrated...
详细信息
In [1] , inaccuracies in several critical equations along with their accompanying descriptions appear in the article. Furthermore, some references are missing, and certain analyses of experiments are flawed.
In [1] , inaccuracies in several critical equations along with their accompanying descriptions appear in the article. Furthermore, some references are missing, and certain analyses of experiments are flawed.
This paper studies the distributed localization problem for mobile sensor networks in the presence of malicious attacks, which manipulate relative measurements to mislead the localization process. Based on the cubatur...
详细信息
In this paper, a novel model-free online Reinforcement Learning (RL) control method is proposed for the real-time overhead crane control problem. The crane control problem is first formulated as an optimal regulation ...
详细信息
ISBN:
(纸本)9781665478977
In this paper, a novel model-free online Reinforcement Learning (RL) control method is proposed for the real-time overhead crane control problem. The crane control problem is first formulated as an optimal regulation problem with a user-specified objective function. Two neural-networks, namely Actor-Critic networks, are employed to approximate the objective function and the optimal control policy respectively. Then, an improved network updating rule with an additional passivity-based stabilization term is developed to remove the requirement of the initial stabilizing control policy. Unlike other crane control approaches, the proposed online RL algorithm does not rely on prior knowledge of the overhead crane mathematical model. Finally, simulation studies are carried out to demonstrate the effectiveness of the proposed method in the presence of system parameter variations when compared to LQR control.
In this paper, we have proposed a resilient reinforcement learning method for discrete-time linear systems with unknown parameters, under denial-of-service (DoS) attacks. The proposed method is based on policy iterati...
详细信息
Binary optimization assumes a pervasive significance in the context of practical applications, such as knapsack problems, maximum cut problems, and critical node detection problems. Existing techniques including mathe...
详细信息
Binary optimization assumes a pervasive significance in the context of practical applications, such as knapsack problems, maximum cut problems, and critical node detection problems. Existing techniques including mathematical programming, heuristics, evolutionary computation, and neural networks have been employed to tackle binary optimization problems (BOPs), however, they grapple with the challenge of optimizing a large number of binary variables. In this paper, we propose a dimensionality reduction method to assist evolutionary algorithms in solving large-scale BOPs, which is achieved based on neural networks. The proposed method converts the optimization of a large number of binary variables into the optimization of a small number of network weights, resulting in a significant reduction in search space dimensionality. Crucially, the proposed method obviates the necessity for a training process, which eliminates the requirement for a priori knowledge and enhances the search efficiency. On six types of single-and multi-objective BOPs with up to 10 000 000 variables, the proposed method demonstrates superiority over top-tier evolutionary algorithms and neural network-based methods. IEEE
暂无评论