06.02.2013 Views

Underwater Robots - Gianluca Antonelli.pdf

Underwater Robots - Gianluca Antonelli.pdf

Underwater Robots - Gianluca Antonelli.pdf

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

230 9. Coordinated Control of Platoons of AUVs<br />

σ a = f a ( η 1 , 1 ,...,η 1 ,n) = 1<br />

n<br />

n�<br />

i =1<br />

η 1 ,i = p , (9.6)<br />

whose Jacobian matrix J a ∈ IR 3 × 3 n can be easily derived [28].<br />

Task Function for Platoon Variance<br />

Together with the platoon average position, it is of interest considering the<br />

variance of all the vehicles’ positions as asynthetic data on their spreading<br />

around the average position. It is clear that by controlling these two task<br />

variablesitispossible to influencethe shape of theplatoon. The task function<br />

for platoon variance σ v ∈ IR 3 is defined as<br />

σ v = 1<br />

n<br />

n�<br />

i =1<br />

( η 1 ,i − p ) 2 . (9.7)<br />

In [28] the Jacobian J v is provided; moreover, different tasks, such as<br />

keeping the platoon in abounded geometrical area or in arigid formation,<br />

are discussed.<br />

Merging Several Tasks<br />

Different task functions may beused at the same time by stacking the corresponding<br />

single-task variables inanoverall task vector. As aresult, the<br />

corresponding single-task Jacobians are stacked too in an overall task Jacobian,<br />

and the inverse solution (9.3) acts bysimply adding the partial vehicles’<br />

velocities that would be obtained if (locally atthe current configuration) each<br />

task were executedalone. It is simple to recognize that this approach is poorly<br />

effective since conflicting tasks would generate counteracting partial vehicles’<br />

velocities.<br />

Apossible technique to handle this problem has been proposed in [50],<br />

which consists inassigning arelative priority tothe single task functions,<br />

thus resorting to the task-priority inverse kinematics introduced in[196, 210]<br />

for ground-fixed redundant manipulators. Nevertheless, as discussed in [78],<br />

just in case of conflicting tasks itisnecessary to devise singularity-robust<br />

algorithms that ensure proper behavior of the inverse velocity mapping. For<br />

this reason, according to [78], G. <strong>Antonelli</strong> and S.Chiaverini propose to<br />

modify the CLIK solution (9.4) into<br />

v d ( t k )=J † �<br />

�<br />

p ˙σ p,d + Λ p ( σ p,d− σ p ) + � I − J † p J p<br />

� J † s<br />

�<br />

�<br />

˙σ s,d + Λ s ( σ s,d− σ s ) , (9.8)<br />

where the subscript p denotes primary-task quantities, the subscript s<br />

denotes secondary-task quantities, and Λ p , Λ s are suitable positive definite<br />

matrices. The extension to ageneric number of tasks can be easily derived.<br />

Equation (9.8) has anice geometrical interpretation. Each task is projected<br />

onto the vehicles’ velocityspace by the use of the correspondingpseudoinverse,i.e.,<br />

as if it were actingalone; then,before addingthe two contributions,

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!