• DocumentCode
    2691619
  • Title

    Simultaneous multi-line-segment merging for robot mapping using Mean shift clustering

  • Author

    Lakaemper, Rolf

  • Author_Institution
    Dept. of Comput. & Inf. Sci., Temple Univ., Philadelphia, PA, USA
  • fYear
    2009
  • fDate
    10-15 Oct. 2009
  • Firstpage
    1654
  • Lastpage
    1660
  • Abstract
    Line segment based representation of 2D robot maps is known to have advantages over raw point data or grid based representation gained from laser range scans. It significantly reduces the size of the data set. It also contains higher geometric information, which is necessary for robust post processing. The paper describes an algorithm to convert global 2D robot maps to line segment representation, using a pre-aligned set of point-based single scans as input. Mean-shift clustering on the set of all line segments is utilized to merge perceptually similar segments to single instances: locally linear features in the environment are unambiguously represented by single line segments in the final global map. Apart from a scaling parameter, the approach is parameter free. Experiments on real world data sets prove its applicability in the field of robot mapping.
  • Keywords
    SLAM (robots); geometry; pattern clustering; geometric information; global 2D robot maps; line segment representation; mean shift clustering; robot mapping; simultaneous multiline-segment merging; Clustering algorithms; Data acquisition; Data compression; Information science; Intelligent robots; Merging; Redundancy; Robustness; Simultaneous localization and mapping; USA Councils;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Intelligent Robots and Systems, 2009. IROS 2009. IEEE/RSJ International Conference on
  • Conference_Location
    St. Louis, MO
  • Print_ISBN
    978-1-4244-3803-7
  • Electronic_ISBN
    978-1-4244-3804-4
  • Type

    conf

  • DOI
    10.1109/IROS.2009.5354828
  • Filename
    5354828