Conservative edge sparsification for graph SLAM node removal.
Nicholas Carlevaris-BiancoRyan M. EusticePublished in: ICRA (2014)
Keyphrases
- undirected graph
- edge weights
- weighted graph
- graph structure
- directed graph
- disjoint paths
- bipartite graph
- strongly connected
- graph theory
- approximation algorithms
- densely connected
- directed acyclic graph
- connected components
- mobile robot
- spanning tree
- random walk
- tree structure
- structured data
- finding the shortest path
- graph partitioning
- nodes of a graph
- graph matching
- edge detection
- particle filter
- graph theoretic
- dynamic environments
- indoor environments
- complex networks
- edge information
- graph model
- degree distribution
- overlapping communities
- least squares
- bayesian networks
- shortest path