IF 3.3 2区计算机科学

Journal of Process Control Pub Date : 2025-06-19 DOI: 10.1016/j.jprocont.2025.103471

Zengjun Zhang , Shaoyuan Li , Yaru Yang

{"title":"Explorative Policy Optimization for industrial-scale operation of complex process control systems","authors":"Zengjun Zhang , Shaoyuan Li , Yaru Yang","doi":"10.1016/j.jprocont.2025.103471","DOIUrl":"10.1016/j.jprocont.2025.103471","url":null,"abstract":"<div><div>With the advancement of industrial automation, traditional process control methods increasingly struggle to manage the complex operational demands of industrial-scale chemical processes, particularly in the presence of unmodelled dynamics and high nonlinearity. This paper introduces an advanced reinforcement learning algorithm, Explorative Policy Optimization (EPO), specifically developed to optimize operational strategies, focusing on improving both production yield and product quality in such environments. The core innovation of the EPO algorithm is its exploration network, which dynamically adjusts exploration strategies based on discrepancies between predicted and actual values of state–action pairs, enabling more effective exploration. This approach improves decision-making by providing more accurate outcome assessments in complex and unmodelled conditions. EPO also integrates exploration data into the advantage function, ensuring a balance between exploration and exploitation, which is essential for optimizing performance in dynamic environments that require both safety and adaptability. EPO focuses on global optimization in processes with multiple operating conditions and steady states. It surpasses existing RL methods in overall performance while maintaining acceptable computational costs across a wide range of industrial settings. Its effectiveness and practicality are demonstrated through industrial-scale simulation experiments.</div></div>","PeriodicalId":50079,"journal":{"name":"Journal of Process Control","volume":"152 ","pages":"Article 103471"},"PeriodicalIF":3.3,"publicationDate":"2025-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144313608","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Optimization of cross-derivatives for ribbon-based multi-sided surfaces 带状多面曲面交叉导数的优化

IF 2.5 4区计算机科学

Graphical Models Pub Date : 2025-06-19 DOI: 10.1016/j.gmod.2025.101275

Erkan Gunpinar , A. Alper Tasmektepligil , Márton Vaitkus , Péter Salvi

引用次数: 0

Cloud Workload Forecasting via Latency-Aware Time Series Clustering-Based Scheduling Technique 基于延迟感知时间序列聚类调度技术的云工作负载预测

IF 1.5 4区计算机科学

Concurrency and Computation-Practice & Experience Pub Date : 2025-06-19 DOI: 10.1002/cpe.70151

P. Sridhar, R. R. Sathiya

{"title":"Cloud Workload Forecasting via Latency-Aware Time Series Clustering-Based Scheduling Technique","authors":"P. Sridhar, R. R. Sathiya","doi":"10.1002/cpe.70151","DOIUrl":"https://doi.org/10.1002/cpe.70151","url":null,"abstract":"<div>\u0000 \u0000 <p>Cloud computing is a fundamental paradigm for computing services based on the elasticity attribute, in which available resources are effectively adjusted for changing workloads over time. A critical challenge in such systems is the task scheduling problem, which aims to identify the optimal allocation of resources to maximize performance and minimize response times. To overcome these drawbacks, a novel latency-aware time series-based scheduling (LATS) algorithm has been proposed in this paper for predicting future server loads. The proposed method involves collecting workloads, preprocessing and clustering them, predicting time series, and post-processing the data. The workload data will be divided according to a historical time window during the preprocessing phase. Next, the time series data will be clustered based on the latency classes using the dynamic fuzzy c-means algorithm. The time series prediction phase utilizes the Gated Recurrent Unit (GRU), and post-processing is performed to retrieve the original data. An evaluation of the accuracy of future workload predictions was conducted based on actual requests to web servers, and the silhouette score was utilized as the metric for assessing cluster performance. The proposed model has been compared with previous approaches involving Crystal LP, SWDF, and GA-PSO approaches in terms of prediction accuracy by 31.9%, 18.74%, and 12.16%, respectively.</p>\u0000 </div>","PeriodicalId":55214,"journal":{"name":"Concurrency and Computation-Practice & Experience","volume":"37 15-17","pages":""},"PeriodicalIF":1.5,"publicationDate":"2025-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144315322","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Computational Approaches to the Detection of Lesser-Known Rhetorical Figures: A Systematic Survey and Research Challenges 不为人知修辞格检测的计算方法：系统调查和研究挑战

IF 16.6 1区计算机科学

ACM Computing Surveys Pub Date : 2025-06-19 DOI: 10.1145/3744554

Ramona Kühn, Jelena Mitrović, Michael Granitzer

引用次数: 0

Stabilization of a rotating body–beam by output feedback torque control 用输出反馈转矩控制稳定旋转体梁

IF 4.8 2区计算机科学

Automatica Pub Date : 2025-06-19 DOI: 10.1016/j.automatica.2025.112446

Xi Xu , Cheng-Zhong Xu , Xueru Fan , Chun-Hai Kou

引用次数: 0

On the properties of monotone functionals for generalizing Bellman Principle 推广Bellman原理的单调泛函的性质

IF 4.8 2区计算机科学

Automatica Pub Date : 2025-06-19 DOI: 10.1016/j.automatica.2025.112418

Auguste Caen , Jean-Denis Mathias

{"title":"On the properties of monotone functionals for generalizing Bellman Principle","authors":"Auguste Caen , Jean-Denis Mathias","doi":"10.1016/j.automatica.2025.112418","DOIUrl":"10.1016/j.automatica.2025.112418","url":null,"abstract":"<div><div>Dynamic programming is classically used for solving optimal control problems. This approach is based on equating the value function of the problem under study as well as the Bellman Principle. However, despite a sharing common framework, each optimal control problem is addressed independently, depending on the characteristics of the cost function. The objective of this article is to establish a unified approach within the context of deterministic, autonomous dynamics with an infinite horizon. The ultimate purpose is to determine conditions from which an optimal control problem admits a <em>Bellman principle</em>. To achieve this, we introduce a typology composed of three so-called <em>monotone</em> functionals, which encompass typical cost functions met in the literature. Any functional that complies with the properties of one of this class can be used for tackling optimal control problems through Bellman principle. Then, we show that classical functionals used in the literature can be classified in one these classes. Finally, we show how to build a functional according to this typology through a simple problem of optimization.</div></div>","PeriodicalId":55413,"journal":{"name":"Automatica","volume":"179 ","pages":"Article 112418"},"PeriodicalIF":4.8,"publicationDate":"2025-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144313456","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

An adaptive disturbance compensation method for force-sensorless control systems applied to robotic milling 应用于铣削机器人无力传感器控制系统的自适应扰动补偿方法

IF 9.1 1区计算机科学

Robotics and Computer-integrated Manufacturing Pub Date : 2025-06-19 DOI: 10.1016/j.rcim.2025.103082

Han-Hao Tsai, Jen-Yuan Chang

{"title":"An adaptive disturbance compensation method for force-sensorless control systems applied to robotic milling","authors":"Han-Hao Tsai, Jen-Yuan Chang","doi":"10.1016/j.rcim.2025.103082","DOIUrl":"10.1016/j.rcim.2025.103082","url":null,"abstract":"<div><div>This paper introduces a novel disturbance compensation method for a robust, active-force-controlled end-effector. This system integrates a disturbance observer (DOB) and a reaction force observer (RFOB) while employing a numerical optimization-based extremum-seeking algorithm. Conventional force/torque sensors, when employed in serially connected manipulator systems, often trigger unstable responses due to the presence of non-collocated modes. Furthermore, conventional reaction force observers may fail to accurately estimate the contact force between the robot and its environment when external disturbance terms are not perfectly modeled a priori. In response to these challenges, recent research has reintegrated force/torque sensors into the control architecture, employing filter-based sensor fusion techniques to mitigate disturbance effects. However, these approaches fail to address the inherent stability challenges caused by the mounting and serial connection of force/torque sensors within the robot manipulator system, which in turn increases the design complexity of reaction-force-observer-based force control systems. To overcome these limitations, this paper proposes adaptive disturbance compensation methods that leverage position feedback information related to the depth of cut in milling processes. The proposed method adaptively compensates for time-varying disturbances, such as tool wear and abrupt feed rate changes, ensuring consistent performance under dynamic conditions. Compared to conventional position-controlled and force-controlled methods, the proposed approach exhibits improved robustness, precision, and versatility, positioning it as a promising solution for advancing robotic milling technologies toward practical industrial applications.</div></div>","PeriodicalId":21452,"journal":{"name":"Robotics and Computer-integrated Manufacturing","volume":"97 ","pages":"Article 103082"},"PeriodicalIF":9.1,"publicationDate":"2025-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144313478","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

A roadmap for AI in robotics 机器人领域的人工智能路线图

IF 23.8 1区计算机科学

Nature Machine Intelligence Pub Date : 2025-06-19 DOI: 10.1038/s42256-025-01050-6

Aude Billard, Alin Albu-Schaeffer, Michael Beetz, Wolfram Burgard, Peter Corke, Matei Ciocarlie, Ravinder Dahiya, Danica Kragic, Ken Goldberg, Yukie Nagai, Davide Scaramuzza

{"title":"A roadmap for AI in robotics","authors":"Aude Billard, Alin Albu-Schaeffer, Michael Beetz, Wolfram Burgard, Peter Corke, Matei Ciocarlie, Ravinder Dahiya, Danica Kragic, Ken Goldberg, Yukie Nagai, Davide Scaramuzza","doi":"10.1038/s42256-025-01050-6","DOIUrl":"https://doi.org/10.1038/s42256-025-01050-6","url":null,"abstract":"<p>There is growing excitement about the potential of leveraging artificial intelligence (AI) to tackle some of the outstanding barriers to the full deployment of robots in daily lives. However, action and sensing in the physical world pose greater and different challenges for AI than analysing data in isolation and it is important to reflect on which AI approaches are most likely to be successfully applied to robots. Questions to address, among others, are how AI models can be adapted to specific robot designs, tasks and environments. This Perspective offers an assessment of what AI has achieved for robotics since the 1990s and proposes a research roadmap with challenges and promises. These range from keeping up-to-date large datasets, representatives of a diversity of tasks that robots may have to perform, and of environments they may encounter, to designing AI algorithms tailored specifically to robotics problems but generic enough to apply to a wide range of applications and transfer easily to a variety of robotic platforms. For robots to collaborate effectively with humans, they must predict human behaviour without relying on bias-based profiling. Explainability and transparency in AI-driven robot control are essential for building trust, preventing misuse and attributing responsibility in accidents. We close with describing what are, in our view, primary long-term challenges, namely, designing robots capable of lifelong learning, and guaranteeing safe deployment and usage, as well as sustainable development.</p>","PeriodicalId":48533,"journal":{"name":"Nature Machine Intelligence","volume":"147 1","pages":""},"PeriodicalIF":23.8,"publicationDate":"2025-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144319894","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Residue Matching: A Method to Determine Intersample Vibrations in Systems With State Feedback 残差匹配：一种确定状态反馈系统样本间振动的方法

IF 2.2 4区计算机科学

IET Control Theory and Applications Pub Date : 2025-06-19 DOI: 10.1049/cth2.70051

Tamás Haba, Csaba Budai

引用次数: 0

Named entity recognition using Bi-LSTM model with pointer cascade conditional random field for selecting high-profit products 采用带指针级联条件随机场的Bi-LSTM模型进行命名实体识别，选择高利润产品

IF 5 3区计算机科学

Egyptian Informatics Journal Pub Date : 2025-06-19 DOI: 10.1016/j.eij.2025.100703

C. Gayathri , Dr. R. Samson Ravindran

{"title":"Named entity recognition using Bi-LSTM model with pointer cascade conditional random field for selecting high-profit products","authors":"C. Gayathri , Dr. R. Samson Ravindran","doi":"10.1016/j.eij.2025.100703","DOIUrl":"10.1016/j.eij.2025.100703","url":null,"abstract":"<div><div>Named entity recognition (NER) refers to recognizing objects mentioned in texts and is considered one of the most fundamental tasks in natural language processing. The authentication of named entities is not merely a matter of extracting information independently. The rise of this sector has benefited from rapid growth, especially in the e-commerce sector; numerous reviews are published that reflect consumer sentiments on different aspects of products and services such as quality, price, and more.A critical challenge lies in improving the accuracy and robustness of NER systems to address issues such as ambiguous contexts, intricate sentence structures, and domain-specific variations. Previous works on NER usually use conventional machine learning methods. However, there is still a need to improve the accuracy of identifying entities. To accomplish this goal, this work proposes a pointer cascade conditional random field-based named entity recognition procedure. A word embedding approach is initially applied to segment the word for further processing. Word vectors are provided as input to a bidirectional LSTM (Bi-LSTM) model, which extracts features from sentence or word vectors. To improve the performance of BiLSTM, a pointer network is used to generate pointer sequences for the elements of the input array. After features are extracted, the Cascade Conditional Random Field (CCRF) layer checks tag validity by learning the correlation between tags. A Python 3.7 framework is used to implement the proposed model. According to the results of the experiments, this work achieves a high accuracy of 98.54 %.</div></div>","PeriodicalId":56010,"journal":{"name":"Egyptian Informatics Journal","volume":"31 ","pages":"Article 100703"},"PeriodicalIF":5.0,"publicationDate":"2025-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144312957","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

计算机科学最新文献