Adaptive path planning for wafer second probing via an attention-based hierarchical reinforcement learning framework with shared memory

IF 8.1 1区 计算机科学 0 COMPUTER SCIENCE, INFORMATION SYSTEMS Information Sciences Pub Date : 2025-03-18 DOI:10.1016/j.ins.2025.122089
Haobin Shi , Ziming He , Kao-Shing Hwang
{"title":"Adaptive path planning for wafer second probing via an attention-based hierarchical reinforcement learning framework with shared memory","authors":"Haobin Shi ,&nbsp;Ziming He ,&nbsp;Kao-Shing Hwang","doi":"10.1016/j.ins.2025.122089","DOIUrl":null,"url":null,"abstract":"<div><div>In semiconductor manufacturing, wafer probing is a quality control process before packaging, usually performed by an automated machine with a fixed path. The unqualified grains in the first detection need to be confirmed again. The fixed path method is inefficient and requires manual intervention for the second wafer probing on randomly scattered grains. To this end, we propose a reinforcement learning-based adaptive path planning method for second wafer probing. To simplify decision-making in a large state space, we propose a novel attention-based hierarchical reinforcement learning method with shared memory (AHRL-SM) and introduce it into wafer probing for the first time. The high-level agent is responsible for focusing on the region with a large number of grains to be detected, while the low-level agent is responsible for planning the moving path of the probe in the specified sub-region. The soft attention mechanism and recurrent neural network are incorporated into the probing architecture to facilitate original image feature extraction and historical information acquisition, respectively. In addition, we propose a unique shared memory mechanism to further improve decision-making efficiency. The Markov decision process of the complete wafer second probing and the performance verification of the proposed method are thoroughly described in this work. Compared with the existing path planning methods for wafer probing, sufficient experimental results confirm that our method has obvious advantages in probing efficiency, grain surface protection, and generalization.</div></div>","PeriodicalId":51063,"journal":{"name":"Information Sciences","volume":"710 ","pages":"Article 122089"},"PeriodicalIF":8.1000,"publicationDate":"2025-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Information Sciences","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S002002552500221X","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"0","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

In semiconductor manufacturing, wafer probing is a quality control process before packaging, usually performed by an automated machine with a fixed path. The unqualified grains in the first detection need to be confirmed again. The fixed path method is inefficient and requires manual intervention for the second wafer probing on randomly scattered grains. To this end, we propose a reinforcement learning-based adaptive path planning method for second wafer probing. To simplify decision-making in a large state space, we propose a novel attention-based hierarchical reinforcement learning method with shared memory (AHRL-SM) and introduce it into wafer probing for the first time. The high-level agent is responsible for focusing on the region with a large number of grains to be detected, while the low-level agent is responsible for planning the moving path of the probe in the specified sub-region. The soft attention mechanism and recurrent neural network are incorporated into the probing architecture to facilitate original image feature extraction and historical information acquisition, respectively. In addition, we propose a unique shared memory mechanism to further improve decision-making efficiency. The Markov decision process of the complete wafer second probing and the performance verification of the proposed method are thoroughly described in this work. Compared with the existing path planning methods for wafer probing, sufficient experimental results confirm that our method has obvious advantages in probing efficiency, grain surface protection, and generalization.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
求助全文
约1分钟内获得全文 去求助
来源期刊
Information Sciences
Information Sciences 工程技术-计算机:信息系统
CiteScore
14.00
自引率
17.30%
发文量
1322
审稿时长
10.4 months
期刊介绍: Informatics and Computer Science Intelligent Systems Applications is an esteemed international journal that focuses on publishing original and creative research findings in the field of information sciences. We also feature a limited number of timely tutorial and surveying contributions. Our journal aims to cater to a diverse audience, including researchers, developers, managers, strategic planners, graduate students, and anyone interested in staying up-to-date with cutting-edge research in information science, knowledge engineering, and intelligent systems. While readers are expected to share a common interest in information science, they come from varying backgrounds such as engineering, mathematics, statistics, physics, computer science, cell biology, molecular biology, management science, cognitive science, neurobiology, behavioral sciences, and biochemistry.
期刊最新文献
Editorial Board Adaptive path planning for wafer second probing via an attention-based hierarchical reinforcement learning framework with shared memory Highly improve the accuracy of clustering algorithms based on shortest path distance Toward automated verification of timed business process models using timed-automata networks and temporal properties Explainable physics-guided attention network for long-lead ENSO forecasts
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1