-
Notifications
You must be signed in to change notification settings - Fork 92
Expand file tree
/
Copy pathgoal_types.cpp
More file actions
273 lines (261 loc) · 12.2 KB
/
goal_types.cpp
File metadata and controls
273 lines (261 loc) · 12.2 KB
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
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
/*********************************************************************
* Software License Agreement (BSD License)
*
* Copyright (c) 2016-2017, Philipp Sebastian Ruppel
* All rights reserved.
*
* 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 the copyright holder 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 AND CONTRIBUTORS
* "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.
*********************************************************************/
#include <bio_ik/goal_types.h>
#include <geometric_shapes/bodies.h>
#include <geometric_shapes/shapes.h>
#include <mutex>
namespace bio_ik
{
#if (MOVEIT_FCL_VERSION < FCL_VERSION_CHECK(0, 6, 0))
void TouchGoal::describe(GoalContext& context) const
{
LinkGoalBase::describe(context);
auto* robot_model = &context.getRobotModel();
{
static std::map<const moveit::core::RobotModel*, CollisionModel*> collision_cache;
if(collision_cache.find(robot_model) == collision_cache.end()) collision_cache[&context.getRobotModel()] = new CollisionModel();
collision_model = collision_cache[robot_model];
collision_model->collision_links.resize(robot_model->getLinkModelCount());
}
link_model = robot_model->getLinkModel(this->getLinkName());
size_t link_index = link_model->getLinkIndex();
auto touch_goal_normal = normal.normalized();
// auto fbrot = fb.rot.normalized();
auto& collision_link = collision_model->collision_links[link_index];
if(!collision_link.initialized)
{
collision_link.initialized = true;
collision_link.shapes.resize(link_model->getShapes().size());
for(size_t shape_index = 0; shape_index < link_model->getShapes().size(); shape_index++)
{
collision_link.shapes[shape_index] = std::make_shared<CollisionShape>();
auto& s = *collision_link.shapes[shape_index];
s.frame = Frame(link_model->getCollisionOriginTransforms()[shape_index]);
auto* shape = link_model->getShapes()[shape_index].get();
// LOG(link_model->getName(), shape_index, link_model->getShapes().size(), typeid(*shape).name());
if(auto* mesh = dynamic_cast<const shapes::Mesh*>(shape))
{
struct : bodies::ConvexMesh
{
std::vector<fcl::Vec3f> points;
std::vector<int> polygons;
std::vector<fcl::Vec3f> plane_normals;
std::vector<double> plane_dis;
void init(const shapes::Shape* shape)
{
type_ = shapes::MESH;
scaled_vertices_ = nullptr;
{
static std::mutex mutex;
std::lock_guard<std::mutex> lock(mutex);
setDimensions(shape);
}
for(const auto& v : getVertices())
points.emplace_back(v.x(), v.y(), v.z());
const auto& triangles = getTriangles();
for(size_t triangle_index = 0; triangle_index < triangles.size() / 3; triangle_index++)
{
polygons.push_back(3);
polygons.push_back(triangles[triangle_index * 3 + 0]);
polygons.push_back(triangles[triangle_index * 3 + 1]);
polygons.push_back(triangles[triangle_index * 3 + 2]);
}
// planes are given in the same order as the triangles, though redundant ones will appear only once.
for(const auto& plane : getPlanes())
{
// planes stored as Eigen::Vector4d(nx, ny, nz, d)
plane_normals.emplace_back(plane.x(), plane.y(), plane.z());
plane_dis.push_back(plane.w());
}
}
} convex;
convex.init(mesh);
s.points = convex.points;
s.polygons = convex.polygons;
s.plane_normals = convex.plane_normals;
s.plane_dis = convex.plane_dis;
// auto* fcl = new fcl::Convex(s.plane_normals.data(), s.plane_dis.data(), s.plane_normals.size(), s.points.data(), s.points.size(), s.polygons.data());
// workaround for fcl::Convex initialization bug
auto* fcl = (fcl::Convex*)::operator new(sizeof(fcl::Convex));
fcl->num_points = s.points.size();
fcl = new(fcl) fcl::Convex(s.plane_normals.data(), s.plane_dis.data(), s.plane_normals.size(), s.points.data(), s.points.size(), s.polygons.data());
s.geometry = decltype(s.geometry)(new collision_detection::FCLGeometry(fcl, link_model, shape_index));
s.edges.resize(s.points.size());
std::vector<std::unordered_set<size_t>> edge_sets(s.points.size());
for(size_t edge_index = 0; edge_index < fcl->num_edges; edge_index++)
{
auto edge = fcl->edges[edge_index];
if(edge_sets[edge.first].find(edge.second) == edge_sets[edge.first].end())
{
edge_sets[edge.first].insert(edge.second);
s.edges[edge.first].push_back(edge.second);
}
if(edge_sets[edge.second].find(edge.first) == edge_sets[edge.second].end())
{
edge_sets[edge.second].insert(edge.first);
s.edges[edge.second].push_back(edge.first);
}
}
for(auto& p : s.points)
s.vertices.emplace_back(p[0], p[1], p[2]);
}
else
{
s.geometry = collision_detection::createCollisionGeometry(link_model->getShapes()[shape_index], link_model, shape_index);
}
// LOG("b");
}
// getchar();
}
}
double TouchGoal::evaluate(const GoalContext& context) const
{
double dmin = DBL_MAX;
context.getTempVector().resize(1);
auto& last_collision_vertex = context.getTempVector()[0];
auto& fb = context.getLinkFrame();
size_t link_index = link_model->getLinkIndex();
auto& collision_link = collision_model->collision_links[link_index];
for(size_t shape_index = 0; shape_index < link_model->getShapes().size(); shape_index++)
{
if(!collision_link.shapes[shape_index]->geometry) continue;
auto* shape = link_model->getShapes()[shape_index].get();
// LOG(shape_index, typeid(*shape).name());
if(auto* mesh = dynamic_cast<const shapes::Mesh*>(shape))
{
auto& s = collision_link.shapes[shape_index];
double d = DBL_MAX;
auto goal_normal = normal;
quat_mul_vec(fb.rot.inverse(), goal_normal, goal_normal);
quat_mul_vec(s->frame.rot.inverse(), goal_normal, goal_normal);
/*{
size_t array_index = 0;
for(size_t vertex_index = 0; vertex_index < mesh->vertex_count; vertex_index++)
{
double dot_x = mesh->vertices[array_index++] * goal_normal.x();
double dot_y = mesh->vertices[array_index++] * goal_normal.y();
double dot_z = mesh->vertices[array_index++] * goal_normal.z();
double e = dot_x + dot_y + dot_z;
if(e < d) d = e;
}
}*/
if(mesh->vertex_count > 0)
{
size_t vertex_index = last_collision_vertex;
double vertex_dot_normal = goal_normal.dot(s->vertices[vertex_index]);
// size_t loops = 0;
while(true)
{
bool repeat = false;
for(auto vertex_index_2 : s->edges[vertex_index])
{
auto vertex_dot_normal_2 = goal_normal.dot(s->vertices[vertex_index_2]);
if(vertex_dot_normal_2 < vertex_dot_normal)
{
vertex_index = vertex_index_2;
vertex_dot_normal = vertex_dot_normal_2;
repeat = true;
break;
}
}
if(!repeat) break;
// loops++;
}
// LOG_VAR(loops);
d = vertex_dot_normal;
last_collision_vertex = vertex_index;
}
d -= normal.dot(position - fb.pos);
// ROS_INFO("touch goal");
if(d < dmin) dmin = d;
}
else
{
double offset = 10000;
static fcl::Sphere shape1(offset);
fcl::DistanceRequest request;
fcl::DistanceResult result;
auto pos1 = position - normal * offset * 2;
auto* shape2 = collision_link.shapes[shape_index]->geometry->collision_geometry_.get();
auto frame2 = Frame(fb.pos, fb.rot.normalized()) * collision_link.shapes[shape_index]->frame;
double d = fcl::distance(&shape1, fcl::Transform3f(fcl::Vec3f(pos1.x(), pos1.y(), pos1.z())), shape2, fcl::Transform3f(fcl::Quaternion3f(frame2.rot.w(), frame2.rot.x(), frame2.rot.y(), frame2.rot.z()), fcl::Vec3f(frame2.pos.x(), frame2.pos.y(), frame2.pos.z())), request, result);
d -= offset;
if(d < dmin) dmin = d;
}
}
return dmin * dmin;
}
#endif
void BalanceGoal::describe(GoalContext& context) const
{
Goal::describe(context);
balance_infos.clear();
double total = 0.0;
for(auto& link_name : context.getRobotModel().getLinkModelNames())
{
auto link_urdf = context.getRobotModel().getURDF()->getLink(link_name);
if(!link_urdf) continue;
if(!link_urdf->inertial) continue;
const auto& center_urdf = link_urdf->inertial->origin.position;
tf2::Vector3 center(center_urdf.x, center_urdf.y, center_urdf.z);
double mass = link_urdf->inertial->mass;
if(!(mass > 0)) continue;
balance_infos.emplace_back();
balance_infos.back().center = center;
balance_infos.back().weight = mass;
total += mass;
context.addLink(link_name);
}
for(auto& b : balance_infos)
{
b.weight /= total;
}
}
double BalanceGoal::evaluate(const GoalContext& context) const
{
tf2::Vector3 center(0, 0, 0);
for(size_t i = 0; i < balance_infos.size(); i++)
{
auto& info = balance_infos[i];
auto& frame = context.getLinkFrame(i);
auto c = info.center;
quat_mul_vec(frame.rot, c, c);
c += frame.pos;
center += c * info.weight;
}
center -= target_;
center -= axis_ * axis_.dot(center);
return center.length2();
}
}