Hostname: page-component-7b7567c8c-tnzcf Total loading time: 0 Render date: 2026-11-14T11:44:37.010Z Has data issue: false hasContentIssue false

Deconvolution on the Euclidean motion group and planar robotic manipulator design

Published online by Cambridge University Press:  15 January 2009

Peter T. Kim*
Affiliation:
Department of Mathematics and Statistics, University of Guelph, Guelph, Ontario N1G 2W1Canada.
Yan Liu
Affiliation:
Google New York, 76 9th Ave. 4th Floor New York, NY 10011.
Zhi-Ming Luo
Affiliation:
Department of Mathematics and Statistics, University of Guelph, Guelph, Ontario N1G 2W1Canada.
Yunfeng Wang
Affiliation:
Department of Mechanical Engineering, The College of New Jersey, Ewing, NJ 08628-0718, USA.
*
*Corresponding author. E-mail: pkim@uoguelph.ca
Rights & Permissions [Opens in a new window]

Summary

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

Several problems of practical interest in robotics can be modelled as the convolution of functions on the Euclidean motion group. These include the evaluation of reachable positions and orientations at the distal end of a robot manipulator arm. A natural inverse problem arises when one wishes to design rather than to model manipulators. Namely, by considering a serial-chain robot arm as a concatenation of segments, we examine how statistics of known segments can be used to select, or design, the remainder of the structure so as to attain the desired statistical properties of the whole structure. This is then a deconvolution density estimation problem for the Euclidean motion group. We prove several results about the convergence of these deconvolution estimators to the true underlying density under certain smoothness assumptions. A practical implementation to the design of planar robot arms is demonstrated.

Information

Type
Article
Copyright
Copyright © Cambridge University Press 2009