On the Existence of a Cycloidal Burmester Theory in Planar Kinematics

1964 ◽  
Vol 31 (4) ◽  
pp. 694-699 ◽  
Author(s):  
George N. Sandor

One of the basic theories of kinematic synthesis, namely, Burmester’s classical centerpoint-circlepoint theory, is shown to be one of several special cases of a broader, more general new theory, involving points of the moving plane whose several corresponding positions lie on cycloidal curves. These curves may be generated by “cycloidal cranks.” Such “cycloidpoints,” centers of their generating circles (“circlepoints”) and base circles (“centerpoints”) are proposed to be called “Burmester point trios” (BPT’s). In case of 6 prescribed arbitrary positions, such BPT’s appear to lie, respectively, on three higher plane curves proposed to be called “cycloidpoint,” “circlepoint” and “centerpoint curves,” or, collectively, “generalized Burmester curves.” In the case of hypocycloidal cranks with “Cardanic” proportions, the hypocycloids become ellipses. For 7 prescribed positions, the number of BPT’s is finite. Application to linkage synthesis for motion generation with prescribed order and timing is presented and cognate-motion generator linkages, based on multiple generation of cycloidal curves, are shown to exist. Analytical derivations are outlined for the equations of the “generalized Burmester curves,” and possible further specializations and generalizations are indicated.

1968 ◽  
Vol 35 (1) ◽  
pp. 40-46 ◽  
Author(s):  
George N. Sandor

The basic concepts of a general method of kinematic synthesis of space mechanisms are developed by means of vectors and quaternion operators applicable to path, function, and motion generation (body guidance) for finite and infinitesimal displacements (point, order, and combined point-order approximations). For writing the position equations, space mechanisms are represented by one or more loops of a general kinematic chain of ball-jointed bar-slideball members. Appropriate mathematical constraints on the relative freedom of these members render the general chain equivalent to the represented mechanism. The method leads to a system of equations of canonical simplicity, uniform for all tasks of finite spatial synthesis, often yielding closed-form linear solutions for small numbers of precision conditions. The same system of equations is then used to refine the solution for greater precision by numerical methods. Typical applications are indicated, some involving the use of a spatial finite circlepoint-center point theory, which includes classical planar Burmester theory as one of its special cases. An earlier general complex-number method of planar synthesis is shown to be a special case of the general spatial method introduced here.


1966 ◽  
Vol 33 (4) ◽  
pp. 927-933 ◽  
Author(s):  
G. N. Sandor

A kinematic theory is developed involving infinitesimally close coplanar positions of a moving plane, based on a finite cycloidal kinematic theory of plane motion, which was shown to include Burmester’s classical centerpoint-circlepoint theory as one of several special cases. The infinitesimal theory is developed for both the general cycloidal and for the special circular (Burmester) cases. Applications are derived for closed-form analytic synthesis of higher-order approximate path and motion generator linkages. Examples are given, and implementations of the theory in the form of computer programs are made available.


Author(s):  
Jin Yao ◽  
Liju Xu ◽  
Shou-wen Fan

Abstract A method is presented for kinematical synthesis of an RS-SRR-SS adjustable spatial motion generator for three alternate tasks. Three separate systems of synthesis equations to exactly generate the first and the last positions for each task are obtained for the R-S by co-plane and constant distance conditions, for the S-R-R by co-plane, constant distance conditions and inversion theory, and for S-S by constant distance condition. Based on these equations, mathematical model for approximately generating the intermediate positions for each task is formulated. This method is characterized by reduction of the unknowns and equations in both exact and approximate syntheses. As a result, computing work is to be decreased obviously.


2017 ◽  
Vol 14 (01) ◽  
pp. 1650022 ◽  
Author(s):  
Tianwei Zhang ◽  
Stéphane Caron ◽  
Yoshihiko Nakamura

Stair climbing is still a challenging task for humanoid robots, especially in unknown environments. In this paper, we address this problem from perception to execution. Our first contribution is a real-time plane-segment estimation method using Lidar data without prior models of the staircase. We then integrate this solution with humanoid motion planning. Our second contribution is a stair-climbing motion generator where estimated plane segments are used to compute footholds and stability polygons. We evaluate our method on various staircases. We also demonstrate the feasibility of the generated trajectories in a real-life experiment with the humanoid robot HRP-4.


Author(s):  
Badreddine Aboulissane ◽  
Dikra El Haiek ◽  
Larbi El Bakkali

The objective of kinematic synthesis is to determine the mechanism dimensions such as link lengths, positions or joint coordinates, in order to approximate its output parameters such as link positions, trajectory points, and displacement angles. Kinematic synthesis is classified into three categories: function generation, path generation, and motion generation. This paper is dedicated only to path generation. As the number of trajectory points increases, analytical methods are limited to obtain precisely mechanism solutions. In that case, numerical methods are more efficient to solve such problems. Our study proposes an improved heuristic algorithm applied to four-bar mechanism path-generation. The objective of this work is to find optimum dimensions of the mechanism and minimize the error between the generated trajectory and the desired one, taking into consideration constraints such as: Grashof condition, transmission angle, and design variables constraints. Finally, our results are compared with those found by other evolutionary algorithms in the literature.


1986 ◽  
Vol 108 (3) ◽  
pp. 292-299 ◽  
Author(s):  
G. N. Sandor ◽  
S. P. Yang ◽  
L. J. Xu ◽  
P. De

Purely mechanical, single-actuator adaptive hard-automation modules can perform highly repetitive simple tasks much more economically, energy-efficiently and accurately than multi-degree-of-freedom, multiple-actuator robotic manipulators. As an example, an RS-SRR-SS adjustable spatial motion generator is synthesized by analytical methods with two exact prescribed positions (including orientations) for each of two different motion tasks, by numerical methods to solve a nonlinear system of equations and by optimization techniques to minimize the motion errors at additional, approximately prescribed positions.


2002 ◽  
Vol 14 (2) ◽  
pp. 177-185 ◽  
Author(s):  
Eiichi Yoshida ◽  
◽  
Satoshi Murata ◽  
Akiya Kamimura ◽  
Kohji Tomita ◽  
...  

We discuss motion generation of a homogeneous modular robot called a Modular Transformer (M-TRAN). Modules are designed to be self-reconfigurable so a collection of modules can transform itself into a robotic structure. The motion generation of the self-reconfigurable robot presents a computationally difficult problem due to the many combinatorial possibilities for the module configuration, even though the module itself is simple, with 2 degrees of freedom. We describe a motion generation for a class of multimodule structures based on a motion planner and a motion scheduler. The motion planner has 2 layers, with a global planner to plan overall movement of the cluster and a local planner to determine locally coordinated module motions, called motion schemes. After motion is generated as a sequence of single motion schemes, the motion scheduler processes the output plan to allow parallel motions to improve efficiency. The effectiveness of the motion generator is verified through a multiple-module simulation.


1961 ◽  
Vol 28 (1) ◽  
pp. 41-49 ◽  
Author(s):  
Ferdinand Freudenstein ◽  
George N. Sandor

The paper is divided into three parts concerned with the Burmester points associated with five distinct positions of a plane. In the first part, “Theory,” an equation is derived for the location of the Burmester points; algebraic and geometric properties of these points are deduced and special cases considered. An automatic digital-computer program is described in the second part, “Computation,” using a parametric form of the equation for the Burmester points. In the third part, “Application,” the analytical form of Burmester theory is applied to the solution of a variety of problems in plane kinematic synthesis in one uniform manner.


Sign in / Sign up

Export Citation Format

Share Document