Abstract
In this chapter, we will be concerned with the problem of identifying correct correspondences between an AGVG extracted from local information about the robot’s surroundings and the memorized map AGVG. Identifying the correct correspondences is a crucial step for complementing the map AGVG incrementally by inserting newly perceived parts from the local AGVGs and for localization in general. We develop a matching approach based on the notion of edit distance that compares the graph structures and the annotations of the AGVGs. Results from the previous chapter with regard to assessing the stability of Voronoi nodes are incorporated into the matching process in order to adequately deal with potential variations in the AGVGs.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Wallgrün, J.O. (2010). Voronoi Graph Matching for Data Association. In: Hierarchical Voronoi Graphs. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-10345-2_5
Download citation
DOI: https://doi.org/10.1007/978-3-642-10345-2_5
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-10302-5
Online ISBN: 978-3-642-10345-2
eBook Packages: EngineeringEngineering (R0)