Cargando…

Quantizing Euclidean Motions via Double-Coset Decomposition

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...

Descripción completa

Detalles Bibliográficos
Autores principales: Wülker, Christian, Ruan, Sipu, Chirikjian, Gregory S.
Formato: Online Artículo Texto
Lenguaje:English
Publicado: AAAS 2019
Materias:
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7006946/
https://www.ncbi.nlm.nih.gov/pubmed/32043079
http://dx.doi.org/10.34133/2019/1608396
_version_ 1783495236674125824
author Wülker, Christian
Ruan, Sipu
Chirikjian, Gregory S.
author_facet Wülker, Christian
Ruan, Sipu
Chirikjian, Gregory S.
author_sort Wülker, Christian
collection PubMed
description 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.
format Online
Article
Text
id pubmed-7006946
institution National Center for Biotechnology Information
language English
publishDate 2019
publisher AAAS
record_format MEDLINE/PubMed
spelling pubmed-70069462020-02-10 Quantizing Euclidean Motions via Double-Coset Decomposition Wülker, Christian Ruan, Sipu Chirikjian, Gregory S. Research (Wash D C) Research Article 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. AAAS 2019-09-15 /pmc/articles/PMC7006946/ /pubmed/32043079 http://dx.doi.org/10.34133/2019/1608396 Text en Copyright © 2019 Christian Wülker et al. https://creativecommons.org/licenses/by/4.0/ Exclusive licensee Science and Technology Review Publishing House. Distributed under a Creative Commons Attribution License (CC BY 4.0).
spellingShingle Research Article
Wülker, Christian
Ruan, Sipu
Chirikjian, Gregory S.
Quantizing Euclidean Motions via Double-Coset Decomposition
title Quantizing Euclidean Motions via Double-Coset Decomposition
title_full Quantizing Euclidean Motions via Double-Coset Decomposition
title_fullStr Quantizing Euclidean Motions via Double-Coset Decomposition
title_full_unstemmed Quantizing Euclidean Motions via Double-Coset Decomposition
title_short Quantizing Euclidean Motions via Double-Coset Decomposition
title_sort quantizing euclidean motions via double-coset decomposition
topic Research Article
url https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7006946/
https://www.ncbi.nlm.nih.gov/pubmed/32043079
http://dx.doi.org/10.34133/2019/1608396
work_keys_str_mv AT wulkerchristian quantizingeuclideanmotionsviadoublecosetdecomposition
AT ruansipu quantizingeuclideanmotionsviadoublecosetdecomposition
AT chirikjiangregorys quantizingeuclideanmotionsviadoublecosetdecomposition