#include <gtsam/base/Matrix.h>#include <gtsam/discrete/DecisionTreeFactor.h>#include <gtsam/discrete/DiscreteDistribution.h>#include <gtsam/hybrid/HybridGaussianFactor.h>#include <gtsam/hybrid/HybridGaussianFactorGraph.h>#include <gtsam/hybrid/HybridNonlinearFactor.h>#include <gtsam/hybrid/HybridNonlinearFactorGraph.h>#include <gtsam/inference/Symbol.h>#include <gtsam/linear/GaussianFactor.h>#include <gtsam/linear/GaussianFactorGraph.h>#include <gtsam/linear/JacobianFactor.h>#include <gtsam/linear/NoiseModel.h>#include <gtsam/nonlinear/NonlinearFactor.h>#include <gtsam/nonlinear/PriorFactor.h>#include <gtsam/slam/BetweenFactor.h>#include <vector>
Include dependency graph for Switching.h:
This graph shows which files directly or indirectly include this file:
Go to the source code of this file.
Classes | |
| struct | gtsam::Switching |
| ϕ(X(0)) .. ϕ(X(k),X(k+1)) .. ϕ(X(k);z_k) .. ϕ(M(0)) .. ϕ(M(K-3),M(K-2)) More... | |
Namespaces | |
| gtsam | |
| traits | |
Typedefs | |
| using | gtsam::MotionModel = BetweenFactor< double > |
Functions | |
| std::pair< KeyVector, std::vector< int > > | gtsam::makeBinaryOrdering (std::vector< Key > &input) |
| Return the ordering as a binary tree such that all parent nodes are above their children. More... | |
| HybridGaussianFactorGraph::shared_ptr | gtsam::makeSwitchingChain (size_t K, std::function< Key(int)> x=X, std::function< Key(int)> m=M, const std::string &transitionProbabilityTable="0 1 1 3") |
| Create a switching system chain. A switching system is a continuous system which depends on a discrete mode at each time step of the chain. More... | |