arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2504.00611stat.MEeess.SP
收藏

使用 (r,s)-正则设计算法的多阶段分组检测

Multi-stage Group Testing with (r,s)-regular design Algorithms

Michael Balzer

AI总结:

本文提出多阶段 (r,s)-正则设计分组检测算法,推导了预期检测次数和持续时间的统一表达式,在低缺陷概率下优于现有算法并接近最优计数边界。

摘要:

在工业工程和制造中,质量控制是产品生产过程的重要组成部分。为确保制造商品的功能正常,必须在发货给客户前进行严格检测以识别缺陷产品。然而,鉴于时间、资源和人员有限,以顺序方式逐个检测产品通常繁琐、麻烦且不适用。因此,采用统计方法来研究批次中产品的随机样本。例如,分组检测作为一种替代方案出现,通过评估联合检测结果来可靠地检测制造商品。尽管有明显的优势,但现有的分组检测方法在现实工业环境中经常面临效率和实用性问题,在这些环境中,最小化平均检测次数和总体检测持续时间至关重要。本文研究了在分组检测框架内用于识别缺陷产品的新型多阶段 (r,s)-正则设计算法。受制造中质量控制应用的启发,推导了预期检测次数和预期持续时间的统一表达式。结果表明,新型分组检测算法在低缺陷概率下优于现有算法,并在保持低复杂度的同时接近最优计数边界。数学证明得到了严格模拟研究和性能评估的支持。

英文摘要:

In industrial engineering and manufacturing, quality control is an essential part of the production process of a product. To ensure proper functionality of a manufactured good, rigorous testing has to be performed to identify defective products before shipment to the customer. However, testing products individually in a sequential manner is often tedious, cumbersome and not widely applicable given that time, resources and personnel are limited. Thus, statistical methods have been employed to investigate random samples of products from batches. For instance, group testing has emerged as an alternative to reliably test manufactured goods by evaluating joint test results. Despite the clear advantages, existing group testing methods often struggle with efficiency and practicality in real-world industry settings, where minimizing the average number of tests and overall testing duration is critical. In this paper, novel multistage (r,s)-regular design algorithms in the framework of group testing for the identification of defective products are investigated. Motivated by the application in quality control in manufacturing, unifying expressions for the expected number of tests and expected duration are derived. The results show that the novel group testing algorithms outperform established algorithms for low probabilities of defectiveness and get close to the optimal counting bound while maintaining a low level of complexity. Mathematical proofs are supported by rigorous simulation studies and an evaluation of the performance.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑