Linearized Hybrid factor graph that uses type erasure. More...
#include <gtsam/discrete/DiscreteKey.h>
#include <gtsam/hybrid/HybridFactor.h>
#include <gtsam/hybrid/HybridFactorGraph.h>
#include <gtsam/hybrid/HybridGaussianFactor.h>
#include <gtsam/inference/EliminateableFactorGraph.h>
#include <gtsam/inference/FactorGraph.h>
#include <gtsam/inference/Ordering.h>
#include <gtsam/linear/GaussianFactor.h>
#include <gtsam/linear/VectorValues.h>
#include <functional>
#include <optional>
Go to the source code of this file.
Classes | |
struct | gtsam::EliminationTraits< HybridGaussianFactorGraph > |
class | gtsam::HybridGaussianFactorGraph |
struct | gtsam::traits< HybridGaussianFactorGraph > |
Namespaces | |
gtsam | |
traits | |
Functions | |
std::pair< HybridConditional::shared_ptr, std::shared_ptr< Factor > > | gtsam::EliminateHybrid (const HybridGaussianFactorGraph &factors, const Ordering &keys) |
Main elimination function for HybridGaussianFactorGraph. More... | |
const Ordering | gtsam::HybridOrdering (const HybridGaussianFactorGraph &graph) |
Return a Colamd constrained ordering where the discrete keys are eliminated after the continuous keys. More... | |
Linearized Hybrid factor graph that uses type erasure.
Definition in file HybridGaussianFactorGraph.h.