Mech541 Kinematic Synthesis

Total Page:16

File Type:pdf, Size:1020Kb

Mech541 Kinematic Synthesis MECH541 KINEMATIC SYNTHESIS Lecture Notes Jorge Angeles Department of Mechanical Engineering & Centre for Intelligent Machines McGill University, Montreal (Quebec), Canada Shaoping Bai Department of Mechanical Engineering Aalborg University Aalborg, Denmark c January 2016 These lecture notes are not as yet in final form. Please report corrections & suggestions to Prof. J. Angeles Department of Mechanical Engineering & McGill Centre for Intelligent Machines McGill University 817 Sherbrooke St. W. Montreal, Quebec CANADA H3A 0C3 FAX: (514) 398-7348 [email protected] Contents 1 Introduction to Kinematic Synthesis 5 1.1 The Role of Kinematic Synthesis in Mechanical Design . 5 1.2 Glossary..................................... 9 1.3 Kinematic Analysis vs. Kinematic Synthesis . 12 1.3.1 ASummaryofSystemsofAlgebraicEquations . 14 1.4 Algebraic and Computational Tools . 15 1.4.1 The Two-Dimensional Representation of the Cross Product ................................. 15 1.4.2 Algebra of 2 2Matrices ....................... 17 × 1.4.3 Algebra of 3 3Matrices ....................... 18 × 1.4.4 Linear-Equation Solving: Determined Systems . 18 1.4.5 Linear-Equation Solving: Overdetermined Systems . 22 1.5 Nonlinear-equation Solving: the Determined Case . .. 32 1.5.1 TheNewton-RaphsonMethod . 34 1.6 Overdetermined Nonlinear Systems of Equations . ... 35 1.6.1 TheNewton-GaussMethod . 35 1.7 SoftwareTools.................................. 38 1.7.1 ODA:MatlabandCcodeforOptimumDesign . 38 1.7.2 Packages Relevant to Linkage Synthesis . 40 2 The Qualitative Synthesis of Kinematic Chains 45 2.1 Notation..................................... 45 2.2 Background ................................... 46 2.3 KinematicPairs................................. 51 2.4 Graph Representation of Kinematic Chains . 54 2.5 GroupsofDisplacements ............................ 56 2.5.1 DisplacementSubgroups . 60 2.6 KinematicBonds ................................ 64 2.7 The Chebyshev-Gr¨ubler-Kutzbach-Herv´eFormula . ....... 66 2.7.1 Trivial Chains . 67 i 2.7.2 ExceptionalChains ........................... 71 2.7.3 ParadoxicalChains ........................... 74 2.8 ApplicationstoRobotics ............................ 74 2.8.1 The Synthesis of Robotic Architectures and Their Drives . 74 3 Function Generation 79 3.1 Introduction................................... 79 3.2 Input-OutputFunctions ............................ 80 3.2.1 PlanarFour-BarLinkages . 80 3.2.2 TheDenavit-HartenbergNotation. 83 3.2.3 SphericalFour-Bar-Linkages . 84 3.2.4 SpatialFour-Bar-Linkages . 89 3.3 ExactSynthesis ................................. 93 3.3.1 PlanarLinkages............................. 93 3.3.2 SphericalLinkages ........................... 98 3.3.3 SpatialLinkages.............................100 3.4 Analysis of the Synthesized Linkage . 101 3.4.1 PlanarLinkages.............................101 3.4.2 SphericalFour-BarLinkages . .112 3.4.3 SpatialFour-BarLinkages . .114 3.5 ApproximateSynthesis .............................121 3.5.1 The Approximate Synthesis of Planar Four-Bar Linkages . 124 3.5.2 The Approximate Synthesis of Spherical Linkages . 126 3.5.3 The Approximate Synthesis of Spatial Linkages . 127 3.6 LinkagePerformanceEvaluation. 131 3.6.1 Planar Linkages: Transmission Angle and Transmission Quality . 131 3.6.2 Spherical Linkages: Transmission Angle and Transmission Quality . 136 3.6.3 Spatial Linkages: Transmission Angle and Transmission Quality . 137 3.7 DesignErrorvs.StructuralError . 139 3.7.1 Minimizing the Structural Error . 142 3.8 Synthesis Under Mobility Constraints . 145 3.9 SynthesisofComplexLinkages. .146 3.9.1 SynthesisofStephensonLinkages . 146 4 Motion Generation 147 4.1 Introduction...................................147 4.2 PlanarFour-barLinkages. .. .. .147 4.2.1 DyadSynthesisforThreePoses . 149 4.2.2 DyadSynthesisforFourPoses . .149 4.2.3 DyadSynthesisforFivePoses . .152 ii 4.2.4 Case Study: Synthesis of a Landing Gear Mechanism . 153 4.2.5 The Presence of a P JointinDyadSynthesis . 159 4.2.6 ApproximateSynthesis . .164 4.3 SphericalFour-barLinkages . 169 4.3.1 DyadSynthesisforThreeAttitudes . 171 4.3.2 DyadSynthesisforFourAttitudes. 172 4.3.3 DyadSynthesisFiveAttitudes. 173 4.3.4 Spherical Dyads with a P Joint ....................174 4.3.5 ApproximateDyadSynthesis . .175 4.3.6 Examples ................................181 4.4 SpatialFour-barLinkages . .. .. .187 5 Path Generation 189 5.1 Introduction...................................189 5.2 PlanarPathGeneration ............................190 5.3 Planar Path Generation With Prescribed Timing . 192 5.4 CouplerCurvesofPlanarFour-BarLinkages . 197 5.5 TheTheoremofRoberts-Chebyshev. 201 A A Summary of Dual Algebra 203 A.1 Introduction...................................203 A.2 Definitions....................................204 A.3 Fundamentals of Rigid-Body Kinematics . 208 A.3.1 Finite Displacements . 209 A.3.2 Velocity Analysis . 217 A.3.3 The Linear Invariants of the Dual Rotation Matrix . 219 A.3.4 The Dual Euler-Rodrigues Parameters of a Rigid-Body Motion . 224 A.4 TheDualAngularVelocity. .229 A.5 Conclusions ...................................235 Bibliography 237 Index 247 iii iv Chapter 1 Introduction to Kinematic Synthesis 1.1 The Role of Kinematic Synthesis in Mechanical Design When designing a mechanical system, whether a structure or a machine, the first step is to produce a conceptual design that will meet the design specifications. Broadly speaking, the main function of a structure is to be capable of withstanding the anticipated loads without exhibiting major deformations that would hamper the integrity of the structure or the safety of its occupants. Likewise, the main function of a machine is to be able to perform the intended task, usually involving finite displacements of its parts, without major deformations that would hamper the integrity of the machine or the safety of its users. To be true, mechanical systems exhibit, more often that not, features of both structures and mechanisms. Such examples occur in transportation machinery, such as landing gears in aircraft. Figure 1.1 illustrates the structure of the deployed landing gear of the Airbus A300-600 aircraft. In this posture, the landing gear works as a structure, to withstand not only the static load of the airplane on the tarmac, but also the dynamic load exerted by the unavoidable impact upon landing. Transportation machinery is a domain in which mechanisms, especially linkages— the focus of this course—plays a major role. Shown in Fig. 1.2 is a depiction of the powertrain of a Class-C Mercedes Benz. A key subsystem of the system in question— the powertrain—is the steering linkage, whose main components are visible in the figure. Again, this mechanism plays the dual role of a structure and a machine, as its function is not only to properly orient the planes of the front wheels upon turning, but also to support the wheels and the loads transmitted by the ground onto the vehicle frame. In the above preamble we have introduced concepts of engineering design as pertaining to mechanical systems at large. Of these, we have focused on structures and machines. In fact, design, together with manufacturing, is the raison d’ˆetre of engineers, all disciplines 5 Figure 1.1: The landing gear of an Airbus A300-600 known as engineering science, namely, mechanics, thermofluids and numerics, to name but just the major branches, playing a supporting role in the production process. For this reason it is necessary to dwell on this concept. Because of its importance, the engineering design process has been the subject of study over the centuries, starting with Marcus Vitruvius Polio (ca. 75 BCE–ca. 15 CE) and his 10-volume work under the title De Architectura (Vitruvius, 28 B.C.E.). Modern engineering design theory owes its origins, to a great extent, to Franz Reuleaux (1829–1905), who first proposed a grammar to describe the kinematic chain of a machine (Moon, 2003). A modern model of the design process, due to French (1992), is depicted in Fig. 1.3. In this model, four stages are distinguished: a) analysis of the problem; b) conceptual design; c) embodiment design; and d) detailing, or detailed design. In the first stage, analysis of the problem, the functions required from the object under design, in our case, a machine, are clearly defined, in general, but precise terms. At this stage, the task of the design engineer is to produce a) design requirements, in terms as general as possible, in order to avoid biasing the design team towards a specific layout of the solution, and b) design specifications, so as to satisfy the rather vaguely spelled-out needs of the client. In the second stage, the design team produces a set of design variants, as rich as 6 Figure 1.2: A view of the powertrain of a C-Class Mercedes Benz possible, after several sessions, structured or unstructured, which are part of the creative aspect of the design process. In the third stage, the design team focuses on a reduced set of design variants, those having the highest likelihood of succeeding in satisfying the client’s demands within the resources—budget, milestones, technology—set at the disposal of the design team. In this stage, the task of the team is to produce a preliminary model of the design solution, with a clear identification of the main parameters defining a specific design variant. Further, a parametric model of each of the short-listed candidate variants is produced, which is then subject to optimization with the aim of finding the specific fundamental dimensions that either
Recommended publications
  • Abstract Structural Synthesis and Analysis Of
    ABSTRACT Title of dissertation: STRUCTURAL SYNTHESIS AND ANALYSIS OF PLANAR AND SPATIAL MECHANISMS SATISFYING GRUEBLER’S DEGREES OF FREEDOM EQUATION Rajesh Pavan Sunkari Doctor of Philosophy, 2006 Dissertation directed by: Dr. Linda Schmidt Department of Mechanical Engineering Design of mechanisms is an important branch of the theory of mechanical design. Kinematic structural studies play an important role in the design of mech- anisms. These studies consider only the interconnectivity pattern of the individual links and hence, these studies are unaffected by the changes in the geometric prop- erties of the mechanisms. The three classical problems in this area and the focus of this work are: synthesis of all non-isomorphic kinematic mechanisms; detection of all non-isomorphic pairs of mechanisms; and, classification of kinematic mecha- nisms based on type of mobility. Also, one of the important steps in the synthesis of kinematic mechanisms is the elimination of degenerate or rigid mechanisms. The computational complexity of these problems increases exponentially as the num- ber of links in a mechanism increases. There is a need for efficient algorithms for solving these classical problems. This dissertation illustrates the successful use of techniques from graph theory and combinatorial optimization to solve structural kinematic problems. An efficient algorithm is developed to synthesize all non-isomorphic planar kinematic mechanisms by adapting a McKay-type graph generation algorithm in combination with a degeneracy testing algorithm. This synthesis algorithm is about 13 times faster than the most recent synthesis algorithm reported in the literature. There exist efficient approaches for detection of non-isomorphic mechanisms based on eigenvalues and eigenvectors of the adjacency or related matrices.
    [Show full text]
  • Hyper-Dual Numbers for Exact Second-Derivative Calculations
    49th AIAA Aerospace Sciences Meeting including the New Horizons Forum and Aerospace Exposition AIAA 2011-886 4 - 7 January 2011, Orlando, Florida The Development of Hyper-Dual Numbers for Exact Second-Derivative Calculations Jeffrey A. Fike∗ andJuanJ.Alonso† Department of Aeronautics and Astronautics Stanford University, Stanford, CA 94305 The complex-step approximation for the calculation of derivative information has two significant advantages: the formulation does not suffer from subtractive cancellation er- rors and it can provide exact derivatives without the need to search for an optimal step size. However, when used for the calculation of second derivatives that may be required for approximation and optimization methods, these advantages vanish. In this work, we develop a novel calculation method that can be used to obtain first (gradient) and sec- ond (Hessian) derivatives and that retains all the advantages of the complex-step method (accuracy and step-size independence). In order to accomplish this task, a new number system which we have named hyper-dual numbers and the corresponding arithmetic have been developed. The properties of this number system are derived and explored, and the formulation for derivative calculations is presented. Hyper-dual number arithmetic can be applied to arbitrarily complex software and allows the derivative calculations to be free from both truncation and subtractive cancellation errors. A numerical implementation on an unstructured, parallel, unsteady Reynolds-Averaged Navier Stokes (URANS) solver,
    [Show full text]
  • A Nestable Vectorized Templated Dual Number Library for C++11
    cppduals: a nestable vectorized templated dual number library for C++11 Michael Tesch1 1 Department of Chemistry, Technische Universität München, 85747 Garching, Germany DOI: 10.21105/joss.01487 Software • Review Summary • Repository • Archive Mathematical algorithms in the field of optimization often require the simultaneous com- Submitted: 13 May 2019 putation of a function and its derivative. The derivative of many functions can be found Published: 05 November 2019 automatically, a process referred to as automatic differentiation. Dual numbers, close rela- License tives of the complex numbers, are of particular use in automatic differentiation. This library Authors of papers retain provides an extremely fast implementation of dual numbers for C++, duals::dual<>, which, copyright and release the work when replacing scalar types, can be used to automatically calculate a derivative. under a Creative Commons A real function’s value can be made to carry the derivative of the function with respect to Attribution 4.0 International License (CC-BY). a real argument by replacing the real argument with a dual number having a unit dual part. This property is recursive: replacing the real part of a dual number with more dual numbers results in the dual part’s dual part holding the function’s second derivative. The dual<> type in this library allows this nesting (although we note here that it may not be the fastest solution for calculating higher order derivatives.) There are a large number of automatic differentiation libraries and classes for C++: adolc (Walther, 2012), FAD (Aubert & Di Césaré, 2002), autodiff (Leal, 2019), ceres (Agarwal, Mierle, & others, n.d.), AuDi (Izzo, Biscani, Sánchez, Müller, & Heddes, 2019), to name a few, with another 30-some listed at (autodiff.org Bücker & Hovland, 2019).
    [Show full text]
  • Application of Dual Quaternions on Selected Problems
    APPLICATION OF DUAL QUATERNIONS ON SELECTED PROBLEMS Jitka Prošková Dissertation thesis Supervisor: Doc. RNDr. Miroslav Láviˇcka, Ph.D. Plze ˇn, 2017 APLIKACE DUÁLNÍCH KVATERNIONU˚ NA VYBRANÉ PROBLÉMY Jitka Prošková Dizertaˇcní práce Školitel: Doc. RNDr. Miroslav Láviˇcka, Ph.D. Plze ˇn, 2017 Acknowledgement I would like to thank all the people who have supported me during my studies. Especially many thanks belong to my family for their moral and material support and my advisor doc. RNDr. Miroslav Láviˇcka, Ph.D. for his guidance. I hereby declare that this Ph.D. thesis is completely my own work and that I used only the cited sources. Plzeˇn, July 20, 2017, ........................... i Annotation In recent years, the study of quaternions has become an active research area of applied geometry, mainly due to an elegant and efficient possibility to represent using them ro- tations in three dimensional space. Thanks to their distinguished properties, quaternions are often used in computer graphics, inverse kinematics robotics or physics. Furthermore, dual quaternions are ordered pairs of quaternions. They are especially suitable for de- scribing rigid transformations, i.e., compositions of rotations and translations. It means that this structure can be considered as a very efficient tool for solving mathematical problems originated for instance in kinematics, bioinformatics or geodesy, i.e., whenever the motion of a rigid body defined as a continuous set of displacements is investigated. The main goal of this thesis is to provide a theoretical analysis and practical applications of the dual quaternions on the selected problems originated in geometric modelling and other sciences or various branches of technical practise.
    [Show full text]
  • Vector Bundles and Brill–Noether Theory
    MSRI Series Volume 28, 1995 Vector Bundles and Brill{Noether Theory SHIGERU MUKAI Abstract. After a quick review of the Picard variety and Brill–Noether theory, we generalize them to holomorphic rank-two vector bundles of canonical determinant over a compact Riemann surface. We propose sev- eral problems of Brill–Noether type for such bundles and announce some of our results concerning the Brill–Noether loci and Fano threefolds. For example, the locus of rank-two bundles of canonical determinant with five linearly independent global sections on a non-tetragonal curve of genus 7 is a smooth Fano threefold of genus 7. As a natural generalization of line bundles, vector bundles have two important roles in algebraic geometry. One is the moduli space. The moduli of vector bun- dles gives connections among different types of varieties, and sometimes yields new varieties that are difficult to describe by other means. The other is the linear system. In the same way as the classical construction of a map to a pro- jective space, a vector bundle gives rise to a rational map to a Grassmannian if it is generically generated by its global sections. In this article, we shall de- scribe some results for which vector bundles play such roles. They are obtained from an attempt to generalize Brill–Noether theory of special divisors, reviewed in Section 2, to vector bundles. Our main subject is rank-two vector bundles with canonical determinant on a curve C with as many global sections as pos- sible: especially their moduli and the Grassmannian embeddings of C by them (Section 4).
    [Show full text]
  • Use of Continuation Methods for Kinematic Synthesis and Analysis Thiagaraj Subbian Iowa State University
    Iowa State University Capstones, Theses and Retrospective Theses and Dissertations Dissertations 1990 Use of continuation methods for kinematic synthesis and analysis Thiagaraj Subbian Iowa State University Follow this and additional works at: https://lib.dr.iastate.edu/rtd Part of the Mechanical Engineering Commons Recommended Citation Subbian, Thiagaraj, "Use of continuation methods for kinematic synthesis and analysis " (1990). Retrospective Theses and Dissertations. 9898. https://lib.dr.iastate.edu/rtd/9898 This Dissertation is brought to you for free and open access by the Iowa State University Capstones, Theses and Dissertations at Iowa State University Digital Repository. It has been accepted for inclusion in Retrospective Theses and Dissertations by an authorized administrator of Iowa State University Digital Repository. For more information, please contact [email protected]. INFORMATION TO USERS The most advanced technology has been used to photograph and reproduce this manuscript from the microfilm master. UMI films the text directly from the original or copy submitted. Thus, some thesis and dissertation copies are in typewriter face, while others may be from any type of computer printer. The quality of this reproduction is dependent upon the quality of the copy submitted. Broken or indistinct print, colored or poor quality illustrations and photographs, print bleedthrough, substandard margins, and improper alignment can adversely affect reproduction. In the unlikely event that the author did not send UMI a complete manuscript and there are missing pages, these will be noted. Also, if unauthorized copyright material had to be removed, a note will indicate the deletion. Oversize materials (e.g., maps, drawings, charts) are reproduced by sectioning the original, beginning at the upper left-hand corner and continuing from left to right in equal sections with small overlaps.
    [Show full text]
  • Exploring Mathematical Objects from Custom-Tailored Mathematical Universes
    Exploring mathematical objects from custom-tailored mathematical universes Ingo Blechschmidt Abstract Toposes can be pictured as mathematical universes. Besides the standard topos, in which most of mathematics unfolds, there is a colorful host of alternate toposes in which mathematics plays out slightly differently. For instance, there are toposes in which the axiom of choice and the intermediate value theorem from undergraduate calculus fail. The purpose of this contribution is to give a glimpse of the toposophic landscape, presenting several specific toposes and exploring their peculiar properties, and to explicate how toposes provide distinct lenses through which the usual mathematical objects of the standard topos can be viewed. Key words: topos theory, realism debate, well-adapted language, constructive mathematics Toposes can be pictured as mathematical universes in which we can do mathematics. Most mathematicians spend all their professional life in just a single topos, the so-called standard topos. However, besides the standard topos, there is a colorful host of alternate toposes which are just as worthy of mathematical study and in which mathematics plays out slightly differently (Figure 1). For instance, there are toposes in which the axiom of choice and the intermediate value theorem from undergraduate calculus fail, toposes in which any function R ! R is continuous and toposes in which infinitesimal numbers exist. The purpose of this contribution is twofold. 1. We give a glimpse of the toposophic landscape, presenting several specific toposes and exploring their peculiar properties. 2. We explicate how toposes provide distinct lenses through which the usual mathe- matical objects of the standard topos can be viewed.
    [Show full text]
  • Kinematic Synthesis of a Well Service Machine
    View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by The Research Repository @ WVU (West Virginia University) Graduate Theses, Dissertations, and Problem Reports 2001 Kinematic synthesis of a well service machine Prashanth Kaparthi West Virginia University Follow this and additional works at: https://researchrepository.wvu.edu/etd Recommended Citation Kaparthi, Prashanth, "Kinematic synthesis of a well service machine" (2001). Graduate Theses, Dissertations, and Problem Reports. 1197. https://researchrepository.wvu.edu/etd/1197 This Thesis is protected by copyright and/or related rights. It has been brought to you by the The Research Repository @ WVU with permission from the rights-holder(s). You are free to use this Thesis in any way that is permitted by the copyright and related rights legislation that applies to your use. For other uses you must obtain permission from the rights-holder(s) directly, unless additional rights are indicated by a Creative Commons license in the record and/ or on the work itself. This Thesis has been accepted for inclusion in WVU Graduate Theses, Dissertations, and Problem Reports collection by an authorized administrator of The Research Repository @ WVU. For more information, please contact [email protected]. Kinematic Synthesis of a Well Service Machine Prashanth Kaparthi Thesis submitted to the College of Engineering and Mineral Resources at West Virginia University in partial fulfillment of the requirements for the degree of Master of Science in Mechanical Engineering Kenneth H. Means, Ph.D., Chair Gary J. Morris, Ph.D. Scott Wayne, Ph.D. Department of Mechanical and Aerospace Engineering Morgantown, West Virginia 2001 Keywords: Kinematic Synthesis, Four-position, Burmester, Four-bar, ADAMS ABSTRACT Kinematic Synthesis of a Well Service Machine Prashanth Kaparthi Blowout preventers are used in the oil well industry to prevent accidental oil fires and flare ups.
    [Show full text]
  • Math Book from Wikipedia
    Math book From Wikipedia PDF generated using the open source mwlib toolkit. See http://code.pediapress.com/ for more information. PDF generated at: Mon, 25 Jul 2011 10:39:12 UTC Contents Articles 0.999... 1 1 (number) 20 Portal:Mathematics 24 Signed zero 29 Integer 32 Real number 36 References Article Sources and Contributors 44 Image Sources, Licenses and Contributors 46 Article Licenses License 48 0.999... 1 0.999... In mathematics, the repeating decimal 0.999... (which may also be written as 0.9, , 0.(9), or as 0. followed by any number of 9s in the repeating decimal) denotes a real number that can be shown to be the number one. In other words, the symbols 0.999... and 1 represent the same number. Proofs of this equality have been formulated with varying degrees of mathematical rigour, taking into account preferred development of the real numbers, background assumptions, historical context, and target audience. That certain real numbers can be represented by more than one digit string is not limited to the decimal system. The same phenomenon occurs in all integer bases, and mathematicians have also quantified the ways of writing 1 in non-integer bases. Nor is this phenomenon unique to 1: every nonzero, terminating decimal has a twin with trailing 9s, such as 8.32 and 8.31999... The terminating decimal is simpler and is almost always the preferred representation, contributing to a misconception that it is the only representation. The non-terminating form is more convenient for understanding the decimal expansions of certain fractions and, in base three, for the structure of the ternary Cantor set, a simple fractal.
    [Show full text]
  • Generalisations of Singular Value Decomposition to Dual-Numbered
    Generalisations of Singular Value Decomposition to dual-numbered matrices Ran Gutin Department of Computer Science Imperial College London June 10, 2021 Abstract We present two generalisations of Singular Value Decomposition from real-numbered matrices to dual-numbered matrices. We prove that every dual-numbered matrix has both types of SVD. Both of our generalisations are motivated by applications, either to geometry or to mechanics. Keywords: singular value decomposition; linear algebra; dual num- bers 1 Introduction In this paper, we consider two possible generalisations of Singular Value Decom- position (T -SVD and -SVD) to matrices over the ring of dual numbers. We prove that both generalisations∗ always exist. Both types of SVD are motivated by applications. A dual number is a number of the form a + bǫ where a,b R and ǫ2 = 0. The dual numbers form a commutative, assocative and unital∈ algebra over the real numbers. Let D denote the dual numbers, and Mn(D) denote the ring of n n dual-numbered matrices. × arXiv:2007.09693v7 [math.RA] 9 Jun 2021 Dual numbers have applications in automatic differentiation [4], mechanics (via screw theory, see [1]), computer graphics (via the dual quaternion algebra [5]), and geometry [10]. Our paper is motivated by the applications in geometry described in Section 1.1 and in mechanics given in Section 1.2. Our main results are the existence of the T -SVD and the existence of the -SVD. T -SVD is a generalisation of Singular Value Decomposition that resembles∗ that over real numbers, while -SVD is a generalisation of SVD that resembles that over complex numbers.
    [Show full text]
  • Chapter 8, New Methods for Kinematic Synthesis
    Chapter 9 New Methods for Kinematic Synthesis Results that describe new methods for kniematic synthesis presented at various conferences and in archival journals are reprinted in slightly modified form in the following sections. The material presented in the first paper was disseminated in the Proceedings of the International Federation of Machines and Mechanisms (IFToMM) Tenth World Congress on the Theory of Machines and Mechanisms, in Oulu, Finland in a paper entitled \The Effect of Data-set Cardinality on the Design and Structural Errors of Four-bar Function-generators" [1]. This paper presents the initial observation that as the input-output (IO) data-set cardinality increases the Euclidean norms of the design and structural errors converge. The important implication is that the minimisation of the Euclidean norm of the structural error can be accomplished indirectly via the minimisation of the corresponding norm of the design error provided that a suitably large number of input-output pairs is prescribed. The second paper, entitled \Continuous Approximate Synthesis of Planar Function-generators Minimising the Design Error" [2], first appeared in the archival journal Mechanism and Machine Theory in June 2016. In this pa- per the synthesis equations are integrated in the range between minimum and maximum input values, thereby reposing the discrete approximate synthesis problem as a continuous one. Moreover, it is proved that a lower bound of the Euclidean norm, and indeed of any p-norm, of the design error for planar RRRR function-generating linkages exists and is attained with continuous approximate synthesis. 1 2 CHAPTER 9. NEW METHODS FOR KINEMATIC SYNTHESIS The third paper, \Solving the Burmester Problem Using Kinematic Map- ping" [3], initially appeared in the Proceedings of the American Society of Me- chanical Engineers (ASME) Design Engineering Technical Conferences: Mech- anisms Conference, and was presented in Montr´eal,QC, Canada in September 2002.
    [Show full text]
  • Dual Quaternion Sample Reduction for SE(2) Estimation
    Dual Quaternion Sample Reduction for SE(2) Estimation Kailai Li, Florian Pfaff, and Uwe D. Hanebeck Intelligent Sensor-Actuator-Systems Laboratory (ISAS) Institute for Anthropomatics and Robotics Karlsruhe Institute of Technology (KIT), Germany [email protected], fl[email protected], [email protected] Abstract—We present a novel sample reduction scheme for random variables belonging to the SE(2) group by means of Dirac mixture approximation. For this, dual quaternions are employed to represent uncertain planar transformations. The Cramer–von´ Mises distance is modified as a smooth metric to measure the statistical distance between Dirac mixtures on the manifold of planar dual quaternions. Samples of reduced size are then ob- tained by minimizing the probability divergence via Riemannian optimization while interpreting the correlation between rotation and translation. We further deploy the proposed scheme for non- parametric modeling of estimates for nonlinear SE(2) estimation. Simulations show superior tracking performance of the sample reduction-based filter compared with Monte Carlo-based as well as parametric model-based planar dual quaternion filters. Figure 1: Examples of the proposed sample reduction tech- I. INTRODUCTION nique for planar rigid motions. Here, 2000 random samples Estimation of planar motions is ubiquitous and play a (yellow) drawn from different underlying distributions are fundamental role in many application scenarios, such as optimally approximated by 20 samples (blue) on the manifold odometry and scene reconstruction, object tracking as well of planar dual quaternions. as remote sensing, etc [1]–[5]. Planar motions, incorporating both rotations and translations on a plane, are mathematically described by elements belonging to the two-dimensional spe- which can be easily violated under large noise levels (e.g., cial Euclidean group SE(2).
    [Show full text]