Row fixation is a parallel algorithm based on MPI that can be implemented on high performance computer system. It keeps the characteristics of matrices since row-computations are fixed on different nodes. Therefore t...Row fixation is a parallel algorithm based on MPI that can be implemented on high performance computer system. It keeps the characteristics of matrices since row-computations are fixed on different nodes. Therefore the locality of computation is realized effectively and the acceleration ratio is obtained very well for large scale parallel computations such as solving linear equations using Gaussian reduction method, LU decomposition of matrices and m-th power of matrices.展开更多
Path planning is important in the research of a mobile robot （MR）. Methods for it have been used in different applications. An automated guided vehicle（ AGV） , which is a kind of MR, is used in a flexible manufact...Path planning is important in the research of a mobile robot （MR）. Methods for it have been used in different applications. An automated guided vehicle（ AGV） , which is a kind of MR, is used in a flexible manufacturing system （FMS）. Path planning for it is essential to improve the efficiency of FMS. A new method was proposed with known obstacle space FMS in this paper. FMS is described by the Augmented Pos Matrix of a Machine （ APMM ） and Relative Pos Matrix of Machines （ RPMM）, which is smaller. The optimum path can be obtained according to the probability of the path and the maximal probability path. The suggested algorithm of path planning was good performance through simulation result： simplicity, saving time and reliability.展开更多
文摘Row fixation is a parallel algorithm based on MPI that can be implemented on high performance computer system. It keeps the characteristics of matrices since row-computations are fixed on different nodes. Therefore the locality of computation is realized effectively and the acceleration ratio is obtained very well for large scale parallel computations such as solving linear equations using Gaussian reduction method, LU decomposition of matrices and m-th power of matrices.
文摘Path planning is important in the research of a mobile robot （MR）. Methods for it have been used in different applications. An automated guided vehicle（ AGV） , which is a kind of MR, is used in a flexible manufacturing system （FMS）. Path planning for it is essential to improve the efficiency of FMS. A new method was proposed with known obstacle space FMS in this paper. FMS is described by the Augmented Pos Matrix of a Machine （ APMM ） and Relative Pos Matrix of Machines （ RPMM）, which is smaller. The optimum path can be obtained according to the probability of the path and the maximal probability path. The suggested algorithm of path planning was good performance through simulation result： simplicity, saving time and reliability.
