• DocumentCode
    2513793
  • Title

    An Offline Map Matching via Integer Programming

  • Author

    Yanagisawa, Hiroki

  • Author_Institution
    IBM Res.-Tokyo, IBM Japan Ltd., Yamato, Japan
  • fYear
    2010
  • fDate
    23-26 Aug. 2010
  • Firstpage
    4206
  • Lastpage
    4209
  • Abstract
    The map matching problem is, given a spatial road network and a sequence of locations of an object moving on the network, to identify the path in the network that the moving object passed through. In this paper, an integer programming formulation for the offline map matching problem is presented. This is the first approach that gives the optimal solution with respect to a widely used objective function for map matching.
  • Keywords
    data handling; integer programming; pattern matching; traffic engineering computing; integer programming; offline map matching; spatial road network; Accuracy; Global Positioning System; IP networks; Linear programming; Roads; TV; Trajectory; integer programming; map matching;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Pattern Recognition (ICPR), 2010 20th International Conference on
  • Conference_Location
    Istanbul
  • ISSN
    1051-4651
  • Print_ISBN
    978-1-4244-7542-1
  • Type

    conf

  • DOI
    10.1109/ICPR.2010.1022
  • Filename
    5597744
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2513793