testSymbolicISAM.cpp

Go to the documentation of this file.

/* ----------------------------------------------------------------------------

 * GTSAM Copyright 2010, Georgia Tech Research Corporation,
 * Atlanta, Georgia 30332-0415
 * All Rights Reserved
 * Authors: Frank Dellaert, et al. (see THANKS for the full author list)

 * See LICENSE for the license information

 * -------------------------------------------------------------------------- */

#include <gtsam/symbolic/SymbolicISAM.h>
#include <gtsam/symbolic/tests/symbolicExampleGraphs.h>

#include <CppUnitLite/TestHarness.h>

#include <boost/assign/std/list.hpp> // for operator +=
using namespace boost::assign;

using namespace std;
using namespace gtsam;

/* ************************************************************************* */
// Some numbers that should be consistent among all smoother tests

//static double sigmax1 = 0.786153, sigmax2 = 0.687131 ,sigmax3 = 0.671512,
//sigmax4 = 0.669534, sigmax5 = sigmax3,, sigmax7 = sigmax1, sigmax6 = sigmax2;

/* ************************************************************************* */

//SymbolicConditional::shared_ptr x3(new SymbolicConditional("x3")),
//    x2(new SymbolicConditional("x2","x3")),
//    x1(new SymbolicConditional("x1","x2","x3")),
//    l1(new SymbolicConditional("l1","x1","x2")),
//    l2(new SymbolicConditional("l2","x1","x3"));
//
//SymbolicISAM createSlamSymbolicISAM(){
//  // Create using insert
//  SymbolicISAM bayesTree_slam;
//  bayesTree_slam.insert(x3);
//  bayesTree_slam.insert(x2);
//  bayesTree_slam.insert(x1);
//  bayesTree_slam.insert(l2);
//  bayesTree_slam.insert(l1);
//  return bayesTree_slam;
//}

/* ************************************************************************* */

//SymbolicConditional::shared_ptr
//  B(new SymbolicConditional("B")),
//  L(new SymbolicConditional("L", "B")),
//  E(new SymbolicConditional("E", "B", "L")),
//  S(new SymbolicConditional("S", "L", "B")),
//  T(new SymbolicConditional("T", "E", "L")),
//  X(new SymbolicConditional("X", "E"));
//
//SymbolicISAM createAsiaSymbolicISAM() {
//  SymbolicISAM bayesTree;
//  bayesTree.insert(B);
//  bayesTree.insert(L);
//  bayesTree.insert(E);
//  bayesTree.insert(S);
//  bayesTree.insert(T);
//  bayesTree.insert(X);
//  return bayesTree;
//}

/* ************************************************************************* */
TEST( SymbolicISAM, iSAM )
{
  // Now we modify the Bayes tree by inserting a new factor over B and S

  SymbolicFactorGraph fullGraph;
  fullGraph += asiaGraph;
  fullGraph += SymbolicFactor(_B_, _S_);

  // This ordering is chosen to match the one chosen by COLAMD during the ISAM update
  Ordering ordering(list_of(_X_)(_B_)(_S_)(_E_)(_L_)(_T_));
  SymbolicBayesTree expected = *fullGraph.eliminateMultifrontal(ordering);

  // Add factor on B and S
  SymbolicISAM actual = *asiaGraph.eliminateMultifrontal();

  // Check whether the same
  EXPECT(assert_equal(expected, (const SymbolicBayesTree&)actual));
}

/* ************************************************************************* */
//TEST( ISAM, iSAM_slam )
//{
//  // Create using insert
//  SymbolicISAM bayesTree_slam = createSlamSymbolicISAM();
//
//  //New conditionals for the expected Bayes tree
//  SymbolicConditional::shared_ptr
//      l1_(new SymbolicConditional("l1","x1","x2","x3"));
//
//  // Create expected Bayes tree
//  SymbolicISAM expected_slam;
//  expected_slam.insert(x3);
//  expected_slam.insert(x2);
//  expected_slam.insert(x1);
//  expected_slam.insert(l1_);
//  expected_slam.insert(l2);
//
//
//  // create new factors to be inserted
//  SymbolicFactorGraph factorGraph_slam;
//  factorGraph_slam.push_factor("x3","l1");
//  factorGraph_slam.push_factor("x3");
//
//  // do incremental inference
//  bayesTree_slam.update(factorGraph_slam);
//
//  // Check whether the same
//  CHECK(assert_equal(expected_slam,bayesTree_slam));
//}

/* ************************************************************************* */
int main() { TestResult tr; return TestRegistry::runAllTests(tr);}
/* ************************************************************************* */