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

Evolutionary Optimization Methods for High-Dimensional Expensive Problems:A Survey

IEEE/CAA Journal of Automatica Sinica 2024年第5期11卷 1092-1105页

作者： MengChu Zhou Meiji Cui Dian Xu Shuwei Zhu Ziyan Zhao Abdullah Abusorrah Department of Electrical and Computer Engineering New Jersey Institute of TechnologyNewarkNJ 07102 USA School of Information and Electronic Engineering Zhejiang Gongshang UniversityHangzhou 310018China School of Intelligent Manufacturing Nanjing University of Science and TechnologyNanjing 210094China Institute of Systems Engineering Macao University of Science and TechnologyMacao 999078China School of Artificial Intelligence and Computer Jiangnan UniversityWuxi 214122China School of Information Science and Engineering Northeastern UniversityShenyang 110819China Center of Research Excellence in Renewable Energy and Power Systems Department of Electrical and Computer EngineeringFaculty of EngineeringKing Abdulaziz UniversityJeddah 21589Saudi Arabia K.A.CARE Energy Research and Innovation Center King Abdulaziz UniversityJeddah 21589Saudi Arabia

Evolutionary computation is a rapidly evolving field and the related algorithms have been successfully used to solve various real-world optimization *** past decade has also witnessed their fast progress to solve a class of challenging optimization problems called high-dimensional expensive problems(HEPs).The evaluation of their objective fitness requires expensive resource due to their use of time-consuming physical experiments or computer ***,it is hard to traverse the huge search space within reasonable resource as problem dimension *** evolutionary algorithms(EAs)tend to fail to solve HEPs competently because they need to conduct many such expensive evaluations before achieving satisfactory *** reduce such evaluations,many novel surrogate-assisted algorithms emerge to cope with HEPs in recent *** there lacks a thorough review of the state of the art in this specific and important *** paper provides a comprehensive survey of these evolutionary algorithms for *** start with a brief introduction to the research status and the basic concepts of ***,we present surrogate-assisted evolutionary algorithms for HEPs from four main *** also give comparative results of some representative algorithms and application ***,we indicate open challenges and several promising directions to advance the progress in evolutionary optimization algorithms for HEPs.

关键词： computer optimization evolutionary

来源：评论

学校读者我要写书评

暂无评论

Fractional Order Differential Evolution

引用

IEEE Transactions on Evolutionary Computation 2024年第3期29卷 1-1页

作者： Wang, Kaiyu Gao, Shangce Zhou, MengChu Zhan, Zhi-Hui Cheng, Jiujun Faculty of Engineering University of Toyama Toyama-shi Japan Department of Electrical and Computer Engineering New Jersey Institute of Technology Newark NJ USA College of Artificial Intelligence Nankai University Tianjin China Ministry of Education Key Laboratory of Embedded System and Service Computing Tongji University Shanghai China

Differential evolution (DE) is a widely recognized method to solve complex optimization problems as shown by many researchers. Yet, non-adaptive versions of DE suffer from insufficient exploration ability and uses no historical information for its performance enhancement. This work proposes Fractional Order Differential Evolution (FODE) to enhance DE performance from two aspects. Firstly, a bi-strategy co-deployment framework is proposed. The population-based and parameter-based strategies are combined to leverage their respective advantages. Secondly, the fractional order calculus is first applied to the differential vector to enhance DE’s exploration ability by using the historical information of populations, and ensures the diversity of population in an evolutionary process. We use the 2017 IEEE Congress on Evolutionary Computation (CEC) test functions, and CEC2011 real-world problems to evaluate FODE’s performance. Its sensitivity to parameter changes is discussed and an ablation study of multi-strategies is systematically performed. Furthermore, the variations of exploration and exploitation in FODE are visualized and analyzed. Experimental results show that FODE is superior to other state-of-the-art DE variants, the winners of CEC competitions, other fractional order calculus-based algorithms, and some powerful variants of classic algorithms. IEEE

关键词： Particle swarm optimization (PSO)

来源：评论

学校读者我要写书评

暂无评论

Building Consensus in Group Decision-Making with Intuitionistic Reciprocal Preference Relations: An Analysis of Various Protocols of Information Granularity Distribution

Building Consensus in Group Decision-Making with Intuitionis...

引用

2024 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2024

作者： Gonzalez-Quesada, Juan Carlos Cabrerizo, Francisco Javier Herrera-Viedma, Enrique Pedrycz, Witold Andalusian Research Institute in Data Science and Computational Intelligence DaSCI University of Granada Department of Computer Science and Artificial Intelligence Granada18071 Spain University of Alberta Department of Electrical & Computer Engineering EdmontonABT6R 2V4 Canada

ISBN: (纸本)9781665410205

On the one hand, to model experts' preferences in group decision-making, intuitionistic reciprocal preference relations have widely been used because they allow for accommodating hesitation degrees, which are inherent to all decision-making processes. On the other hand, an optimization of information granularity distribution has recently been applied to establish consensus during group decision-making processes. Concretely, a symmetric and uniform distribution of information granularity has been considered for intuitionistic reciprocal preference relations. However, there exist other protocols of information granularity distribution that could be used. Therefore, we aim to analyze all the information granularity distribution protocols and determine their effectiveness in building consensus through intuitionistic reciprocal preference relations. The performance of the different protocols is discussed by conducting some numerical experiments that help provide insights into the effectiveness of the protocols to build consensus. © 2024 IEEE.

关键词： Information granules

来源：评论

学校读者我要写书评

暂无评论

Continuous-Time Prediction of Industrial Paste Thickener System With Differential ODE-Net

引用

IEEE/CAA Journal of Automatica Sinica 2022年第4期9卷 686-698页

作者： Zhaolin Yuan Xiaorui Li Di Wu Xiaojuan Ban Nai-Qi Wu Hong-Ning Dai Hao Wang the Beijing Advanced Innovation Center for Materials Genome Engineering Institute of Artificial IntelligenceBeijing Key Laboratory of Knowledge Engineering for Materials ScienceSchool of Computer and Communication EngineeringUniversity of Science and Technology Beijing the Department of ICT and Natural Science Norwegian University of Science and Technology IEEE the Institute of Systems Engineering and Collaborative Laboratory for Intelligent Science and SystemsMacao University of Science and Technology the Department of Computing and Decision Sciences Lingnan University the Department of Computer Science Norwegian University of Science and Technology

It is crucial to predict the outputs of a thickening system,including the underflow concentration(UC)and mud pressure,for optimal control of the *** proliferation of industrial sensors and the availability of thickening-system data make this ***,the unique properties of thickening systems,such as the non-linearities,long-time delays,partially observed data,and continuous time evolution pose challenges on building data-driven predictive *** address the above challenges,we establish an integrated,deep-learning,continuous time network structure that consists of a sequential encoder,a state decoder,and a derivative module to learn the deterministic state space model from thickening *** a case study,we examine our methods with a tailing thickener manufactured by the FLSmidth installed with massive sensors and obtain extensive experimental *** results demonstrate that the proposed continuous-time model with the sequential encoder achieves better prediction performances than the existing discrete-time models and reduces the negative effects from long time delays by extracting features from historical system *** proposed method also demonstrates outstanding performances for both short and long term prediction tasks with the two proposed derivative types.

关键词： Industrial 24 paste thickener ordinary differential equation(ODE)-net recurrent neural network time series prediction

来源：评论

学校读者我要写书评

暂无评论

Scalable Multi-Agent Reinforcement Learning for Residential Load Scheduling Under Data Governance

IEEE Transactions on Industrial Cyber-Physical Systems

引用

IEEE Transactions on Industrial Cyber-Physical Systems 2025年 3卷 351-361页

作者： Qin, Zhaoming Dong, Nanqing Liu, Di Wang, Zhefan Cao, Junwei EPFL Automatic Control Laboratory Lausanne1015 Switzerland Shanghai Artificial Intelligence Laboratory Shanghai200232 China Tsinghua University Department of Electrical Engineering Beijing100084 China Tsinghua University Beijing National Research Center for Information Science and Technology Beijing100084 China

As a data-driven approach, multi-agent reinforcement learning (MARL) has made remarkable advances in solving cooperative residential load scheduling problems. However, centralized training, the most common paradigm for MARL, limits large-scale deployment in communication-constrained cloud-edge environments. As a remedy, distributed training shows unparalleled advantages in real-world applications but still faces challenge with system scalability, e.g., the high cost of communication overhead during coordinating individual agents, and needs to comply with data governance in terms of privacy. In this work, we propose a novel MARL solution to address these two practical issues. Our proposed approach is based on actor-critic methods, where the global critic is a learned function of individual critics computed solely based on local observations of households. This scheme preserves household privacy completely and significantly reduces communication cost. Simulation experiments demonstrate that the proposed framework achieves comparable performance to the state-of-the-art actor-critic framework without data governance and communication constraints. © 2023 IEEE.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Discounted Iterative Adaptive Critic Designs With Novel Stability Analysis for Tracking Control

引用

IEEE/CAA Journal of Automatica Sinica 2022年第7期9卷 1262-1272页

作者： Mingming Ha Ding Wang Derong Liu School of Automation and Electrical Engineering University of Science and Technology BeijingBeijing 100083China Faculty of Information Technology the Beijing Key Laboratory of Computational Intelligence and Intelligent Systemthe Beijing Laboratory of Smart Environmental Protectionand the Beijing Institute of Artificial IntelligenceBeijing University of TechnologyBeijing 100124China Department of Electrical and Computer Engineering University of Illinois at ChicagoChicago IL 60607 USA IEEE

The core task of tracking control is to make the controlled plant track a desired *** traditional performance index used in previous studies cannot eliminate completely the tracking error as the number of time steps *** this paper,a new cost function is introduced to develop the value-iteration-based adaptive critic framework to solve the tracking control *** the regulator problem,the iterative value function of tracking control problem cannot be regarded as a Lyapunov function.A novel stability analysis method is developed to guarantee that the tracking error converges to *** discounted iterative scheme under the new cost function for the special case of linear systems is ***,the tracking performance of the present scheme is demonstrated by numerical results and compared with those of the traditional approaches.

关键词： Adaptive critic design adaptive dynamic programming(ADP) approximate dynamic programming discrete-time nonlinear systems reinforcement learning stability analysis tracking control value iteration(VI)

来源：评论

学校读者我要写书评

暂无评论

Adaptive Robust Control Integrated With Gaussian Processes for Quadrotors: Enhanced Accuracy, Fault Tolerance and Anti-Disturbance

引用

IEEE Transactions on Systems, Man, and Cybernetics: Systems 2025年第5期55卷 3235-3248页

作者： Liang, Weisheng Amer, Abdelhakim Mehndiratta, Mohit Chen, Zheng Yao, Bin Kayacan, Erdal Zhejiang University State Key Laboratory of Fluid Power and Mechatronic Systems Hangzhou310027 China Aarhus University Artificial Intelligence in Robotics Laboratory Department of Electrical and Computer Engineering Aarhus8000 Denmark GIM Robotics Espoo02650 Finland Zhejiang University Ocean College Ocean Research Center of Zhoushan Zhoushan316021 China Purdue University School of Mechanical Engineering West Lafayette47907 United States Department of Electrical Engineering and Information Technology Paderborn33098 Germany

With increasingly challenging applications for quadrotors, higher requirements are emerging for tracking accuracy and safety. While high accuracy is a prerequisite for complex tasks, safety is ensured through tolerance to actuator faults and resistance to external disturbances. In this article, adaptive robust control (ARC) integrated with Gaussian processes (GPs), i.e., ARC-GP, is proposed to achieve enhanced accuracy, fault tolerance, and anti-disturbance. These three requirements are interrelated and affected by uncertainties. The primary idea of this article is to categorize uncertainties into parametric and nonparametric types, which are then addressed through parameter adaptation and GP, respectively. First, a detailed dynamic model is established, including actuator models that reflect different types of faults corresponding to changes in different physical parameters. Then, parameter adaptation is designed, with direct and indirect methods adopted for different parameters. In particular, the actuator parameters are effectively estimated to achieve targeted fault compensation. Regarding GP for nonparametric uncertainties, its model parameters are also updated via parameter adaptation. The GP thereby also learns parameter estimation errors along with external disturbances. Accordingly, ARC controllers are designed, for which robust feedback terms are constructed to further mitigate uncertainties on the basis of the covariances predicted by GP. The experiments demonstrate that the proposed ARC-GP can actively tolerate various types of actuator faults and better resist wind disturbances. © 2013 IEEE.

关键词： Robust control

来源：评论

学校读者我要写书评

暂无评论

GRU-Based Winner Subcarrier Detection in Frequency Domain Contention 24

GRU-Based Winner Subcarrier Detection in Frequency Domain Co...

引用

7th International Conference on Information science and Systems, ICISS 2024

作者： Yao, Shumin Zhao, Qinglin Xu, Zezhou Feng, Li Li, Guanghui Tian, Liwei Sun, Yi School of Computer Science and Engineering Macau University of Science and Technology China Department of Broadband Communication Pengcheng Laboratory China School of Artificial Intelligence and Computer Science Jiangnan University China Department of Computer Guangdong University of Science and Technology China Institute of Computing Technology Chinese Academy of Sciences China

ISBN: (纸本)9798400717567

Single-carrier frequency domain contention (S-FDC) is an efficient wireless contention mechanism based on orthogonal frequency-division multiplexing (OFDM). In each round of S-FDC, each node randomly selects and signals on one of the OFDM subcarriers while listening to all subcarriers simultaneously. Each node independently detects the activated subcarrier with the smallest index and regards it as the winner subcarrier. Accurately detecting the winner subcarrier is crucial to ensuring the functionality of the network. However, it is extremely difficult in practice due to power leakage problems that arise from frequency asynchronization among nodes. In this paper, we propose a gated-recurrent-unit (GRU)-based model that incorporates S-FDC’s unique features as domain knowledge to enable accurate winner subcarrier detection. Extensive simulation experiments verify that our DL model is effective and outperforms state of the art. This research highlights the potential of DL in improving wireless communication systems. © 2024 Copyright held by the owner/author(s).

关键词： Frequency domain analysis

来源：评论

学校读者我要写书评

暂无评论

Point Cloud Classification Using Content-Based Transformer via Clustering in Feature Space

引用

IEEE/CAA Journal of Automatica Sinica 2024年第1期11卷 231-239页

作者： Yahui Liu Bin Tian Yisheng Lv Lingxi Li Fei-Yue Wang the State Key Laboratory for Management and Control of Complex Systems Institute of AutomationChinese Academy of SciencesBeijing 100190 the School of Artificial Intelligence University of Chinese Academy of SciencesBeijing 100190 IEEE the Transportation and Autonomous Systems Institute(TASI)and the Department of Electrical and Computer Engineering Purdue School of Engineering and TechnologyIndiana University-Purdue University Indianapolis(IUPUI)Indianapolis 46202 USA

Recently, there have been some attempts of Transformer in 3D point cloud classification. In order to reduce computations, most existing methods focus on local spatial attention,but ignore their content and fail to establish relationships between distant but relevant points. To overcome the limitation of local spatial attention, we propose a point content-based Transformer architecture, called PointConT for short. It exploits the locality of points in the feature space(content-based), which clusters the sampled points with similar features into the same class and computes the self-attention within each class, thus enabling an effective trade-off between capturing long-range dependencies and computational complexity. We further introduce an inception feature aggregator for point cloud classification, which uses parallel structures to aggregate high-frequency and low-frequency information in each branch separately. Extensive experiments show that our PointConT model achieves a remarkable performance on point cloud shape classification. Especially, our method exhibits 90.3% Top-1 accuracy on the hardest setting of ScanObjectN N. Source code of this paper is available at https://***/yahuiliu99/PointC onT.

关键词： Content-based Transformer deep learning feature aggregator local attention point cloud classification

来源：评论

学校读者我要写书评

暂无评论

Machine Learning Prediction Models of Optimal Time for Aortic Valve Replacement in Asymptomatic Patients

引用

Intelligent Automation & Soft Computing 2023年第7期37卷 455-470页

作者： Salah Alzghoul Othman Smadi Ali Al Bataineh Mamon Hatmal Ahmad Alamm Biomedical Engineering Department The Hashemite UniversityZarqaJordan Department of Electrical and Computer Engineering Norwich UniversityNorthfieldVermont05663USA Department of Biochemistry and Molecular Biology The Hashemite UniversityZarqaJordan National Centre for Big Data Science and Artificial Intelligence AmmanJordan

Currently,the decision of aortic valve replacement surgery time for asymptomatic patients with moderate-to-severe aortic stenosis(AS)is made by healthcare professionals based on the patient’s clinical biometric records.A delay in surgical aortic valve replacement(SAVR)can potentially affect patients’quality of *** using ML algorithms,this study aims to predict the optimal SAVR timing and determine the enhancement in moderate-to-severe AS patient survival following *** study represents a novel approach that has the potential to improve decision-making and,ultimately,improve patient *** analyze data from 176 patients with moderate-to-severe aortic stenosis who had undergone or were indicated for *** divide the data into two groups:those who died within the first year after SAVR and those who survived for more than one year or were still alive at the last *** then use six different ML algorithms,Support Vector Machine(SVM),Classification and Regression Tree(C and R tree),Generalized Linear(GL),Chi-Square Automatic Interaction Detector(CHAID),artificial Neural Net-work(ANN),and Linear Regression(LR),to generate predictions for the best timing for *** results showed that the SVM algorithm is the best model for predicting the optimal timing for SAVR and for predicting the post-surgery survival *** optimizing the timing of SAVR surgery using the SVM algorithm,we observed a significant improvement in the survival period after *** study demonstrates that ML algorithms generate reliable models for predicting the optimal timing of SAVR in asymptomatic patients with moderate-to-severe AS.

关键词： Aortic stenosis aortic valve replacement machine learning survival period enhancement artificial intelligence in cardiology

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：