矩阵描述的位置控制方法及其存储效率分析
张鑫;容晓峰
【期刊名称】《西安工业大学学报》 【年(卷),期】2014(000)003
【摘要】使用计算机实现位置控制时，为了便于程序处理，可利用矩阵对位置点分布及其属性进行描述。将矩阵元素与每一个位置点对应，通过遍历矩阵元素即可对位置点进行处理。根据属性值进行坐标到实际位移量的转化即实现位置控制。存储矩阵时为避免过多占用内存，可以对矩阵进行压缩存储。元素值的特点决定了压缩矩阵时既可以压缩零元也可以压缩非零元，两种压缩法的有效性取决于矩阵稀疏因子的大小。计算结果表明，当矩阵稀疏因子小于25％时应压缩零元，稀疏因子大于75％时应压缩非零元。%When a computer is used to control a component’s position on a platform ,a matrix can be used to describe the distribution and property of the location points .T he elements of the matrix correspond to the location points .The element's value identifies the property of the location points and the subscript corresponds with the position coordinate of the location point . Each location point ’ s attribute can be read by traversing the matrix element and the actual displacement is decided by the attribute value .To avoid wasting storage space when the high-level matrix is stored ,a method for compressed storage is proposed according to the characteristics of the elements’ value .The calculating results show that the matrix can be compressed effectively w hen the sparse matrix factor
矩阵描述的位置控制方法及其存储效率分析
