IDEAS home Printed from https://ideas.repec.org/h/spr/oprchp/978-3-540-77903-2_70.html
   My bibliography  Save this book chapter

Acceleration of the A*-Algorithm for the Shortest Path Problem in Digital Road Maps

In: Operations Research Proceedings 2007

Author

Listed:
  • Felix Hahne

    (Universität Hildesheim)

  • Curt Nowak

    (Universität Hildesheim)

  • Klaus Ambrosi

    (Universität Hildesheim)

Abstract

Using the A*-algorithm to solve point-to-point-shortest path problems, the number of iterations depends on the quality of the estimator for the remaining distance to the target. In digital maps of real road networks, iterations can be saved by using a better estimator than the Euclidian estimator. An approach is to integrate Segmentation Lines (SegLine) into the map modelling large obstacles. An auxiliary graph is constructed using the Seg-Lines wherein a shortest path is calculated yielding a better estimate. Some computational results are presented for a dynamic version of this approach.

Suggested Citation

  • Felix Hahne & Curt Nowak & Klaus Ambrosi, 2008. "Acceleration of the A*-Algorithm for the Shortest Path Problem in Digital Road Maps," Operations Research Proceedings, in: Jörg Kalcsics & Stefan Nickel (ed.), Operations Research Proceedings 2007, pages 455-460, Springer.
    • Handle: RePEc:spr:oprchp:978-3-540-77903-2_70
    DOI: 10.1007/978-3-540-77903-2_70
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:oprchp:978-3-540-77903-2_70. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.