A Displacement-Rotation Algorithm

  • A
  • Thread starter Thread starter Muhammad
  • Start date Start date
Muhammad
Messages
4
Reaction score
0
The attached sketch shows an object which can move in x-y plane and rotate around z axis only. The movements are small and in the order of micrometers.

Point a, b and c are the locations of measurement. Each of these points have measuring devices which can give linear displacement in micrometers.

If the object is displaced by external force, the measuring devices will give linear displacement values. However, with these 3 displacement values, I would like to develop an algorithm which can give me overall displacement of the object along x and y axes as well rotation around z axis.

rotation matrix interpretation.webp
 
Physics news on Phys.org
You have three vector equations of the form <br /> a&#039; = R_z(\theta)a + t which gives six equations in three unknowns; this system is overdetermined and may not have a solution. Your best option is to choose \theta and t to minimize the error <br /> \|a&#039; - R_z(\theta)a - t\|^2 + \|b&#039; - R_z(\theta)b - t\|^2 + \|c&#039; - R_z(\theta)c - t\|^2
 
Thank you for your reply.
 
##\textbf{Exercise 10}:## I came across the following solution online: Questions: 1. When the author states in "that ring (not sure if he is referring to ##R## or ##R/\mathfrak{p}##, but I am guessing the later) ##x_n x_{n+1}=0## for all odd $n$ and ##x_{n+1}## is invertible, so that ##x_n=0##" 2. How does ##x_nx_{n+1}=0## implies that ##x_{n+1}## is invertible and ##x_n=0##. I mean if the quotient ring ##R/\mathfrak{p}## is an integral domain, and ##x_{n+1}## is invertible then...
The following are taken from the two sources, 1) from this online page and the book An Introduction to Module Theory by: Ibrahim Assem, Flavio U. Coelho. In the Abelian Categories chapter in the module theory text on page 157, right after presenting IV.2.21 Definition, the authors states "Image and coimage may or may not exist, but if they do, then they are unique up to isomorphism (because so are kernels and cokernels). Also in the reference url page above, the authors present two...
When decomposing a representation ##\rho## of a finite group ##G## into irreducible representations, we can find the number of times the representation contains a particular irrep ##\rho_0## through the character inner product $$ \langle \chi, \chi_0\rangle = \frac{1}{|G|} \sum_{g\in G} \chi(g) \chi_0(g)^*$$ where ##\chi## and ##\chi_0## are the characters of ##\rho## and ##\rho_0##, respectively. Since all group elements in the same conjugacy class have the same characters, this may be...
Back
Top