-
Notifications
You must be signed in to change notification settings - Fork 1.2k
/
convex_set.cc
59 lines (47 loc) · 1.78 KB
/
convex_set.cc
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
#include "drake/geometry/optimization/convex_set.h"
#include <algorithm>
#include <limits>
#include <memory>
namespace drake {
namespace geometry {
namespace optimization {
ConvexSet::ConvexSet(
std::function<std::unique_ptr<ConvexSet>(const ConvexSet&)> cloner,
int ambient_dimension)
: cloner_(std::move(cloner)), ambient_dimension_(ambient_dimension) {
DRAKE_DEMAND(ambient_dimension >= 0);
}
ConvexSet::~ConvexSet() = default;
std::unique_ptr<ConvexSet> ConvexSet::Clone() const { return cloner_(*this); }
std::vector<solvers::Binding<solvers::Constraint>>
ConvexSet::AddPointInNonnegativeScalingConstraints(
solvers::MathematicalProgram* prog,
const Eigen::Ref<const solvers::VectorXDecisionVariable>& x,
const symbolic::Variable& t) const {
DRAKE_DEMAND(x.size() == ambient_dimension());
std::vector<solvers::Binding<solvers::Constraint>> constraints =
DoAddPointInNonnegativeScalingConstraints(prog, x, t);
constraints.emplace_back(prog->AddBoundingBoxConstraint(
0, std::numeric_limits<double>::infinity(), t));
return constraints;
}
std::vector<const ConvexSet*> ConvexSetsFromOwned(
const std::vector<std::unique_ptr<ConvexSet>>& owned) {
std::vector<const ConvexSet*> sets;
std::transform(owned.begin(), owned.end(), back_inserter(sets),
[](const std::unique_ptr<ConvexSet>& o) { return o.get(); });
return sets;
}
ConvexSets::ConvexSets() = default;
ConvexSets::~ConvexSets() = default;
const ConvexSet& ConvexSets::emplace_back(const ConvexSet& set) {
sets_.emplace_back(set.Clone());
return *sets_.back();
}
const ConvexSet& ConvexSets::emplace_back(std::unique_ptr<ConvexSet> set) {
sets_.emplace_back(std::move(set));
return *sets_.back();
}
} // namespace optimization
} // namespace geometry
} // namespace drake