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
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
|
//
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions
// are met:
// * Redistributions of source code must retain the above copyright
// notice, this list of conditions and the following disclaimer.
// * Redistributions in binary form must reproduce the above copyright
// notice, this list of conditions and the following disclaimer in the
// documentation and/or other materials provided with the distribution.
// * Neither the name of NVIDIA CORPORATION nor the names of its
// contributors may be used to endorse or promote products derived
// from this software without specific prior written permission.
//
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS ``AS IS'' AND ANY
// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR
// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY
// OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
//
// Copyright (c) 2008-2018 NVIDIA Corporation. All rights reserved.
// Copyright (c) 2004-2008 AGEIA Technologies, Inc. All rights reserved.
// Copyright (c) 2001-2004 NovodeX AG. All rights reserved.
#include "ExtD6Joint.h"
#include "ExtConstraintHelper.h"
#include "CmConeLimitHelper.h"
namespace physx
{
namespace Ext
{
PxU32 D6JointSolverPrep(Px1DConstraint* constraints,
PxVec3& body0WorldOffset,
PxU32 maxConstraints,
PxConstraintInvMassScale& invMassScale,
const void* constantBlock,
const PxTransform& bA2w,
const PxTransform& bB2w)
{
PX_UNUSED(maxConstraints);
using namespace joint;
PX_UNUSED(maxConstraints);
const D6JointData& data =
*reinterpret_cast<const D6JointData*>(constantBlock);
invMassScale = data.invMassScale;
const PxU32 SWING1_FLAG = 1<<PxD6Axis::eSWING1,
SWING2_FLAG = 1<<PxD6Axis::eSWING2,
TWIST_FLAG = 1<<PxD6Axis::eTWIST;
const PxU32 ANGULAR_MASK = SWING1_FLAG | SWING2_FLAG | TWIST_FLAG;
const PxU32 LINEAR_MASK = 1<<PxD6Axis::eX | 1<<PxD6Axis::eY | 1<<PxD6Axis::eZ;
const PxD6JointDrive* drives = data.drive;
PxU32 locked = data.locked, limited = data.limited, driving = data.driving;
PxTransform cA2w = bA2w.transform(data.c2b[0]);
PxTransform cB2w = bB2w.transform(data.c2b[1]);
body0WorldOffset = cB2w.p-bA2w.p;
ConstraintHelper g(constraints, cB2w.p-bA2w.p, cB2w.p-bB2w.p);
if(cA2w.q.dot(cB2w.q)<0) // minimum dist quat (equiv to flipping cB2bB.q, which we don't use anywhere)
cB2w.q = -cB2w.q;
PxTransform cB2cA = cA2w.transformInv(cB2w);
PX_ASSERT(data.c2b[0].isValid());
PX_ASSERT(data.c2b[1].isValid());
PX_ASSERT(cA2w.isValid());
PX_ASSERT(cB2w.isValid());
PX_ASSERT(cB2cA.isValid());
PxMat33 cA2w_m(cA2w.q), cB2w_m(cB2w.q);
// handy for swing computation
PxVec3 bX = cB2w_m[0], aY = cA2w_m[1], aZ = cA2w_m[2];
if(driving & ((1<<PxD6Drive::eX)|(1<<PxD6Drive::eY)|(1<<PxD6Drive::eZ)))
{
// TODO: make drive unilateral if we are outside the limit
PxVec3 posErr = data.drivePosition.p - cB2cA.p;
for(PxU32 i = 0; i < 3; i++)
{
// -driveVelocity because velTarget is child (body1) - parent (body0) and Jacobian is 1 for body0 and -1 for parent
if(driving & (1<<(PxD6Drive::eX+i)))
g.linear(cA2w_m[i], -data.driveLinearVelocity[i], posErr[i], drives[PxD6Drive::eX+i]);
}
}
if(driving & ((1<<PxD6Drive::eSLERP)|(1<<PxD6Drive::eSWING)|(1<<PxD6Drive::eTWIST)))
{
PxQuat d2cA_q = cB2cA.q.dot(data.drivePosition.q)>0 ? data.drivePosition.q : -data.drivePosition.q;
const PxVec3& v = data.driveAngularVelocity;
PxQuat delta = d2cA_q.getConjugate() * cB2cA.q;
if(driving & (1<<PxD6Drive::eSLERP))
{
PxVec3 velTarget = -cA2w.rotate(data.driveAngularVelocity);
PxVec3 axis[3] = { PxVec3(1.f,0,0), PxVec3(0,1.f,0), PxVec3(0,0,1.f) };
if(drives[PxD6Drive::eSLERP].stiffness!=0)
computeJacobianAxes(axis, cA2w.q * d2cA_q, cB2w.q); // converges faster if there is only velocity drive
for(PxU32 i = 0; i < 3; i++)
g.angular(axis[i], axis[i].dot(velTarget), -delta.getImaginaryPart()[i], drives[PxD6Drive::eSLERP], PxConstraintSolveHint::eSLERP_SPRING);
}
else
{
if(driving & (1<<PxD6Drive::eTWIST))
g.angular(bX, v.x, -2.0f * delta.x, drives[PxD6Drive::eTWIST]);
if(driving & (1<<PxD6Drive::eSWING))
{
PxVec3 err = delta.rotate(PxVec3(1.f,0,0));
if(!(locked & SWING1_FLAG))
g.angular(cB2w_m[1], v.y, err.z, drives[PxD6Drive::eSWING]);
if(!(locked & SWING2_FLAG))
g.angular(cB2w_m[2], v.z, -err.y, drives[PxD6Drive::eSWING]);
}
}
}
if (limited & ANGULAR_MASK)
{
PxQuat swing, twist;
Ps::separateSwingTwist(cB2cA.q,swing,twist);
// swing limits: if just one is limited: if the other is free, we support
// (-pi/2, +pi/2) limit, using tan of the half-angle as the error measure parameter.
// If the other is locked, we support (-pi, +pi) limits using the tan of the quarter-angle
// Notation: th == Ps::tanHalf, tq = tanQuarter
if(limited & SWING1_FLAG && limited & SWING2_FLAG)
{
const PxReal pad = data.swingLimit.isSoft() ? 0.0f : data.tqSwingPad;
Cm::ConeLimitHelper coneHelper(data.tqSwingZ, data.tqSwingY, pad);
PxVec3 axis;
PxReal error;
if(coneHelper.getLimit(swing, axis, error))
g.angularLimit(cA2w.rotate(axis),error,data.swingLimit);
}
else
{
const PxJointLimitCone &limit = data.swingLimit;
PxReal tqPad = data.tqSwingPad, thPad = data.thSwingPad;
if(limited & SWING1_FLAG)
{
if(locked & SWING2_FLAG)
g.quarterAnglePair(Ps::tanHalf(swing.y, swing.w), -data.tqSwingY, data.tqSwingY, tqPad, aY, limit);
else
g.halfAnglePair(tanHalfFromSin(-aZ.dot(bX)), -data.thSwingY, data.thSwingY, thPad, aZ.cross(bX), limit);
}
if(limited & SWING2_FLAG)
{
if(locked & SWING1_FLAG)
g.quarterAnglePair(Ps::tanHalf(swing.z, swing.w), -data.tqSwingZ, data.tqSwingZ, tqPad, aZ, limit);
else
g.halfAnglePair(tanHalfFromSin(aY.dot(bX)), -data.thSwingZ, data.thSwingZ, thPad, -aY.cross(bX), limit);
}
}
if(limited & TWIST_FLAG)
{
g.quarterAnglePair(Ps::tanHalf(twist.x, twist.w), data.tqTwistLow, data.tqTwistHigh, data.tqTwistPad,
cB2w_m[0], data.twistLimit);
}
}
if(limited & LINEAR_MASK)
{
PxVec3 limitDir = PxVec3(0);
for(PxU32 i = 0; i < 3; i++)
{
if(limited & (1<<(PxD6Axis::eX+i)))
limitDir += cA2w_m[i] * cB2cA.p[i];
}
PxReal distance = limitDir.magnitude();
if(distance > data.linearMinDist)
g.linearLimit(limitDir * (1.0f/distance), distance, data.linearLimit.value, data.linearLimit);
}
// we handle specially the case of just one swing dof locked
PxU32 angularLocked = locked & ANGULAR_MASK;
if(angularLocked == SWING1_FLAG)
{
g.angularHard(bX.cross(aZ), -bX.dot(aZ));
locked &= ~SWING1_FLAG;
}
else if(angularLocked == SWING2_FLAG)
{
locked &= ~SWING2_FLAG;
g.angularHard(bX.cross(aY), -bX.dot(aY));
}
g.prepareLockedAxes(cA2w.q, cB2w.q, cB2cA.p,locked&7, locked>>3);
return g.getCount();
}
}//namespace
}
|