IDEAS home Printed from https://ideas.repec.org/a/inm/orijoc/v34y2022i2p974-989.html
   My bibliography  Save this article

Iterative Deepening Dynamically Improved Bounds Bidirectional Search

Author

Listed:
  • John A. Pavlik

    (Department of Computer Science, University of Illinois, Urbana, Illinois 61801)

  • Edward C. Sewell

    (Department of Mathematics and Statistics, Southern Illinois University Edwardsville, Edwardsville, Illinois 62026)

  • Sheldon H. Jacobson

    (Department of Computer Science, University of Illinois, Urbana, Illinois 61801)

Abstract

This paper presents a new bidirectional search algorithm to solve the shortest path problem. The new algorithm uses an iterative deepening technique with a consistent heuristic to improve lower bounds on path costs. The new algorithm contains a novel technique of filtering nodes to significantly reduce the memory requirements. Computational experiments on the pancake problem, sliding tile problem, and Rubik’s cube show that the new algorithm uses significantly less memory and executes faster than A* and other state-of-the-art bidirectional algorithms. Summary of Contribution: Quickly solving single-source shortest path problems on graphs is important for pathfinding applications and is a core problem in both artificial intelligence and operations research. This paper attempts to solve large problems that do not easily fit into the available memory of a desktop computer, such as finding the optimal shortest set of moves to solve a Rubik’s cube, and solve them faster than existing algorithms.

Suggested Citation

  • John A. Pavlik & Edward C. Sewell & Sheldon H. Jacobson, 2022. "Iterative Deepening Dynamically Improved Bounds Bidirectional Search," INFORMS Journal on Computing, INFORMS, vol. 34(2), pages 974-989, March.
    • Handle: RePEc:inm:orijoc:v:34:y:2022:i:2:p:974-989
    DOI: 10.1287/ijoc.2021.1116
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/ijoc.2021.1116
    Download Restriction: no
    File URL: https://libkey.io/10.1287/ijoc.2021.1116?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    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:inm:orijoc:v:34:y:2022:i:2:p:974-989. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.