首页 | 本学科首页   官方微博 | 高级检索  
     

ATE开关矩阵最短路径搜索算法
引用本文:陈玉强,苏健,张雷,杨国振. ATE开关矩阵最短路径搜索算法[J]. 科技导报(北京), 2014, 32(15): 37-42. DOI: 10.3981/j.issn.1000-7857.2014.15.004
作者姓名:陈玉强  苏健  张雷  杨国振
作者单位:装甲兵工程学院控制工程系, 北京 100072
摘    要: 开关矩阵作为信号传递的枢纽,在自动测试设备内部扮演着极其重要的角色。当信号源节点与目标节点之间距离最短时,信号才能最有效地传输。基于开关矩阵的物理模型,结合图论知识,构造了开关矩阵的数学模型。针对通路继电器最少、系统可靠性最高2 种情形,把路径最短问题抽象成无权图和有权图的最短路径搜索问题,分别采用广度优先搜索(BFS)算法和Dijkstra 算法进行研究,并提出改进型算法。通过具体实例,建立模型并应用改进算法予以实现。改进算法应用于ATE 通用适配器的开发研制和自动测试设备软件平台的设计,可实现最佳测试路径的快速自动搜索,具有工程实践价值。

关 键 词:开关矩阵  路径搜索  广度优先搜索算法  Dijkstra 算法  
收稿时间:2014-02-28

Optimum Path Searching Algorithm for ATE Switch Matrix
CHEN Yuqiang,SU Jian,ZHANG Lei,YANG Guozhen. Optimum Path Searching Algorithm for ATE Switch Matrix[J]. Science & Technology Review, 2014, 32(15): 37-42. DOI: 10.3981/j.issn.1000-7857.2014.15.004
Authors:CHEN Yuqiang  SU Jian  ZHANG Lei  YANG Guozhen
Affiliation:Department of Control Engineering, Academy of Armored Force Engineering, Beijing 100072, China
Abstract:As a signal transfer hub, switch matrix plays an extremely important role in the automatic test equipment (ATE). When the distance between the source node and destination node is the shortest, signals can be transmitted in a most efficient way. First, a physical model of switch matrix is presented. Then a mathematical model is constructed by using graph theory. In view of the least relay and highest reliability, the problem is considered as a shortest path search in un-weighted graph and weighted graph. These two graphs arestudied by BFS algorithm and Dijkstra algorithm, and the improvedalgorithm is put forward. An actual example shows how to build the model and find the optimum path. The improved algorithm could realize rapid automatic searchfor the optimum path, thus has potential applicationsin development of general adapters and design of software platform in ATE.
Keywords:switch matrix  path search  BFS algorithm  Dijkstra algorithm  
本文献已被 CNKI 等数据库收录!
点击此处可从《科技导报(北京)》浏览原始摘要信息
点击此处可从《科技导报(北京)》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号