A new passive wheel type of biped ice-skater robot (BISR) subjected to nonholonomic constraints was presented on the basis of ice-skating principle. Its motion principle and construction were discussed. After the mode...A new passive wheel type of biped ice-skater robot (BISR) subjected to nonholonomic constraints was presented on the basis of ice-skating principle. Its motion principle and construction were discussed. After the model was simplified and the coordinate systems were established, the motion differential equations of the robot were obtained with the generalized Lagrange-Maggi equation when the nonholonomic constraints existed. Actual examples were given and the result was simulated on computer.展开更多
An algorithm for solving the satisfiability problem is presented. It isproceed that this algorithm solves 2-SAT and Horn-SAT in linear time and k-positiveSAT (in which every clause contains at most k positive literals...An algorithm for solving the satisfiability problem is presented. It isproceed that this algorithm solves 2-SAT and Horn-SAT in linear time and k-positiveSAT (in which every clause contains at most k positive literals) ill time O(F.),where F is the length of input F, n is the number of atoms occurring in F, and k isthe greatest real number satisfying the equation x = 2-. Compared with previousresults, this nontrivial upper bound on time complexity could only be obtained fork-SAT, which is a subproblem of k-positive SAT.展开更多
文摘A new passive wheel type of biped ice-skater robot (BISR) subjected to nonholonomic constraints was presented on the basis of ice-skating principle. Its motion principle and construction were discussed. After the model was simplified and the coordinate systems were established, the motion differential equations of the robot were obtained with the generalized Lagrange-Maggi equation when the nonholonomic constraints existed. Actual examples were given and the result was simulated on computer.
文摘An algorithm for solving the satisfiability problem is presented. It isproceed that this algorithm solves 2-SAT and Horn-SAT in linear time and k-positiveSAT (in which every clause contains at most k positive literals) ill time O(F.),where F is the length of input F, n is the number of atoms occurring in F, and k isthe greatest real number satisfying the equation x = 2-. Compared with previousresults, this nontrivial upper bound on time complexity could only be obtained fork-SAT, which is a subproblem of k-positive SAT.
