Literature DB >> 32043079

Quantizing Euclidean Motions via Double-Coset Decomposition.

Christian Wülker1, Sipu Ruan1, Gregory S Chirikjian1,2.   

Abstract

Concepts from mathematical crystallography and group theory are used here to quantize the group of rigid-body motions, resulting in a "motion alphabet" with which robot motion primitives are expressed. From these primitives it is possible to develop a dictionary of physical actions. Equipped with an alphabet of the sort developed here, intelligent actions of robots in the world can be approximated with finite sequences of characters, thereby forming the foundation of a language in which robot motion is articulated. In particular, we use the discrete handedness-preserving symmetries of macromolecular crystals (known in mathematical crystallography as Sohncke space groups) to form a coarse discretization of the space SE(3) of rigid-body motions. This discretization is made finer by subdividing using the concept of double-coset decomposition. More specifically, a very efficient, equivolumetric quantization of spatial motion can be defined using the group-theoretic concept of a double-coset decomposition of the form Γ\SE(3)/Δ, where Γ is a Sohncke space group and Δ is a finite group of rotational symmetries such as those of the icosahedron. The resulting discrete alphabet is based on a very uniform sampling of SE(3) and is a tool for describing the continuous trajectories of robots and humans. An efficient coarse-to-fine search algorithm is presented to round off any motion sampled from the continuous group of motions to the nearest element of our alphabet. It is shown that our alphabet and this efficient rounding algorithm can be used as a geometric data structure to accelerate the performance of other sampling schemes designed for desirable dispersion or discrepancy properties. Moreover, the general "signals to symbols" problem in artificial intelligence is cast in this framework for robots moving continuously in the world.
Copyright © 2019 Christian Wülker et al.

Entities:  

Year:  2019        PMID: 32043079      PMCID: PMC7006946          DOI: 10.34133/2019/1608396

Source DB:  PubMed          Journal:  Research (Wash D C)        ISSN: 2639-5274


  5 in total

1.  Using motion planning to study protein folding pathways.

Authors:  Nancy M Amato; Guang Song
Journal:  J Comput Biol       Date:  2002       Impact factor: 1.479

2.  A fast learning algorithm for deep belief nets.

Authors:  Geoffrey E Hinton; Simon Osindero; Yee-Whye Teh
Journal:  Neural Comput       Date:  2006-07       Impact factor: 2.026

3.  Mathematical aspects of molecular replacement. I. Algebraic properties of motion spaces.

Authors:  Gregory S Chirikjian
Journal:  Acta Crystallogr A       Date:  2011-07-06       Impact factor: 2.290

4.  Mathematical aspects of molecular replacement. IV. Measure-theoretic decompositions of motion spaces.

Authors:  Gregory S Chirikjian; Sajdeh Sajjadi; Bernard Shiffman; Steven M Zucker
Journal:  Acta Crystallogr A Found Adv       Date:  2017-08-15       Impact factor: 2.290

5.  Generating Uniform Incremental Grids on SO(3) Using the Hopf Fibration.

Authors:  Anna Yershova; Swati Jain; Steven M Lavalle; Julie C Mitchell
Journal:  Int J Rob Res       Date:  2010-06-01       Impact factor: 4.703

  5 in total

北京卡尤迪生物科技股份有限公司 © 2022-2023.