Go to the documentation of this file.
26 using namespace gtsam;
43 for(std::shared_ptr<GaussianFactor>
factor: smoother) {
46 actual.
update(factorGraph);
53 for (
const auto& [
key, clique] :
expected.nodes()) {
55 EXPECT(!conditional->get_model());
63 for (
int t = 1;
t <= 7;
t++)
e.insert(
X(
t), Vector::Zero(2));
static int runAllTests(TestResult &result)
Array< double, 1, 3 > e(1./3., 0.5, 2.)
#define EXPECT(condition)
TEST(ISAM, iSAM_smoother)
Variable ordering for the elimination algorithm.
DecisionTreeFactor factor(D &C &B &A, "0.0 0.0 0.0 0.60658897 0.61241912 0.61241969 0.61247685 0.61247742 0.0 " "0.0 0.0 0.99995287 1.0 1.0 1.0 1.0")
VectorValues optimize() const
static enum @1096 ordering
const gtsam::Symbol key('X', 0)
IsDerived< DERIVEDFACTOR > push_back(std::shared_ptr< DERIVEDFACTOR > factor)
Add a factor directly using a shared_ptr.
std::shared_ptr< This > shared_ptr
shared_ptr to this class
bool assert_equal(const Matrix &expected, const Matrix &actual, double tol)
void update(const FactorGraphType &newFactors, const Eliminate &function=EliminationTraitsType::DefaultEliminate)
Create small example with two poses and one landmark.
GaussianFactorGraph createSmoother(int T)
gtsam
Author(s):
autogenerated on Wed Jan 1 2025 04:06:17