1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
|
/** \file itasc/kdl/jacobian.cpp
* \ingroup itasc
*/
// Copyright (C) 2007 Ruben Smits <ruben dot smits at mech dot kuleuven dot be>
// Version: 1.0
// Author: Ruben Smits <ruben dot smits at mech dot kuleuven dot be>
// Maintainer: Ruben Smits <ruben dot smits at mech dot kuleuven dot be>
// URL: http://www.orocos.org/kdl
// This library is free software; you can redistribute it and/or
// modify it under the terms of the GNU Lesser General Public
// License as published by the Free Software Foundation; either
// version 2.1 of the License, or (at your option) any later version.
// This library is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
// Lesser General Public License for more details.
// You should have received a copy of the GNU Lesser General Public
// License along with this library; if not, write to the Free Software
// Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
#include "jacobian.hpp"
namespace KDL
{
Jacobian::Jacobian(unsigned int _size,unsigned int _nr_blocks):
size(_size),nr_blocks(_nr_blocks)
{
twists = new Twist[size*nr_blocks];
}
Jacobian::Jacobian(const Jacobian& arg):
size(arg.columns()),
nr_blocks(arg.nr_blocks)
{
twists = new Twist[size*nr_blocks];
for(unsigned int i=0;i<size*nr_blocks;i++)
twists[i] = arg.twists[i];
}
Jacobian& Jacobian::operator = (const Jacobian& arg)
{
assert(size==arg.size);
assert(nr_blocks==arg.nr_blocks);
for(unsigned int i=0;i<size;i++)
twists[i]=arg.twists[i];
return *this;
}
Jacobian::~Jacobian()
{
delete [] twists;
}
double Jacobian::operator()(int i,int j)const
{
assert(i<6*(int)nr_blocks&&j<(int)size);
return twists[j+6*(int)(floor((double)i/6))](i%6);
}
double& Jacobian::operator()(int i,int j)
{
assert(i<6*(int)nr_blocks&&j<(int)size);
return twists[j+6*(int)(floor((double)i/6))](i%6);
}
unsigned int Jacobian::rows()const
{
return 6*nr_blocks;
}
unsigned int Jacobian::columns()const
{
return size;
}
void SetToZero(Jacobian& jac)
{
for(unsigned int i=0;i<jac.size*jac.nr_blocks;i++)
SetToZero(jac.twists[i]);
}
void changeRefPoint(const Jacobian& src1, const Vector& base_AB, Jacobian& dest)
{
assert(src1.size==dest.size);
assert(src1.nr_blocks==dest.nr_blocks);
for(unsigned int i=0;i<src1.size*src1.nr_blocks;i++)
dest.twists[i]=src1.twists[i].RefPoint(base_AB);
}
void changeBase(const Jacobian& src1, const Rotation& rot, Jacobian& dest)
{
assert(src1.size==dest.size);
assert(src1.nr_blocks==dest.nr_blocks);
for(unsigned int i=0;i<src1.size*src1.nr_blocks;i++)
dest.twists[i]=rot*src1.twists[i];
}
void changeRefFrame(const Jacobian& src1,const Frame& frame, Jacobian& dest)
{
assert(src1.size==dest.size);
assert(src1.nr_blocks==dest.nr_blocks);
for(unsigned int i=0;i<src1.size*src1.nr_blocks;i++)
dest.twists[i]=frame*src1.twists[i];
}
bool Jacobian::operator ==(const Jacobian& arg)
{
return Equal((*this),arg);
}
bool Jacobian::operator!=(const Jacobian& arg)
{
return !Equal((*this),arg);
}
bool Equal(const Jacobian& a,const Jacobian& b,double eps)
{
if(a.rows()==b.rows()&&a.columns()==b.columns()){
bool rc=true;
for(unsigned int i=0;i<a.columns();i++)
rc&=Equal(a.twists[i],b.twists[i],eps);
return rc;
}else
return false;
}
}
|
