计算机科学最新文献

筛选
英文 中文
Large vision-language models enabled novel objects 6D pose estimation for human-robot collaboration 大型视觉语言模型为人机协作提供了新的物体6D姿态估计
IF 9.1 1区 计算机科学
Robotics and Computer-integrated Manufacturing Pub Date : 2025-04-26 DOI: 10.1016/j.rcim.2025.103030
Wanqing Xia, Hao Zheng, Weiliang Xu, Xun Xu
{"title":"Large vision-language models enabled novel objects 6D pose estimation for human-robot collaboration","authors":"Wanqing Xia,&nbsp;Hao Zheng,&nbsp;Weiliang Xu,&nbsp;Xun Xu","doi":"10.1016/j.rcim.2025.103030","DOIUrl":"10.1016/j.rcim.2025.103030","url":null,"abstract":"<div><div>Six-Degree-of-Freedom (6D) pose estimation is essential for robotic manipulation tasks, especially in human-robot collaboration environments. Recently, 6D pose estimation has been extended from seen objects to novel objects due to the frequent encounters with unfamiliar items in real-life scenarios. This paper presents a three-stage pipeline for 6D pose estimation of previously unseen objects, leveraging the capabilities of large vision-language models. Our approach consists of vision-language model-based object detection and segmentation, mask selection with pose hypothesis generated from CAD models, and refinement and scoring of pose candidates. We evaluate our method on the YCB-Video dataset, achieving a state-of-the-art Average Recall (AR) score of 75.8 with RGB-D images, demonstrating its effectiveness in accurately estimating 6D poses for a diverse range of objects. The effectiveness of each operation stage is investigated in the ablation study. To validate the practical applicability of our approach, we conduct case studies on a real-world robotic platform, focusing on object pick-up tasks by integrating our 6D pose estimation pipeline with human intention prediction and task analysis algorithms. Results show that the proposed method can effectively handle novel objects in our test environments, as demonstrated through the YCB dataset evaluation and case studies. Our work contributes to the field of human-robot collaboration by introducing a flexible, generalizable approach to 6D pose estimation, enabling robots to adapt to new objects without requiring extensive retraining—a vital capability for advancing human-robot collaboration in dynamic environments. More information can be found in the project GitHub page: <span><span>https://github.com/WanqingXia/HRC_DetAnyPose</span><svg><path></path></svg></span>.</div></div>","PeriodicalId":21452,"journal":{"name":"Robotics and Computer-integrated Manufacturing","volume":"95 ","pages":"Article 103030"},"PeriodicalIF":9.1,"publicationDate":"2025-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143874159","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 simple and reliable semi-supervised anomaly detection network for detecting crack in stamped parts 一种用于冲压件裂纹检测的简单可靠的半监督异常检测网络
IF 8.2 1区 计算机科学
Computers in Industry Pub Date : 2025-04-26 DOI: 10.1016/j.compind.2025.104301
Xingjun Dong , Changsheng Zhang , Shuaitong Liu , Dawei Wang
{"title":"A simple and reliable semi-supervised anomaly detection network for detecting crack in stamped parts","authors":"Xingjun Dong ,&nbsp;Changsheng Zhang ,&nbsp;Shuaitong Liu ,&nbsp;Dawei Wang","doi":"10.1016/j.compind.2025.104301","DOIUrl":"10.1016/j.compind.2025.104301","url":null,"abstract":"<div><div>Stamped parts play a crucial role in industrial manufacturing, and it is particularly important to automatically inspect their surface cracks. Since crack is rare and diverse, supervised defect detection methods lack sufficient data and cannot achieve ideal results. Unsupervised anomaly detection algorithms, which do not require crack data, can identify unknown cracks. However, they tend to have high rates of missed detections and false positives when dealing with complex backgrounds in stamped parts. To address these problems, this paper proposes a network called simple and reliable semi-supervised anomaly detection, considering the presence of a small number of anomalous data in actual production. This network uses a large number of normal samples and a small number of anomalous samples to detect surface cracks in stamped parts. Firstly, a pre-trained feature extractor is used for feature extraction, coupled with a designed feature adaptation network to reduce domain bias. Secondly, by extracting normal features from normal images, adding noise to these normal features to generate abnormal features, and extracting abnormal features from abnormal images at multiple scales, a feature space is constructed. Finally, by training a simplified discriminator based on the constructed feature space, computational efficiency is enhanced, and the deployment process is simplified. In the experiments, we collaborated with a multinational company, using an actual production dataset for verification. The proposed algorithm can achieve the score of area under the receiver operating characteristic curve of 98.2% for detection and 97.9% for localization at a processing speed of 19 frames per second.</div></div>","PeriodicalId":55219,"journal":{"name":"Computers in Industry","volume":"169 ","pages":"Article 104301"},"PeriodicalIF":8.2,"publicationDate":"2025-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143874165","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
Horizontal-to-tilted conversion of solar radiation data using machine learning algorithms 利用机器学习算法对太阳辐射数据进行水平到倾斜的转换
IF 7.5 2区 计算机科学
Engineering Applications of Artificial Intelligence Pub Date : 2025-04-26 DOI: 10.1016/j.engappai.2025.110951
Ali Naci Celik , Bahadır Sarman , Kemal Polat
{"title":"Horizontal-to-tilted conversion of solar radiation data using machine learning algorithms","authors":"Ali Naci Celik ,&nbsp;Bahadır Sarman ,&nbsp;Kemal Polat","doi":"10.1016/j.engappai.2025.110951","DOIUrl":"10.1016/j.engappai.2025.110951","url":null,"abstract":"<div><div>Solar radiation is the main input of system design algorithms in solar energy engineering. Solar radiation is usually measured on horizontal surfaces. However, in majority of solar energy applications such as photovoltaics, surfaces are either fixed at certain angles or continuously track the sun for maximizing energy input. Therefore, converting solar radiation data from horizontal to tilted surfaces is essential. Conventionally, conversion of solar radiation from horizontal to tilted is carried out using analytical methods. As with many other disciplines in science and technology, machine learning has recently been successfully applied also to solar radiation modelling to solve various problems such as in-advance forecasting of solar radiation. In the present article, solar radiation collected on horizontal surface is converted to tilted surface by machine learning algorithms and compared to solar radiation measured at a tilted surface. Eight different machine learning algorithms have been presently used for the conversion of solar radiation data. Accuracy of the models has been assessed based on a total of seven statistical metrics commonly used in literature. Overall, extra trees algorithm led to the best results as indicated by the statistical metrics used, for example, the mean absolute error of 7.3219 and coefficient of determination 0.9964. Based on the results presently obtained, it is demonstrated that machine learning led to an improved prediction when compared to the analytical models. The present research highlights the crucial significance of such advanced techniques, emphasizing their potential to drive a paradigm shift in solar energy engineering.</div></div>","PeriodicalId":50523,"journal":{"name":"Engineering Applications of Artificial Intelligence","volume":"153 ","pages":"Article 110951"},"PeriodicalIF":7.5,"publicationDate":"2025-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143874356","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
Policy optimization of finite-horizon Kalman filter with unknown noise covariance 未知噪声协方差的有限视界卡尔曼滤波策略优化
IF 4.8 2区 计算机科学
Automatica Pub Date : 2025-04-26 DOI: 10.1016/j.automatica.2025.112320
Haoran Li, Yuan-Hua Ni
{"title":"Policy optimization of finite-horizon Kalman filter with unknown noise covariance","authors":"Haoran Li,&nbsp;Yuan-Hua Ni","doi":"10.1016/j.automatica.2025.112320","DOIUrl":"10.1016/j.automatica.2025.112320","url":null,"abstract":"<div><div>This paper focuses on the learning of Kalman gain of a finite-horizon Kalman filter with unknown noise covariance through the policy optimization method. Firstly, we reformulate the finite-horizon Kalman filter as an optimization problem featuring a doubly-summed objective function Secondly, we establish the global linear convergence of exact gradient descent method in the scenario where the model parameters are all known. Thirdly, we propose a batch gradient descent algorithm to solve the optimization problem. Finally, we provide the global linear convergence and sample complexity of batch gradient descent for the scenario where the noise covariance matrices are unknown.</div></div>","PeriodicalId":55413,"journal":{"name":"Automatica","volume":"177 ","pages":"Article 112320"},"PeriodicalIF":4.8,"publicationDate":"2025-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143874522","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
Reconstructing networks from the algebraic model of networked evolutionary games 基于网络进化博弈代数模型的网络重构
IF 3.7 2区 计算机科学
Nonlinear Analysis-Hybrid Systems Pub Date : 2025-04-26 DOI: 10.1016/j.nahs.2025.101603
Fei Wang , Jun-e Feng , Biao Wang
{"title":"Reconstructing networks from the algebraic model of networked evolutionary games","authors":"Fei Wang ,&nbsp;Jun-e Feng ,&nbsp;Biao Wang","doi":"10.1016/j.nahs.2025.101603","DOIUrl":"10.1016/j.nahs.2025.101603","url":null,"abstract":"<div><div>This paper presents a systematic mathematical analysis of the network reconstruction problem based on the algebraic model of networked evolutionary games, focusing on two data scenarios: (1) players’ payoff and strategy data, and (2) only players’ strategy data. Begin with the first scenario, the players’ payoff functions are transformed into a system of linear equations concerning neighbors using the payoff vector of the fundamental network game. Then the necessary and sufficient conditions for reconstructing the player network from the payoff functions are provided. In the second scenario, by considering the myopic best response and the unconditional imitation updating rules, the conditions under which the fundamental network game ensures that the strategy dynamic equations contain information about all player neighbors are investigated. Moreover, criteria for determining neighbors from these strategy dynamic equations are proposed. Finally, two examples demonstrate the network reconstruction process.</div></div>","PeriodicalId":49011,"journal":{"name":"Nonlinear Analysis-Hybrid Systems","volume":"57 ","pages":"Article 101603"},"PeriodicalIF":3.7,"publicationDate":"2025-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143873860","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
Cross-Polarisation Suppression in Self-Diplexing Antennas 自双工天线中的交叉极化抑制
IF 1.1 4区 计算机科学
Iet Microwaves Antennas & Propagation Pub Date : 2025-04-26 DOI: 10.1049/mia2.70020
Yitong Yao, Gang Dong
{"title":"Cross-Polarisation Suppression in Self-Diplexing Antennas","authors":"Yitong Yao,&nbsp;Gang Dong","doi":"10.1049/mia2.70020","DOIUrl":"https://doi.org/10.1049/mia2.70020","url":null,"abstract":"<p>An approach to improve cross-polarisation (XP) radiation in probe-fed microstrip antennas is presented in this letter. The notable XP associated with self-diplexing antennas caused by radiator multiplexing is discussed for the first time. In order to enhance the interport isolation and polarisation purity, the proposed antenna exploits the combined advantages of the defected ground structure (DGS) and shorting pin arrays. Experimental results show that the resonant frequencies of the self-diplexing antenna are 9.56 and 11.28 GHz, accompanied by a port-to-port isolation of more than 29.4 dB. The suppression of XP around 50° range on either side of the boresight in both principal planes is greater than 12.3 and 11.1 dB for ports 1 and 2, respectively.</p>","PeriodicalId":13374,"journal":{"name":"Iet Microwaves Antennas & Propagation","volume":"19 1","pages":""},"PeriodicalIF":1.1,"publicationDate":"2025-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/mia2.70020","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143877812","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
High-precision and high-speed flow rate control with nonlinear disturbance compensation using valve body position feedback 采用阀体位置反馈非线性扰动补偿的高精度高速流量控制
IF 3.1 3区 计算机科学
Mechatronics Pub Date : 2025-04-26 DOI: 10.1016/j.mechatronics.2025.103317
Koki Hattori, Wataru Ohnishi, Takafumi Koseki
{"title":"High-precision and high-speed flow rate control with nonlinear disturbance compensation using valve body position feedback","authors":"Koki Hattori,&nbsp;Wataru Ohnishi,&nbsp;Takafumi Koseki","doi":"10.1016/j.mechatronics.2025.103317","DOIUrl":"10.1016/j.mechatronics.2025.103317","url":null,"abstract":"<div><div>Pneumatic valves play a crucial role in controlling flow rates across various industrial applications. This study aims to achieve faster and more precise gas flow rate control to improve throughput and product quality. However, inherent nonlinearities such as solenoid hysteresis and compressible fluid dynamics degrade the control performance of pneumatic valves. To address these challenges, this study proposes a mass flow rate control system incorporating an inner feedback loop for valve body position control to compensate for nonlinear disturbances. Furthermore, a data-driven feedforward control approach based on iterative learning control (ILC) is implemented to mitigate repetitive disturbances and enhance flow rate response speed. Experimental validation demonstrates that the inner feedback loop effectively reduces steady-state error, while the proposed feedforward control achieves a 9<!--> <!-->ms settling time, 98% faster than conventional industrial control using the same hardware.</div></div>","PeriodicalId":49842,"journal":{"name":"Mechatronics","volume":"108 ","pages":"Article 103317"},"PeriodicalIF":3.1,"publicationDate":"2025-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143873576","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
Set-membership estimator design with privacy-preserving for sensor networks: A state-decomposition-based approach 基于状态分解的传感器网络隐私保护集隶属度估计器设计
IF 4.8 2区 计算机科学
Automatica Pub Date : 2025-04-26 DOI: 10.1016/j.automatica.2025.112347
Yuhan Xie , Sanbo Ding , Nannan Rong
{"title":"Set-membership estimator design with privacy-preserving for sensor networks: A state-decomposition-based approach","authors":"Yuhan Xie ,&nbsp;Sanbo Ding ,&nbsp;Nannan Rong","doi":"10.1016/j.automatica.2025.112347","DOIUrl":"10.1016/j.automatica.2025.112347","url":null,"abstract":"<div><div>Set-membership estimation over open sensor networks is a current research hotspot. It remains a risk of data leakage under highly open network channels. This paper focuses on establishing set-membership estimator design strategy under a privacy-preserving framework. Firstly, with the aid of state decomposition methods, a new group of set-membership estimators with privacy-preserving are originally established. Wherein the real measurement is divided into two parts for information interaction and performance compensation respectively. The proposed estimator structure contributes to the security of private data by confusing eavesdroppers. Secondly, a sufficient condition is established to guarantee that the ellipsoidal estimation sets are updated properly. Compared with the existing results on set-membership estimation, the developed one is less conservative. Thirdly, a rigorous theoretical analysis is proposed to justify that the proposed estimator is sufficiently robust to confuse eavesdroppers. Lastly, a simulation example is given to evaluate the estimation and privacy-preserving performance of the proposed technique.</div></div>","PeriodicalId":55413,"journal":{"name":"Automatica","volume":"177 ","pages":"Article 112347"},"PeriodicalIF":4.8,"publicationDate":"2025-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143874525","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
Differentially private and communication-efficient distributed nonconvex optimization algorithms 差分私有和通信高效的分布式非凸优化算法
IF 4.8 2区 计算机科学
Automatica Pub Date : 2025-04-26 DOI: 10.1016/j.automatica.2025.112338
Antai Xie , Xinlei Yi , Xiaofan Wang , Ming Cao , Xiaoqiang Ren
{"title":"Differentially private and communication-efficient distributed nonconvex optimization algorithms","authors":"Antai Xie ,&nbsp;Xinlei Yi ,&nbsp;Xiaofan Wang ,&nbsp;Ming Cao ,&nbsp;Xiaoqiang Ren","doi":"10.1016/j.automatica.2025.112338","DOIUrl":"10.1016/j.automatica.2025.112338","url":null,"abstract":"<div><div>This paper studies the privacy-preserving distributed optimization problem under limited communication, where each agent aims to keep its cost function private while minimizing the sum of all agents’ cost functions. To this end, we propose two differentially private distributed algorithms under compressed communication. We show that the proposed algorithms achieve sublinear convergence for smooth (possibly nonconvex) cost functions and linear convergence when the global cost function additionally satisfies the Polyak–Łojasiewicz condition, even for a general class of compressors with bounded relative compression error. Furthermore, we rigorously prove that the proposed algorithms ensure <span><math><mi>ϵ</mi></math></span>-differential privacy. Unlike methods in the literature, the analysis of privacy under the proposed algorithms do not rely on the specific forms of compressors. Simulations are presented to demonstrate the effectiveness of our proposed approach.</div></div>","PeriodicalId":55413,"journal":{"name":"Automatica","volume":"177 ","pages":"Article 112338"},"PeriodicalIF":4.8,"publicationDate":"2025-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143874688","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
DFAT: A web-based toolkit for estimating demand flexibility in building-to-grid integration DFAT:一个基于web的工具包,用于估算从建筑到电网集成的需求灵活性
IF 2.4 4区 计算机科学
SoftwareX Pub Date : 2025-04-26 DOI: 10.1016/j.softx.2025.102131
Michael Leong , Medha Mahanta , Clara Yin , Timothy Jairus Garcia , Zach Tan , Anand Krishnan Prakash , Doug Black , Rongxin Yin
{"title":"DFAT: A web-based toolkit for estimating demand flexibility in building-to-grid integration","authors":"Michael Leong ,&nbsp;Medha Mahanta ,&nbsp;Clara Yin ,&nbsp;Timothy Jairus Garcia ,&nbsp;Zach Tan ,&nbsp;Anand Krishnan Prakash ,&nbsp;Doug Black ,&nbsp;Rongxin Yin","doi":"10.1016/j.softx.2025.102131","DOIUrl":"10.1016/j.softx.2025.102131","url":null,"abstract":"<div><div>Demand Flexibility Assessment Tool (DFAT) is an open source web-based tool that estimates the demand flexibility potential of common control strategies in commercial buildings. The toolkit features a demand flexibility estimation tool that contains two calculators, basic and advanced, based on the level of input of customer data. The basic version calculates demand shed metrics for the control strategy “global temperature adjustment” and “cycle on/off compressors” using customer building information, local weather data, and electrical meter data. The advanced version, which uses detailed HVAC equipment data, calculates demand flexibility metrics for control strategies such as static pressure reset, global temperature adjustment, and cycle on/off compressors. In addition to the demand flexibility estimation tool, this toolkit offers a benchmarking tool that helps facility operators, aggregators, and utility resource managers assess demand flexibility opportunities, quantify/verify performance, and compare their performance against that of their peers.</div></div>","PeriodicalId":21905,"journal":{"name":"SoftwareX","volume":"30 ","pages":"Article 102131"},"PeriodicalIF":2.4,"publicationDate":"2025-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143874827","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
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信