The most high level class for storing hybrid, multi-hypothesis maps in a graph-based model.
This class is used within the HMT-SLAM implementation in CHMTSLAM.
Definition at line 31 of file CHierarchicalMHMap.h.
#include <mrpt/hmtslam/CHierarchicalMHMap.h>
Public Types | |
typedef TNodeList::iterator | iterator |
typedef TNodeList::const_iterator | const_iterator |
typedef std::vector< CHMHMapNode::TNodeID > | TNodeIDsList |
A type that reprensents a sequence of node IDs. | |
Public Member Functions | |
CHierarchicalMHMap () | |
Default constructor. | |
void | dumpAsXMLfile (std::string fileName) const |
Destructor. | |
void | loadFromXMLfile (std::string fileName) |
Load a graph from a XML file. | |
virtual | ~CHierarchicalMHMap () |
void | clear () |
Erase all the contents of map (It delete all nodes/arcs objects) | |
const_iterator | begin () const |
Returns an iterator to the first node in the graph. | |
iterator | begin () |
Returns an iterator to the first node in the graph. | |
const_iterator | end () const |
Returns an iterator to the end of the list of nodes in the graph. | |
iterator | end () |
Returns an iterator to the end of the list of nodes in the graph. | |
size_t | nodeCount () const |
Returns the number of nodes in the partition: | |
size_t | arcCount () const |
Returns the number of arcs in the partition: | |
CHMHMapNodePtr | getFirstNode () |
Returns the first node in the graph, or NULL if it does not exist. | |
CHMHMapNodePtr | getNodeByID (CHMHMapNode::TNodeID id) |
Returns the node with the given ID, or NULL if it does not exist. | |
const CHMHMapNodePtr | getNodeByID (CHMHMapNode::TNodeID id) const |
Returns the node with the given ID, or NULL if it does not exist. | |
CHMHMapNodePtr | getNodeByLabel (const std::string &label, const THypothesisID &hypothesisID) |
Returns the node with the given label (case insensitive) for some given hypothesis ID, or NULL if it does not exist. | |
const CHMHMapNodePtr | getNodeByLabel (const std::string &label, const THypothesisID &hypothesisID) const |
Returns the node with the given label (case insensitive) for some given hypothesis ID, or NULL if it does not exist. | |
void | saveAreasDiagramForMATLAB (const std::string &filName, const CHMHMapNode::TNodeID &idReferenceNode, const THypothesisID &hypothesisID) const |
Returns a partition of this graph only with nodes at a given level in the hierarchy (0=ground level,1=parent level,etc) | |
void | saveAreasDiagramWithEllipsedForMATLAB (const std::string &filName, const CHMHMapNode::TNodeID &idReferenceNode, const THypothesisID &hypothesisID, float uncertaintyExagerationFactor=1.0f, bool drawArcs=false, unsigned int numberOfIterationsForOptimalGlobalPoses=4) const |
Saves a MATLAB script that represents graphically the nodes with type="Area" in this hierarchical-map(partition), using the stated node as global coordinates reference, and drawing the ellipses of the localization uncertainty for each node. | |
void | saveGlobalMapForMATLAB (const std::string &filName, const THypothesisID &hypothesisID, const CHMHMapNode::TNodeID &idReferenceNode) const |
Saves a MATLAB script that represents graphically the reconstructed "global map" ADDITIONAL NOTES: | |
void | findPathBetweenNodes (const CHMHMapNode::TNodeID &nodeFrom, const CHMHMapNode::TNodeID &nodeTo, const THypothesisID &hypothesisID, TArcList &out_path, bool direction=false) const |
The Dijkstra algorithm for finding the shortest path between a pair of nodes. | |
void | computeCoordinatesTransformationBetweenNodes (const CHMHMapNode::TNodeID &nodeFrom, const CHMHMapNode::TNodeID &nodeTo, mrpt::poses::CPose3DPDFParticles &posePDF, const THypothesisID &hypothesisID, unsigned int particlesCount=100, float additionalNoiseXYratio=0.02, float additionalNoisePhiRad=mrpt::utils::DEG2RAD(0.1)) const |
Draw a number of samples according to the PDF of the coordinates transformation between a pair of "Area"'s nodes. | |
float | computeMatchProbabilityBetweenNodes (const CHMHMapNode::TNodeID &nodeFrom, const CHMHMapNode::TNodeID &nodeTo, float &maxMatchProb, mrpt::poses::CPose3DPDFSOG &estimatedRelativePose, const THypothesisID &hypothesisID, unsigned int monteCarloSamplesPose=300) |
Computes the probability [0,1] of two areas' gridmaps to "match" (loop closure), according to the grid maps and pose uncertainty from information in arcs (uses a Monte Carlo aproximation) If there is not enough information or a robust estimation cannot be found, there will not be particles in "estimatedRelativePose". | |
void | findArcsBetweenNodes (const CHMHMapNode::TNodeID &node1, const CHMHMapNode::TNodeID &node2, const THypothesisID &hypothesisID, TArcList &out_listArcs) const |
Returns all the arcs between a pair of nodes: | |
void | findArcsOfTypeBetweenNodes (const CHMHMapNode::TNodeID &node1id, const CHMHMapNode::TNodeID &node2id, const THypothesisID &hypothesisID, const std::string &arcType, TArcList &ret) const |
Returns the arcs between a pair of nodes of a given type. | |
CHMHMapArcPtr | findArcOfTypeBetweenNodes (const CHMHMapNode::TNodeID &node1id, const CHMHMapNode::TNodeID &node2id, const THypothesisID &hypothesisID, const std::string &arcType, bool &isInverted) const |
Returns the first arc between a pair of nodes of a given type, and if it is in the opposite direction. | |
bool | areNodesNeightbour (const CHMHMapNode::TNodeID &node1, const CHMHMapNode::TNodeID &node2, const THypothesisID &hypothesisID, const char *requiredAnnotation=NULL) const |
Returns whether two nodes are "neightbour", i.e. | |
void | computeGloballyConsistentNodeCoordinates (std::map< CHMHMapNode::TNodeID, mrpt::poses::CPose3DPDFGaussian, std::less< CHMHMapNode::TNodeID >, Eigen::aligned_allocator< std::pair< const CHMHMapNode::TNodeID, mrpt::poses::CPose3DPDFGaussian > > > &nodePoses, const CHMHMapNode::TNodeID &idReferenceNode, const THypothesisID &hypothesisID, const unsigned int &numberOfIterations=2) const |
This methods implements a Lu&Milios-like globally optimal estimation for the global coordinates of all the nodes in the graph according to all available arcs with relative pose information. | |
void | getAs3DScene (mrpt::opengl::COpenGLScene &outScene, const CHMHMapNode::TNodeID &idReferenceNode, const THypothesisID &hypothesisID, const unsigned int &numberOfIterationsForOptimalGlobalPoses=5, const bool &showRobotPoseIDs=true) const |
Returns a 3D scene reconstruction of the hierarchical map. | |
void | dumpAsText (utils::CStringList &s) const |
Return a textual description of the whole graph. | |
double | computeOverlapProbabilityBetweenNodes (const CHMHMapNode::TNodeID &nodeFrom, const CHMHMapNode::TNodeID &nodeTo, const THypothesisID &hypothesisID, const size_t &monteCarloSamples=100, const float margin_to_substract=6) const |
Computes the probability [0,1] of two areas' gridmaps to overlap, via a Monte Carlo aproximation. | |
Static Public Member Functions | |
static void | printf_debug (const char *frmt,...) |
Sends a formated text to "debugOut" if not NULL, or to cout otherwise. | |
Protected Member Functions | |
void | onNodeAddition (CHMHMapNodePtr &node) |
Event handler to be called just after a node has being created: it will be added to the internal list. | |
void | onArcAddition (CHMHMapArcPtr &arc) |
Event handler to be called just after an arc has being created: it will be added to the internal list. | |
void | onNodeDestruction (CHMHMapNode *node) |
Event handler to be called just before a node is being destroyed: it will be removed from the internal list. | |
void | onArcDestruction (CHMHMapArc *arc) |
Event handler to be called just before an arc is being destroyed: it will be removed from the internal list. | |
CSerializable virtual methods | |
void | writeToStream (mrpt::utils::CStream &out, int *getVersion) const MRPT_OVERRIDE |
void | readFromStream (mrpt::utils::CStream &in, int version) MRPT_OVERRIDE |
Protected Attributes | |
TNodeList | m_nodes |
The internal list of nodes and arcs in the whole hierarchical model. | |
TArcList | m_arcs |
Friends | |
class | CHMHMapArc |
class | CHMHMapNode |
RTTI stuff <br> | |
typedef CHierarchicalMHMapPtr | SmartPtr |
static mrpt::utils::CLASSINIT | _init_CHierarchicalMHMap |
static mrpt::utils::TRuntimeClassId | classCHierarchicalMHMap |
static const mrpt::utils::TRuntimeClassId * | classinfo |
static const mrpt::utils::TRuntimeClassId * | _GetBaseClass () |
virtual const mrpt::utils::TRuntimeClassId * | GetRuntimeClass () const MRPT_OVERRIDE |
virtual mrpt::utils::CObject * | duplicate () const MRPT_OVERRIDE |
static mrpt::utils::CObject * | CreateObject () |
static CHierarchicalMHMapPtr | Create () |
|
inherited |
Definition at line 46 of file CHierarchicalMapMHPartition.h.
|
inherited |
Definition at line 45 of file CHierarchicalMapMHPartition.h.
A typedef for the associated smart pointer
Definition at line 37 of file CHierarchicalMHMap.h.
|
inherited |
A type that reprensents a sequence of node IDs.
Definition at line 66 of file CHierarchicalMapMHPartition.h.
mrpt::hmtslam::CHierarchicalMHMap::CHierarchicalMHMap | ( | ) |
Default constructor.
|
virtual |
|
staticprotected |
|
inherited |
Returns the number of arcs in the partition:
|
inherited |
Returns whether two nodes are "neightbour", i.e.
have a direct arc between them
|
inlineinherited |
Returns an iterator to the first node in the graph.
Definition at line 52 of file CHierarchicalMapMHPartition.h.
|
inlineinherited |
Returns an iterator to the first node in the graph.
Definition at line 49 of file CHierarchicalMapMHPartition.h.
void mrpt::hmtslam::CHierarchicalMHMap::clear | ( | ) |
Erase all the contents of map (It delete all nodes/arcs objects)
|
inherited |
Draw a number of samples according to the PDF of the coordinates transformation between a pair of "Area"'s nodes.
std::exception | If there is not enought information in arcs to compute the PDF |
|
inherited |
This methods implements a Lu&Milios-like globally optimal estimation for the global coordinates of all the nodes in the graph according to all available arcs with relative pose information.
Global coordinates will be computed relative to the node "idReferenceNode".
std::exception | If there is any node without a pose arc, invalid (non invertible) matrixes, etc... |
|
inherited |
Computes the probability [0,1] of two areas' gridmaps to "match" (loop closure), according to the grid maps and pose uncertainty from information in arcs (uses a Monte Carlo aproximation) If there is not enough information or a robust estimation cannot be found, there will not be particles in "estimatedRelativePose".
|
inherited |
Computes the probability [0,1] of two areas' gridmaps to overlap, via a Monte Carlo aproximation.
std::exception | If there is not enought information in arcs, etc... |
margin_to_substract | In meters, the area of each gridmap is "eroded" this amount to compensate the area in excess usually found in gridmaps. |
|
static |
|
static |
|
inherited |
Return a textual description of the whole graph.
void mrpt::hmtslam::CHierarchicalMHMap::dumpAsXMLfile | ( | std::string | fileName | ) | const |
Destructor.
Save the whole graph as a XML file
|
virtual |
|
inlineinherited |
Returns an iterator to the end of the list of nodes in the graph.
Definition at line 58 of file CHierarchicalMapMHPartition.h.
|
inlineinherited |
Returns an iterator to the end of the list of nodes in the graph.
Definition at line 55 of file CHierarchicalMapMHPartition.h.
|
inherited |
Returns the first arc between a pair of nodes of a given type, and if it is in the opposite direction.
References mrpt::hmtslam::CHMHMapArcPtr.
|
inherited |
Returns all the arcs between a pair of nodes:
|
inherited |
Returns the arcs between a pair of nodes of a given type.
|
inherited |
The Dijkstra algorithm for finding the shortest path between a pair of nodes.
|
inherited |
Returns a 3D scene reconstruction of the hierarchical map.
See "computeGloballyConsistentNodeCoordinates" for the meaning of "numberOfIterationsForOptimalGlobalPoses"
|
inherited |
Returns the first node in the graph, or NULL if it does not exist.
References mrpt::hmtslam::CHMHMapNodePtr.
|
inherited |
Returns the node with the given ID, or NULL if it does not exist.
References mrpt::hmtslam::CHMHMapNodePtr.
|
inherited |
Returns the node with the given ID, or NULL if it does not exist.
References mrpt::hmtslam::CHMHMapNodePtr.
|
inherited |
Returns the node with the given label (case insensitive) for some given hypothesis ID, or NULL if it does not exist.
References mrpt::hmtslam::CHMHMapNodePtr.
|
inherited |
Returns the node with the given label (case insensitive) for some given hypothesis ID, or NULL if it does not exist.
References mrpt::hmtslam::CHMHMapNodePtr.
|
virtual |
void mrpt::hmtslam::CHierarchicalMHMap::loadFromXMLfile | ( | std::string | fileName | ) |
Load a graph from a XML file.
|
inherited |
Returns the number of nodes in the partition:
|
protected |
Event handler to be called just after an arc has being created: it will be added to the internal list.
|
protected |
Event handler to be called just before an arc is being destroyed: it will be removed from the internal list.
|
protected |
Event handler to be called just after a node has being created: it will be added to the internal list.
|
protected |
Event handler to be called just before a node is being destroyed: it will be removed from the internal list.
|
staticinherited |
Sends a formated text to "debugOut" if not NULL, or to cout otherwise.
Referenced by mrpt::math::CLevenbergMarquardtTempl< VECTORTYPE, USERPARAM >::execute().
|
protected |
|
inherited |
Returns a partition of this graph only with nodes at a given level in the hierarchy (0=ground level,1=parent level,etc)
Coordinates are computed simply as the mean value of the first arc with an annotation "RelativePose", added to the pose of the original node.
|
inherited |
Saves a MATLAB script that represents graphically the nodes with type="Area" in this hierarchical-map(partition), using the stated node as global coordinates reference, and drawing the ellipses of the localization uncertainty for each node.
ADDITIONAL NOTES:
|
inherited |
Saves a MATLAB script that represents graphically the reconstructed "global map" ADDITIONAL NOTES:
|
protected |
|
friend |
Definition at line 33 of file CHierarchicalMHMap.h.
|
friend |
Definition at line 34 of file CHierarchicalMHMap.h.
|
staticprotected |
Definition at line 37 of file CHierarchicalMHMap.h.
|
static |
Definition at line 37 of file CHierarchicalMHMap.h.
|
static |
Definition at line 37 of file CHierarchicalMHMap.h.
|
protectedinherited |
Definition at line 41 of file CHierarchicalMapMHPartition.h.
|
protectedinherited |
The internal list of nodes and arcs in the whole hierarchical model.
The objects must be deleted only in the CHierarchicalMap class, not in partitions only objects.
Definition at line 40 of file CHierarchicalMapMHPartition.h.
Page generated by Doxygen 1.9.6 for MRPT 1.4.0 SVN: at Wed Mar 22 08:20:48 UTC 2023 |