Template Class CEdgeRegistrationDecider
Defined in File CEdgeRegistrationDecider.h
Inheritance Relationships
Base Type
public mrpt::graphslam::CRegistrationDeciderOrOptimizer< typename mrpt::graphs::CNetworkOfPoses2DInf >(Template Class CRegistrationDeciderOrOptimizer)
Class Documentation
-
template<class GRAPH_T = typename mrpt::graphs::CNetworkOfPoses2DInf>
class CEdgeRegistrationDecider : public virtual mrpt::graphslam::CRegistrationDeciderOrOptimizer<typename mrpt::graphs::CNetworkOfPoses2DInf> Interface for implementing edge registration classes.
CEdgeRegistrationDecider provides the basic methods that have to exist in every edge registration decider class. For an example of inheriting from this class see CICPCriteriaERD.
Note
As a naming convention, all the implemented edge registration deciders are suffixed with the ERD acronym.
Unnamed Group
-
using parent = mrpt::graphslam::CRegistrationDeciderOrOptimizer<GRAPH_T>
Handy typedefs.
Parent of current class
Registration criteria checks
Check whether a new edge should be registered in the graph.
If condition(s) for edge registration is satisfied, method should call the registerNewEdge method.
Public Functions
-
CEdgeRegistrationDecider() = default
-
~CEdgeRegistrationDecider() override = default
-
inline virtual void getEdgesStats(std::map<std::string, int> *edge_type_to_num) const
Fill the given map with the type of registered edges as well as the corresponding number of registration of each edge.
-
inline virtual bool justInsertedLoopClosure() const
Used by the caller to query for possible loop closures in the last edge registration procedure.
-
virtual void getDescriptiveReport(std::string *report_str) const override
Fill the provided string with a detailed report of the decider/optimizer state.
Report should include (part of) the following:
Timing of important methods
Properties fo class at the current time
Logging of commands until current time
Protected Functions
-
virtual void registerNewEdge(const mrpt::graphs::TNodeID &from, const mrpt::graphs::TNodeID &to, const constraint_t &rel_edge)
Register a new constraint/edge in the current graph.
Implementations of this class should provide a wrapper around GRAPH_T::insertEdge method.
-
using parent = mrpt::graphslam::CRegistrationDeciderOrOptimizer<GRAPH_T>