DART 6.12.2
Loading...
Searching...
No Matches
Linkage.hpp
Go to the documentation of this file.
1/*
2 * Copyright (c) 2011-2021, The DART development contributors
3 * All rights reserved.
4 *
5 * The list of contributors can be found at:
6 * https://github.com/dartsim/dart/blob/master/LICENSE
7 *
8 * This file is provided under the following "BSD-style" License:
9 * Redistribution and use in source and binary forms, with or
10 * without modification, are permitted provided that the following
11 * conditions are met:
12 * * Redistributions of source code must retain the above copyright
13 * notice, this list of conditions and the following disclaimer.
14 * * Redistributions in binary form must reproduce the above
15 * copyright notice, this list of conditions and the following
16 * disclaimer in the documentation and/or other materials provided
17 * with the distribution.
18 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND
19 * CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES,
20 * INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
21 * MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
22 * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR
23 * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
24 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
25 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF
26 * USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED
27 * AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
28 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
29 * ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
30 * POSSIBILITY OF SUCH DAMAGE.
31 */
32
33#ifndef DART_DYNAMICS_LINKAGE_HPP_
34#define DART_DYNAMICS_LINKAGE_HPP_
35
36#include <unordered_set>
37
39
40namespace dart {
41namespace dynamics {
42
55{
56public:
58 struct Criteria
59 {
63 {
64 INCLUDE = 0,
66 EXCLUDE,
72 };
73
75 std::vector<BodyNode*> satisfy() const;
76
79 struct Target
80 {
82 Target(
83 BodyNode* _target = nullptr,
84 ExpansionPolicy _policy = INCLUDE,
85 bool _chain = false);
86
89
93
97 bool mChain;
98 };
99
103
111 std::vector<Target> mTargets;
112
118 struct Terminal
119 {
121 Terminal(BodyNode* _terminal = nullptr, bool _inclusive = true);
122
125
129 };
130
133 std::vector<Terminal> mTerminals;
134
136 Criteria() = default;
137
150 Criteria(
151 BodyNode* start,
152 BodyNode* target,
153 bool includeUpstreamParentJoint = false);
154
155 protected:
157 void refreshTerminalMap() const;
158
160 void expansionPolicy(
161 BodyNode* _start,
162 ExpansionPolicy _policy,
163 std::vector<BodyNode*>& _bns) const;
164
166 void expandDownstream(
167 BodyNode* _start,
168 std::vector<BodyNode*>& _bns,
169 bool _includeStart) const;
170
172 void expandUpstream(
173 BodyNode* _start,
174 std::vector<BodyNode*>& _bns,
175 bool _includeStart) const;
176
178 void expandToTarget(
179 const Target& _start,
180 const Target& _target,
181 std::vector<BodyNode*>& _bns) const;
182
184 std::vector<BodyNode*> climbToTarget(
185 BodyNode* _start, BodyNode* _target) const;
186
188 std::vector<BodyNode*> climbToCommonRoot(
189 const Target& _start, const Target& _target, bool _chain) const;
190
193 void trimBodyNodes(
194 std::vector<BodyNode*>& _bns, bool _chain, bool _movingUpstream) const;
195
197 mutable std::unordered_map<BodyNode*, bool> mMapOfTerminals;
198 };
199
201 static LinkagePtr create(
202 const Criteria& _criteria, const std::string& _name = "Linkage");
203
205 LinkagePtr cloneLinkage() const;
206
208 LinkagePtr cloneLinkage(const std::string& cloneName) const;
209
210 // To expose MetaSkeleton::cloneMetaSkeleton(), which takes no cloneName.
212
213 // Documentation inherited
215 const std::string& cloneName) const override;
216
219 bool isAssembled() const;
220
222 void reassemble();
223
225 void satisfyCriteria();
226
227protected:
230 Linkage(const Criteria& _criteria, const std::string& _name = "Linkage");
231
233 virtual void update();
234
237
240 std::vector<WeakBodyNodePtr> mParentBodyNodes;
241};
242
243} // namespace dynamics
244} // namespace dart
245
246#endif // DART_DYNAMICS_LINKAGE_HPP_
BodyNode class represents a single node of the skeleton.
Definition BodyNode.hpp:79
A Linkage is a ReferentialSkeleton with the special property that all the BodyNodes included in it fo...
Definition Linkage.hpp:55
LinkagePtr cloneLinkage() const
Creates and returns a clone of this Linkage.
Definition Linkage.cpp:550
void reassemble()
Revert the assembly of this Linkage to its original structure.
Definition Linkage.cpp:612
virtual void update()
Update any metadata needed by the Linkage or its derived classes.
Definition Linkage.cpp:645
void satisfyCriteria()
Redefine this Linkage so that its Criteria is satisfied.
Definition Linkage.cpp:622
std::vector< WeakBodyNodePtr > mParentBodyNodes
Recording of the parent BodyNodes that were held by each of the BodyNodes when the Linkage was constr...
Definition Linkage.hpp:240
MetaSkeletonPtr cloneMetaSkeleton() const
Creates an identical clone of this MetaSkeleton.
Definition MetaSkeleton.cpp:329
bool isAssembled() const
Returns false if the original assembly of this Linkage has been broken in some way.
Definition Linkage.cpp:599
static LinkagePtr create(const Criteria &_criteria, const std::string &_name="Linkage")
Create a Linkage with the given Criteria.
Definition Linkage.cpp:515
Criteria mCriteria
Criteria that defines the structure of this Linkage.
Definition Linkage.hpp:236
MetaSkeletonPtr cloneMetaSkeleton() const
Creates an identical clone of this MetaSkeleton.
Definition MetaSkeleton.cpp:329
ReferentialSkeleton is a base class used to implement Linkage, Group, and other classes that are used...
Definition ReferentialSkeleton.hpp:48
std::shared_ptr< Linkage > LinkagePtr
Definition SmartPointer.hpp:74
std::shared_ptr< MetaSkeleton > MetaSkeletonPtr
Definition SmartPointer.hpp:68
Definition BulletCollisionDetector.cpp:60
This structure defines targets for the expansion criteria and the desired behavior for those targets.
Definition Linkage.hpp:80
bool mChain
If this is set to true, the expansion towards this target will terminate if (1) a fork/split in the k...
Definition Linkage.hpp:97
WeakBodyNodePtr mNode
The Linkage will expand from the starting BodyNode up to this node.
Definition Linkage.hpp:88
ExpansionPolicy mPolicy
After the target has been reached (if it is reached), the Linkage will start to follow this expansion...
Definition Linkage.hpp:92
Any expansion performed by the criteria will be halted if mTerminal is reached.
Definition Linkage.hpp:119
bool mInclusive
Whether or not the BodyNode should be included after expansion has halted.
Definition Linkage.hpp:128
WeakBodyNodePtr mTerminal
BodyNode that should halt any expansion.
Definition Linkage.hpp:124
The Criteria class is used to specify how a Linkage should be constructed.
Definition Linkage.hpp:59
Target mStart
This Target will serve as the starting point for the criteria satisfaction.
Definition Linkage.hpp:102
void expansionPolicy(BodyNode *_start, ExpansionPolicy _policy, std::vector< BodyNode * > &_bns) const
Satisfy the expansion policy of a target.
Definition Linkage.cpp:165
std::vector< BodyNode * > climbToTarget(BodyNode *_start, BodyNode *_target) const
Expand upwards from the _start BodyNode to the _target BodyNode.
Definition Linkage.cpp:402
std::vector< Target > mTargets
The Linkage will extend from mStart to each of these targets.
Definition Linkage.hpp:111
void expandToTarget(const Target &_start, const Target &_target, std::vector< BodyNode * > &_bns) const
Construct a path from start to target.
Definition Linkage.cpp:354
void refreshTerminalMap() const
Refresh the content of mMapOfTerminals.
Definition Linkage.cpp:155
std::vector< Terminal > mTerminals
Any expansion (whether from an ExpansionPolicy or an attempt to reach an entry in mTargets) will be h...
Definition Linkage.hpp:133
ExpansionPolicy
The ExpansionPolicy indicates how the collection of BodyNodes should expand from the starting BodyNod...
Definition Linkage.hpp:63
@ UPSTREAM
Include the target, and then expand upstream, toward the root of the tree.
Definition Linkage.hpp:70
@ EXCLUDE
Do not expand from the target.
Definition Linkage.hpp:66
@ INCLUDE
Do not expand from the target.
Definition Linkage.hpp:64
@ DOWNSTREAM
Include the target, and then expand downstream, toward the leaves of the tree.
Definition Linkage.hpp:68
std::vector< BodyNode * > satisfy() const
Return a vector of BodyNodes that satisfy the parameters of the Criteria.
Definition Linkage.cpp:44
std::unordered_map< BodyNode *, bool > mMapOfTerminals
Hashed set for terminals to allow quick lookup.
Definition Linkage.hpp:197
std::vector< BodyNode * > climbToCommonRoot(const Target &_start, const Target &_target, bool _chain) const
Expand upwards from both BodyNodes to a common root.
Definition Linkage.cpp:423
Criteria()=default
Constructs an empty criteria that will lead to creating an empty Linkage.
void trimBodyNodes(std::vector< BodyNode * > &_bns, bool _chain, bool _movingUpstream) const
Crawl through the list and cut it off anywhere that the criteria is violated.
Definition Linkage.cpp:459
void expandDownstream(BodyNode *_start, std::vector< BodyNode * > &_bns, bool _includeStart) const
Expand downstream.
Definition Linkage.cpp:254
void expandUpstream(BodyNode *_start, std::vector< BodyNode * > &_bns, bool _includeStart) const
Expand upstream.
Definition Linkage.cpp:281