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

IF 6.8 1区 计算机科学 0 COMPUTER SCIENCE, INFORMATION SYSTEMS
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":6.8000,"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.
基于共享记忆的基于注意力的分层强化学习框架的自适应路径规划
在半导体制造中,晶圆探测是封装前的质量控制过程,通常由具有固定路径的自动化机器执行。第一次检测不合格的颗粒需要再次确认。固定路径法在随机分散的晶圆上进行二次探测时需要人工干预,效率低。为此,我们提出了一种基于强化学习的二次晶圆探测自适应路径规划方法。为了简化大状态空间下的决策过程,提出了一种基于注意力的分层强化学习方法(AHRL-SM),并首次将其引入到晶圆探测中。高级代理负责关注待检测颗粒数量较多的区域,低级代理负责规划探针在指定子区域的移动路径。在探测架构中引入了软注意机制和递归神经网络,分别实现了原始图像特征提取和历史信息获取。此外,我们提出了一种独特的共享记忆机制,以进一步提高决策效率。本文详细描述了整个晶圆秒探测的马尔可夫决策过程以及所提方法的性能验证。与现有的晶圆探测路径规划方法相比,充分的实验结果证实了该方法在探测效率、晶粒表面保护和通用性方面具有明显的优势。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信