Difference between revisions of "RotorcraftMixing"
Line 147: | Line 147: | ||
The above computation can be performed using the following simple octave script (sudo apt-get install octave3.2) | The above computation can be performed using the following simple octave script (sudo apt-get install octave3.2) | ||
octave | |||
copy the flowing commands in the terminal: (ncol is the number of col from matrix B. in this example = 3 ) | |||
exit | |||
<pre> | <pre> |
Revision as of 02:47, 23 June 2011
This page describe how to compute "mixing" for an arbitrary multirotors configuration.
Introduction
"Mixing" consist in converting rotational accelerations commands computed by the autopilot into throttle commands for each of the motor controllers.
Let us consider a vehicle comprising a set of identical fixed pitch rotors located at coordinates and spinning in the same plane in the direction at a rotational speed .
Assuming a quasi hovering regime, the force produced by each rotor can be considered normal to the rotor plane and proportional to the square of its rotational speed. Expressed in body frame ( front, right, down ), this leads to
Under the same assumption, the torque produced by each rotor can also be assumed to be in the same direction and proportional to the square of the rotational speed.
The torque produced by each rotor around the CG, expressed in body frame can then be writen
Where is a "thrust" coefficient and is a "torque" coefficient. It has been measured experimentally that on a mikrokopter.
As a first approximation we can consider that the rotational speed of the propeller is proportional to the square root of the applied command
This allows us to express the torque produced by the set of rotors as
which can be rewriten as a matrix vector product
is a matrix describing the geometric positions of our rotors and is the vector of throttle commands for our set of motor controllers.
In order to express the command applied to each power train as a function of the momentum we want to apply to our vehicle, we need to find , a matrix such as
If has rank 3, we know that such a matrix exists (yeah, we can't do 2 rotors or have all rotors aligned), and in this case, we have the relationship
We know that one solution of this equation is the Moore-Penrose pseudoinverse of . Furthermore, this solution is the one leading to the power train command vector having the smallest euclidian norm, which is interesting as it optimizes the repartion of our control effort across our power trains.
Example
Let's consider the following H hexarotors configuration.
The first two lines of the matrix represent the coordinates of each rotor in the plan, and the third line the direction in which they spin.
Normalizing columns of yelds
which in turns yelds the following supervision section
<section name="SUPERVISION" prefix="SUPERVISION_"> <define name="MIN_MOTOR" value="3"/> <define name="MAX_MOTOR" value="200"/> <define name="TRIM_A" value="0"/> <define name="TRIM_E" value="0"/> <define name="TRIM_R" value="0"/> <define name="NB_MOTOR" value="6"/> <define name="SCALE" value="256"/> <define name="ROLL_COEF" value="{ -67, 67, -256, 256, -189, 189}"/> <define name="PITCH_COEF" value="{ -256, -256, 0, 0, 256, 256}"/> <define name="YAW_COEF" value="{ -154, 154, 256, -256, -115, 115}"/> <define name="THRUST_COEF" value="{ 256, 256, 256, 256, 256, 256}"/> </section>
The above computation can be performed using the following simple octave script (sudo apt-get install octave3.2)
octave copy the flowing commands in the terminal: (ncol is the number of col from matrix B. in this example = 3 ) exit
A = [ 0.17 -0.17 0.25 -0.25 0.33 -0.33 -0.35 -0.35 0. 0. 0.35 0.35 -0.1 0.1 0.1 -0.1 -0.1 0.1 ]; B = pinv(A) m = max(B) [nrow,ncol] = size(B) for i=1:ncol Btilde(:,i) = B(:,i)/m(i); end Btilde = round(256*Btilde)