26 template<
class BAYESTREE>
32 const KeySet newFactorKeys = newFactors.keys();
33 this->removeTop(std::vector<Key>(newFactorKeys.begin(), newFactorKeys.end()), bn, orphans);
37 FactorGraphType factors;
39 factors += newFactors;
42 for(
const sharedClique& orphan: orphans)
43 factors += boost::make_shared<BayesTreeOrphanWrapper<Clique> >(orphan);
47 const KeySet newFactorKeys = newFactors.keys();
50 Base bayesTree = *factors.eliminateMultifrontal(constrainedOrdering,
function, varIndex);
51 this->roots_.insert(this->roots_.end(), bayesTree.roots().begin(), bayesTree.roots().end());
52 this->nodes_.insert(bayesTree.nodes().begin(), bayesTree.nodes().end());
56 template<
class BAYESTREE>
60 this->update_internal(newFactors, orphans,
function);
void update(const FactorGraphType &newFactors, const Eliminate &function=EliminationTraitsType::DefaultEliminate)
update the Bayes tree with a set of new factors, typically derived from measurements ...
Definition: ISAM-inst.h:57
static Ordering ColamdConstrainedLast(const FactorGraph< FACTOR > &graph, const std::vector< Key > &constrainLast, bool forceOrder=false)
Compute a fill-reducing ordering using constrained COLAMD from a factor graph (see details for note o...
Definition: Ordering.h:100
void update_internal(const FactorGraphType &newFactors, Cliques &orphans, const Eliminate &function=EliminationTraitsType::DefaultEliminate)
update_internal provides access to list of orphans for drawing purposes
Definition: ISAM-inst.h:27
Incremental update functionality (iSAM) for BayesTree.
The VariableIndex class computes and stores the block column structure of a factor graph...
Definition: VariableIndex.h:42
Definition: Ordering.h:33
Global functions in a separate testing namespace.
Definition: chartTesting.h:28