Sure: In graph-slam, each edge has its own covariance.
Now, in MRPT template-based implementation, you can choose among
different underlying classes for representing edges in a graph. For
example, in the very same example you linked:
https://github.com/jlblancoc/mrpt/blob/master/samples/graph_slam_demo/test.cpp#L306
"1. CNetworkOfPoses2D \n"
"2. CNetworkOfPoses2DInf \n"
"3. CNetworkOfPoses3D \n"
"4. CNetworkOfPoses3DInf
See this page for reference:
http://reference.mrpt.org/svn/classmrpt_1_1graphs_1_1_c_network_of_poses.html
and you will see that some edges have covariance, other do not. The
latter simply assume an identical, constant covariance in ALL edges.
Not very realistic, but much faster to compute.
The example may be cumbersome if you are not familiar with C++
templates, but the covariance is set around line 65:
https://github.com/jlblancoc/mrpt/blob/master/samples/graph_slam_demo/test.cpp#L65
Cheers,
JL
> --
> You received this message because you are subscribed to the Google Groups
> "mrpt-users" group.
> To unsubscribe from this group and stop receiving emails from it, send an
> email to
mrpt-users+...@googlegroups.com.
> To post to this group, send email to
mrpt-...@googlegroups.com.
> Visit this group at
http://groups.google.com/group/mrpt-users.
> For more options, visit
https://groups.google.com/d/optout.
--
___________________________________________________________
Dr. Jose-Luis Blanco-Claraco
CITE-IV 1.05
Universidad de Almería, Departamento de Ingeniería
04120 Almería (Spain)
http://www.ual.es/~jlblanco/
___________________________________________________________