This paper addresses the direct kinematics of a special class of the 6-6 SPS Stewart manipulators in which the mobile and base platforms are two similar semisymmetrical *** proposing a mathematical model of the direct...
详细信息
This paper addresses the direct kinematics of a special class of the 6-6 SPS Stewart manipulators in which the mobile and base platforms are two similar semisymmetrical *** proposing a mathematical model of the direct kinematic problem of this class of the 6-6 SPS Stewart manipulators,a multivariate polynomial equations set with respect to the moving platform position parameters and orientation parameters is constructed in which input-parameters are design parameters and six given link-lengths of this special class of the Stewart *** on this multivariate polynomial equations set,the 'complete analytical expression of the solutions which have in total at most 28 in the complex domain,to the direct kinematics of this special class of the Stewart manipulators can be easily and directly solved by utilizing a sophisticated commercial symbolic computation software,*** results have shown that not only this approach presented in this paper is simple and efficient than existing approaches,but also an arduous and complicated derivation and solving task can be avoided and a lot of computation time can be *** of the direct kinematics analysis of a 6-6 SPS Stewart manipulator under investigation are given to demonstrate the aforementioned theoretical *** kinematics analysis of this special class of the 6-6 SPS Stewart manipulators paves underlying theoretical grounds for the workspace analysis,path planning and control of this class of the Stewart manipulators.
In this paper,we make an approach to the logic optimization algorithm including two-valued logic optimization algorithm and multi-valued logic optimization algorithm,then present the algorithm to calculate essential p...
详细信息
In this paper,we make an approach to the logic optimization algorithm including two-valued logic optimization algorithm and multi-valued logic optimization algorithm,then present the algorithm to calculate essential prime cube and special relative redundancy cube and construct two-valued logic *** discuss the algorithm converting two-valued logic into multi-valued logic on the basis of building an assignment graph and present multi-valued logic optimization algorithm,we analyze and study logic function mini-covering based on studying the relevant theory of the multi-valued logic optimization which including the identification of judging macrocosm,the identification of essential prime implicants and relative redundancy and absolute redundancy implicants,and so *** design and realize a software system on logic optimization in programming language C. It overpasses testing of Benchmark and fight validate and it shows that the function of the software system on logic optimization is perfect and the optimization efficiency is so high viaw testing.
To solve the problem of mining weighted traversal patterns(WTPs)with noisy weight from weighted directed graph(WDG),an effective algorithm,called SWSPMiner(Statistical theory-based Weighted Sequential Patterns Miner),...
详细信息
To solve the problem of mining weighted traversal patterns(WTPs)with noisy weight from weighted directed graph(WDG),an effective algorithm,called SWSPMiner(Statistical theory-based Weighted Sequential Patterns Miner),is *** algorithm undergoes two phases to discover WSPs from the traversals on *** the first phase,it adopts the weight's confidence interval(CI) to delete the vertices with noisy weights from the traversal database(TDB), which reduce remarkably the size of *** the second phase,based on the property that the items in a traversal pattern are consecutive,the algorithm regards a traversal pattern as a sequence *** the algorithm adopts an improved weighted prefix-projected pattern growth approach to decompose the task of mining original sequence database into a series of smaller tasks of mining locally projected database and pushes the weight constraint into the mining process so as to efficiently discover fewer but more important WTPs, Comprehensive experimental results show that the algorithm is efficient and scalable for mining sequential patterns from traversals on the ***,the algorithm can be applied to various applications which can be modeled as a WDG.
暂无评论