128 lines
3.5 KiB
C++
128 lines
3.5 KiB
C++
/**
|
|
* @file testIncremental.cpp
|
|
* @brief Unit tests for graph-based iSAM
|
|
* @author Michael Kaess
|
|
* @author Viorela Ila
|
|
* @author Frank Dellaert
|
|
*/
|
|
|
|
#include <boost/assign/std/list.hpp> // for operator +=
|
|
using namespace boost::assign;
|
|
|
|
#include <CppUnitLite/TestHarness.h>
|
|
|
|
#include "SymbolicBayesNet.h"
|
|
#include "SymbolicFactorGraph.h"
|
|
#include "GaussianBayesNet.h"
|
|
#include "Ordering.h"
|
|
#include "BayesTree-inl.h"
|
|
#include "smallExample.h"
|
|
|
|
using namespace gtsam;
|
|
|
|
typedef BayesTree<SymbolicConditional> SymbolicBayesTree;
|
|
typedef BayesTree<GaussianConditional> GaussianBayesTree;
|
|
|
|
/* ************************************************************************* */
|
|
|
|
SymbolicBayesTree update(const SymbolicBayesTree& initial,
|
|
const boost::shared_ptr<SymbolicFactor>& newFactor) {
|
|
|
|
// create an empty factor graph
|
|
SymbolicFactorGraph factorGraph;
|
|
|
|
// get the ELB clique
|
|
SymbolicBayesTree::sharedClique ELB = initial["B"];
|
|
FactorGraph<SymbolicFactor> ELB_factors(*ELB);
|
|
|
|
// add it to the factor graph
|
|
factorGraph.push_back(ELB_factors);
|
|
|
|
// get the SLB clique
|
|
SymbolicBayesTree::sharedClique SLB = initial["S"];
|
|
FactorGraph<SymbolicFactor> SLB_factors(*SLB);
|
|
|
|
// add it to the factor graph
|
|
factorGraph.push_back(SLB_factors);
|
|
|
|
// now add the new factor
|
|
factorGraph.push_back(newFactor);
|
|
|
|
// create an ordering BELS
|
|
Ordering ordering = factorGraph.getOrdering();
|
|
|
|
// eliminate into a Bayes net
|
|
SymbolicBayesNet bayesNet = eliminate<SymbolicFactor,SymbolicConditional>(factorGraph,ordering);
|
|
|
|
// turn back into a Bayes Tree
|
|
BayesTree<SymbolicConditional> newTree(bayesNet);
|
|
|
|
// get the orphan cliques
|
|
SymbolicBayesTree::sharedClique TEL = initial["T"];
|
|
SymbolicBayesTree::sharedClique XE = initial["X"];
|
|
|
|
// get clique from new tree to attach to
|
|
SymbolicBayesTree::sharedClique new_ELB = newTree["E"];
|
|
|
|
// add orphans to the bottom of the new tree
|
|
new_ELB->children_ += TEL,XE;
|
|
|
|
return newTree;
|
|
}
|
|
|
|
/* ************************************************************************* */
|
|
TEST( BayesTree, iSAM )
|
|
{
|
|
// Conditionals for ASIA example from the tutorial with A and D evidence
|
|
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"));
|
|
|
|
// Create using insert
|
|
SymbolicBayesTree bayesTree;
|
|
bayesTree.insert(B);
|
|
bayesTree.insert(L);
|
|
bayesTree.insert(E);
|
|
bayesTree.insert(S);
|
|
bayesTree.insert(T);
|
|
bayesTree.insert(X);
|
|
|
|
// New conditionals in modified top of the tree
|
|
SymbolicConditional::shared_ptr
|
|
S_(new SymbolicConditional("S")),
|
|
L_(new SymbolicConditional("L", "S")),
|
|
E_(new SymbolicConditional("E", "L", "S")),
|
|
B_(new SymbolicConditional("B", "E", "L", "S"));
|
|
|
|
// Create expected Bayes tree
|
|
SymbolicBayesTree expected;
|
|
expected.insert(S_);
|
|
expected.insert(L_);
|
|
expected.insert(E_);
|
|
expected.insert(B_);
|
|
expected.insert(T);
|
|
expected.insert(X);
|
|
|
|
// create a new factor to be inserted
|
|
list<string> keys;
|
|
keys += "B","S";
|
|
boost::shared_ptr<SymbolicFactor> newFactor(new SymbolicFactor(keys));
|
|
|
|
// do incremental inference
|
|
SymbolicBayesTree actual = update(bayesTree, newFactor);
|
|
|
|
// Check whether the same
|
|
CHECK(assert_equal(expected,actual));
|
|
}
|
|
|
|
/* ************************************************************************* */
|
|
int main() {
|
|
TestResult tr;
|
|
return TestRegistry::runAllTests(tr);
|
|
}
|
|
/* ************************************************************************* */
|