{"title":"一种简单有效的模拟测试点选择启发式方法","authors":"Huajun Lei, Kaiyu Qin","doi":"10.1109/ISCID.2013.14","DOIUrl":null,"url":null,"abstract":"An important problem that arises in the area of fault diagnosis and circuit testing is the analog test point selection (ATPS), which is known to be NP-hard. In this paper, we present a new approach for the ATPS problem based on greedy randomized adaptive search procedure (GRASP), with the objective of overcoming the shortcoming of the greedy algorithms which are easily getting trapped into local optima. The proposed method first generates a feasible test point set by introducing randomness into greedy algorithm, and then a local search algorithm is designed to further improve the quality of the test point set got before. The efficiency of the proposed algorithm is demonstrated by a benchmark circuit. Results indicate that the proposed method, compared with other ATPS methods, more efficiently and more accurately finds the optimum set of test points.","PeriodicalId":297027,"journal":{"name":"2013 Sixth International Symposium on Computational Intelligence and Design","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"An Effective and Simple Heuristic for Analog Test Point Selection\",\"authors\":\"Huajun Lei, Kaiyu Qin\",\"doi\":\"10.1109/ISCID.2013.14\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"An important problem that arises in the area of fault diagnosis and circuit testing is the analog test point selection (ATPS), which is known to be NP-hard. In this paper, we present a new approach for the ATPS problem based on greedy randomized adaptive search procedure (GRASP), with the objective of overcoming the shortcoming of the greedy algorithms which are easily getting trapped into local optima. The proposed method first generates a feasible test point set by introducing randomness into greedy algorithm, and then a local search algorithm is designed to further improve the quality of the test point set got before. The efficiency of the proposed algorithm is demonstrated by a benchmark circuit. Results indicate that the proposed method, compared with other ATPS methods, more efficiently and more accurately finds the optimum set of test points.\",\"PeriodicalId\":297027,\"journal\":{\"name\":\"2013 Sixth International Symposium on Computational Intelligence and Design\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-10-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 Sixth International Symposium on Computational Intelligence and Design\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISCID.2013.14\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 Sixth International Symposium on Computational Intelligence and Design","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISCID.2013.14","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
An Effective and Simple Heuristic for Analog Test Point Selection
An important problem that arises in the area of fault diagnosis and circuit testing is the analog test point selection (ATPS), which is known to be NP-hard. In this paper, we present a new approach for the ATPS problem based on greedy randomized adaptive search procedure (GRASP), with the objective of overcoming the shortcoming of the greedy algorithms which are easily getting trapped into local optima. The proposed method first generates a feasible test point set by introducing randomness into greedy algorithm, and then a local search algorithm is designed to further improve the quality of the test point set got before. The efficiency of the proposed algorithm is demonstrated by a benchmark circuit. Results indicate that the proposed method, compared with other ATPS methods, more efficiently and more accurately finds the optimum set of test points.