检索结果-内蒙古大学图书馆

Toolbox for Discovering Dynamic System Relations via TAG Guided Genetic Programming

学校读者我要写书评

暂无评论

IFAC-PapersOnLine 2021年第7期54卷 379-384页

作者： Ştefan-Cristian Nechita Roland Tóth Dhruv Khandelwal Maarten Schoukens Department of Electrical Engineering Eindhoven University of Technology Eindhoven University of Technology Eindhoven The Netherlands Systems and Control Laboratory Institute for Computer Science and Control Kende u. 13-17 H-1111 Budapest Hungary

Data-driven modeling of nonlinear dynamical systems often requires an expert user to take critical decisions a priori to the identification procedure. Recently, an automated strategy for data driven modeling of single-input single-output (SISO) nonlinear dynamical systems based on genetic programming (GP) and tree adjoining grammars (TAG) was introduced. The current paper extends these latest findings by proposing a multi-input multi-output (MIMO) TAG modeling framework for polynomial NARMAX models. Moreover, we introduce a TAG identification toolbox in Matlab that provides implementation of the proposed methodology to solve multi-input multi-output identification problems under NARMAX noise assumption. The capabilities of the toolbox and the modeling methodology are demonstrated in the identification of two SISO and one MIMO nonlinear dynamical benchmark models.

关键词： Nonlinear system identification Equation discovery Tree Adjoining Grammar Genetic Programming Data-driven system modeling

Short - Term Prediction of Coke Pushing Current Peak Based on Improved ARIMA Model

学校读者我要写书评

暂无评论

Short - Term Prediction of Coke Pushing Current Peak Based o...

Industrial Cyber-Physical systems (ICPS)

作者： Haiyang Wei Luefeng Chen Jie Hu Yi Ren Min Wu Witold Pedrycz Kaoru Hirota School of Automation China University of Geosciences Wuhan China Hubei Key Laboratory of Advanced Control and Intelligent Automation for Complex Systems Wuhan China Engineering Research Center of Intelligent Technology for Geo-Exploration Ministry of Education Wuhan China Department of Electrical and Computer Engineering University of Alberta Edmonton Canada Tokyo Institute of Technology Yokohama Japan

Coke pushing current is an indicator to evaluate the difficulty of coke pushing operation. The higher coke pushing current is, the greater coke pushing resistance is, and the more difficult coke is to push out. Accurate prediction of current peak during future coke pushing operation can provide more time for production personnel to adjust production status and avoid difficult coke pushing in carbonization chamber. In this paper, a combination prediction model based on VMD (Variational Mode Decomposition) and improved ARIMA (Autoregressive Integrated Moving Average) models is proposed. Firstly, VMD algorithm is used to decompose time series of coke pushing current peak, de-noising data, and extracting main information of time series. Then, ARIMA model is used to predict mean change of linear elasticity and GARCH (Generalized Autore-gressive Conditional Heteroskedasticity) model is introduced to predict ARIMA model residual and improve heteroscedasticity of nonlinear part of time series, and then ARIMA-GARCH model is established. Finally, predicted value is obtained by the sum of each component prediction. The experimental results show that the proposed prediction model has a high prediction accuracy in the short-term prediction of coke pushing current peak. The scheme is applied to actual coking production to guide production of coke.

关键词： Resistance Ovens Time series analysis Noise reduction Production Predictive models Prediction algorithms

Distributed Online Convex Optimization with Adversarial Constraints: Reduced Cumulative Constraint Violation Bounds under Slater’s Condition

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Yi, Xinlei Li, Xiuxian Yang, Tao Xie, Lihua Hong, Yiguang Chai, Tianyou Johansson, Karl H. Lab for Information & Decision Systems Massachusetts Institute of Technology CambridgeMA02139 United States Department of Control Science and Engineering College of Electronics and Information Engineering Tongji University Shanghai201804 China Shanghai Research Institute for Intelligent Autonomous Systems China The State Key Laboratory of Synthetical Automation for Process Industries Northeastern University Shenyang110819 China School of Electrical and Electronic Engineering Nanyang Technological University 50 Nanyang Avenue Singapore639798 Singapore Division of Decision and Control Systems School of Electrical Engineering and Computer Science KTH Royal Institute of Technology Sweden Digital Futures Stockholm10044 Sweden

This paper considers distributed online convex optimization with adversarial constraints. In this setting, a network of agents makes decisions at each round, and then only a portion of the loss function and a coordinate block of the constraint function are privately revealed to each agent. The loss and constraint functions are convex and can vary arbitrarily across rounds. The agents collaborate to minimize network regret and cumulative constraint violation. A novel distributed online algorithm is proposed and it achieves an O(T max{c,1−c}) network regret bound and an O(T 1−c/2) network cumulative constraint violation bound, where T is the number of rounds and c ∈ (0, 1) is a user-defined trade-off parameter. When Slater’s condition holds (i.e, there is a point that strictly satisfies the inequality constraints), the network cumulative constraint violation bound is reduced to O(T 1−c). Moreover, if the loss functions are strongly convex, then the network regret bound is reduced to O(log(T)), and the network cumulative constraint violation bound is reduced to O(√log(T)T) and O(log(T)) without and with Slater’s condition, respectively. To the best of our knowledge, this paper is the first to achieve reduced (network) cumulative constraint violation bounds for (distributed) online convex optimization with adversarial constraints under Slater’s condition. Finally, the theoretical results are verified through numerical simulations. Copyright © 2023, The Authors. All rights reserved.

关键词： Economic and social effects

Active Simultaneously Transmitting and Reflecting Surface Assisted NOMA Networks

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Yue, Xinwei Xie, Jin Ouyang, Chongjun Liu, Yuanwei Shen, Xia Ding, Zhiguo The Key Laboratory of Information and Communication Systems Ministry of Information Industry Beijing Information Science and Technology University Beijing100101 China The Key Laboratory of Modern Measurement & Control Technology Ministry of Education Beijing Information Science and Technology University Beijing100101 China The School of Information and Communication Engineering Beijing University of Posts and Telecommunications Beijing100876 China The School of Electronic Engineering and Computer Science Queen Mary University of London LondonE1 4NS United Kingdom Beijing100191 China The Department of Electrical Engineering and Computer Science Khalifa University Abu Dhabi United Arab Emirates Department of Electrical Engineering Princeton University Princeton United States

The novel active simultaneously transmitting and reflecting surface (ASTARS) has recently received a lot of attention due to its capability to conquer the multiplicative fading loss and achieve full-space smart radio environments. This paper introduces the ASTARS to assist non-orthogonal multiple access (NOMA) communications, where the stochastic geometry theory is used to model the spatial positions of pairing users. We design the independent reflection/transmission phase-shift controllers of ASTARS to align the phases of cascaded channels at pairing users. We derive new closed-form and asymptotic expressions of the outage probability and ergodic data rate for ASTARS-NOMA networks in the presence of perfect/imperfect successive interference cancellation (pSIC). The diversity orders and multiplexing gains for ASTARS-NOMA are derived to provide more insights. Furthermore, the system throughputs of ASTARS-NOMA are investigated in both delay-tolerant and delay-limited transmission modes. The numerical results are presented and show that: 1) ASTARS-NOMA with pSIC outperforms ASTARS assisted-orthogonal multiple access (ASTARS-OMA) in terms of outage probability and ergodic data rate;2) The outage probability of ASTARS-NOMA can be further reduced within a certain range by increasing the power amplification factors;3) The system throughputs of ASTARS-NOMA are superior to that of ASTARS-OMA in both delay-limited and delay-tolerant transmission modes. Copyright © 2024, The Authors. All rights reserved.

关键词： Stochastic systems

Topological entropy of switched nonlinear and interconnected systems

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Yang, Guosong Liberzon, Daniel Hespanha, João P. The Department of Electrical and Computer Engineering Rutgers University PiscatawayNJ08854 United States The Coordinated Science Laboratory University of Illinois Urbana-Champaign UrbanaIL61801 United States The Center for Control Dynamical Systems and Computation University of California Santa Barbara Santa BarbaraCA93106 United States

A general upper bound for topological entropy of switched nonlinear systems is constructed, using an asymptotic average of upper limits of the matrix measures of Jacobian matrices of strongly persistent individual modes, weighted by their active rates. A general lower bound is constructed as well, using a similar weighted average of lower limits of the traces of these Jacobian matrices. In a case of interconnected structure, the general upper bound is readily applied to derive upper bounds for entropy that depend only on "network-level" information. In a case of block-diagonal structure, less conservative upper and lower bounds for entropy are constructed. In each case, upper bounds for entropy that require less information about the switching signal are also derived. The upper bounds for entropy and their relations are illustrated by numerical examples of a switched Lotka–Volterra ecosystem *** Codes 37B40, 93C30 (Primary) 93C57 (Secondary) © 2023, CC BY-NC-ND.

关键词： Jacobian matrices

Dexterous Manipulation through Imitation Learning: A Survey

学校读者我要写书评

暂无评论

arXiv 2025年

作者： An, Shan Meng, Ziyu Tang, Chao Zhou, Yuning Liu, Tengyu Ding, Fangqiang Zhang, Shufang Mu, Yao Song, Ran Zhang, Wei Hou, Zeng-Guang Zhang, Hong School of Electrical and Information Engineering Tianjin University Tianjin300072 China School of Control Science and Engineering Shandong University Jinan250061 China State Key Laboratory of General Artificial Intelligence Beijing100086 China Department of Mechanical and Process Engineering ETH Zurich Zurich8092 Switzerland Department of Electronic and Electrical Engineering Southern University of Science and Technology Shenzhen518055 China School of Informatics University of Edinburgh EH8 9AB United Kingdom Department of Computer Science University of Hong Kong 999077 Hong Kong State Key Laboratory of Multimodal Artificial Intelligence Systems Institute of Automation Chinese Academy of Sciences Beijing100190 China School of Artificial Intelligence University of Chinese Academy of Sciences Beijing100049 China CASIA-MUST Joint Laboratory of Intelligence Science and Technology Institute of Systems Engineering Macau University of Science and Technology 999078 China

Dexterous manipulation, which refers to the ability of a robotic hand or multi-fingered end-effector to skillfully control, reorient, and manipulate objects through precise, coordinated finger movements and adaptive force modulation, enables complex interactions similar to human hand dexterity. With recent advances in robotics and machine learning, there is a growing demand for these systems to operate in complex and unstructured environments. Traditional model-based approaches struggle to generalize across tasks and object variations due to the high-dimensionality and complex contact dynamics of dexterous manipulation. Although model-free methods such as reinforcement learning (RL) show promise, they require extensive training, large-scale interaction data, and carefully designed rewards for stability and effectiveness. Imitation learning (IL) offers an alternative by allowing robots to acquire dexterous manipulation skills directly from expert demonstrations, capturing fine-grained coordination and contact dynamics while bypassing the need for explicit modeling and large-scale trial-and-error. This survey provides an overview of dexterous manipulation methods based on imitation learning (IL), details recent advances, and addresses key challenges in the field. Additionally, it explores potential research directions to enhance IL-driven dexterous manipulation. Our goal is to offer researchers and practitioners a comprehensive introduction to this rapidly evolving domain. Copyright © 2025, The Authors. All rights reserved.

关键词： Grippers

Empirical Risk Minimization with Relative Entropy Regularization: Optimality and Sensitivity Analysis

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Perlaza, Samir M. Bisson, Gaetan Esnaola, Iñaki Jean-Marie, Alain Rini, Stefano INRIA 2004 Route des Lucioles Sophia Antipolis06902 France The Laboratoire de Mathématiques GAATI Université de la Polynésie Française BP 6570 Faaa98702 French Polynesia The Department of Automatic Control and Systems Engineering University of Sheffield Sheffield United Kingdom The Department of Electrical and Computer Engineering National Chao Tung University Hsinchu Taiwan The Department of Electrical and Computer Engineering Princeton University PrincetonNJ08544 United States

The optimality and sensitivity of the empirical risk minimization problem with relative entropy regularization (ERM-RER) are investigated for the case in which the reference is a σ-finite measure instead of a probability measure. This generalization allows for a larger degree of flexibility in the incorporation of prior knowledge over the set of models. In this setting, the interplay of the regularization parameter, the reference measure, the risk function, and the empirical risk induced by the solution of the ERM-RER problem is characterized. This characterization yields necessary and sufficient conditions for the existence of regularization parameters that achieve arbitrarily small empirical risk with arbitrarily high probability. Additionally, the sensitivity of the expected empirical risk to deviations from the solution of the ERM-RER problem is studied. Dataset-dependent and dataset-independent upper bounds on the absolute value of the sensitivity are presented. In a special case, it is shown that the expectation (with respect to the datasets) of the absolute value of the sensitivity is upper bounded, up to a constant factor, by the square root of the lautum information between the models and the datasets. © 2022, CC BY.

关键词： Sensitivity analysis

Performance Investigation of Instantaneous Reactive Power control for 5 Level-Neutral Point Clamped Grid-Connected Photovoltaic Inverter

学校读者我要写书评

暂无评论

Performance Investigation of Instantaneous Reactive Power Co...

electrical engineering and automatic control (ICEEAC), International Conference on

作者： Oumaymah Elamri Alla Eddine Toubal Maamar Charaf Chermite Moulay Rachid Douiri Mostefa Kermadi Saad Mekhilef LAMIGEP multidisciplinary research laboratory École Marocaine des Sciences de l'Ingénieur (EMSI) of Marrakech Marrakech Morocco Department of Electrical Systems Engineering Faculty of Technology University of M'hamed Bougara of Boumerdes Boumerdes Algeria Physics Department Control and Computer Science for Intelligent Systems and Green Energy Faculty of Science and Technology Cadi Ayyad University Marrakech Morocco School of Engineering University of Leicester Leicester United Kingdom Power Electronics and Renewable Energy Research Laboratory (PEARL) Kuala Lumpur Malaysia Swinburne University of Technology Hawthorn Vic Australia

ISBN: (数字)9798350349740

ISBN: (纸本)9798350349757

The utilization of solar energy in grid-connected photovoltaic installations has become increasingly significant. This article introduces a photovoltaic system seamlessly integrated with a three-phase network. The system employing a five-level Neutral Point Clamped (NPC) voltage source inverter is designed for a single-step connection to enhance power quality in the distribution network. The control technique employed for the efficient functioning of the photovoltaic system is based on the notion of instantaneous reactive power. Notably, this strategy is straightforward, operates the system throughout the day, and eliminates the need for Phase-Locked Loop (PLL) usage. The Pulse-Width Modulated (PWM) Current controller sends switching signals to the NPC multilevel inverter, which does a great job of dynamic performance under steady-state and transient situations. The proportional-integral controller regulates the voltage of the Uninterruptible Power Supply DC bus capacitors. The proposed system undergoes comprehensive simulation validation under various irradiation levels.

关键词： Photovoltaic systems Reactive power Voltage source inverters Switches Solar energy Steady-state Transient analysis

SPP-CNN: An Efficient Framework for Network Robustness Prediction

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Wu, Chengpei Lou, Yang Wang, Lin Li, Junli Li, Xiang Chen, Guanrong The College of Computer Science Sichuan Normal University Chengdu610066 China The Key Laboratory of System Control and Information Processing Ministry of Education Shanghai200240 China The Department of Computer Science National Yang Ming Chiao Tung University Hsinchu300 Taiwan The Department of Automation Shanghai Jiao Tong University Shanghai200240 China The Institute of Complex Networks and Intelligent Systems Shanghai Research Institute for Intelligent Autonomous Systems Tongji University Shanghai201210 China The Department of Control Science and Engineering Tongji University Shanghai200240 China The Department of Electrical Engineering City University of Hong Kong Hong Kong

This paper addresses the robustness of a network to sustain its connectivity and controllability against malicious attacks. This kind of network robustness is typically measured by the time-consuming attack simulation, which returns a sequence of values that record the remaining connectivity and controllability after a sequence of node- or edge-removal attacks. For improvement, this paper develops an efficient framework for network robustness prediction, the spatial pyramid pooling convolutional neural network (SPP-CNN). The new framework installs a spatial pyramid pooling layer between the convolutional and fully-connected layers, overcoming the common mismatch issue in the CNN-based prediction approaches and extending its generalizability. Extensive experiments are carried out by comparing SPP-CNN with three state-of-the-art robustness predictors, namely a CNN-based and two graph neural networks-based frameworks. Synthetic and real-world networks, both directed and undirected, are investigated. Experimental results demonstrate that the proposed SPP-CNN achieves better prediction performances and better generalizability to unknown datasets, with significantly lower time-consumption, than its counterparts. © 2023, CC BY.

关键词： Complex networks