gtsam/cpp/SubgraphSolver.h

72 lines
2.0 KiB
C++

/*
* SubgraphSolver.h
* Created on: Dec 31, 2009
* @author: Frank Dellaert
*/
#pragma once
#include "GaussianFactorGraph.h"
#include "GaussianBayesNet.h"
#include "Ordering.h"
#include "SubgraphPreconditioner.h"
namespace gtsam {
/**
* A nonlinear system solver using subgraph preconditioning conjugate gradient
* Concept NonLinearSolver<G,T,L> implements
* linearize: G * T -> L
* solve : L -> VectorConfig
*/
template<class Graph, class Config>
class SubgraphSolver {
private:
typedef typename Config::Key Key;
typedef typename Graph::Constraint Constraint;
typedef typename Graph::Pose Pose;
// TODO not hardcode
static const size_t maxIterations_=100;
static const bool verbose_=false;
static const double epsilon_=1e-4, epsilon_abs_=1e-5;
/* the ordering derived from the spanning tree */
boost::shared_ptr<Ordering> ordering_;
/* the solution computed from the first subgraph */
boost::shared_ptr<Config> theta_bar_;
Graph T_, C_;
public:
SubgraphSolver() {}
SubgraphSolver(const Graph& G, const Config& theta0);
void initialize(const Graph& G, const Config& theta0);
boost::shared_ptr<Ordering> ordering() const { return ordering_; }
boost::shared_ptr<Config> theta_bar() const { return theta_bar_; }
/**
* linearize the non-linear graph around the current config and build the subgraph preconditioner systme
*/
boost::shared_ptr<SubgraphPreconditioner> linearize(const Graph& G, const Config& theta_bar) const;
/**
* solve for the optimal displacement in the tangent space, and then solve
* the resulted linear system
*/
VectorConfig optimize(SubgraphPreconditioner& system) const;
};
template<class Graph, class Config> const size_t SubgraphSolver<Graph,Config>::maxIterations_;
template<class Graph, class Config> const bool SubgraphSolver<Graph,Config>::verbose_;
template<class Graph, class Config> const double SubgraphSolver<Graph,Config>::epsilon_;
template<class Graph, class Config> const double SubgraphSolver<Graph,Config>::epsilon_abs_;
} // nsamespace gtsam