Uninformed pathfinding: A new approach

Kai Li Lim, Kah Phooi Seng, Lee Seng Yeong, Li-Minn Ang, Sue Inn Ch'ng

    Research output: Contribution to journalArticlepeer-review

    11 Citations (Scopus)
    5 Downloads (Pure)


    This paper presents a new pathfinding algorithm called the boundary iterative-deepening depth-first search (BIDDFS) algorithm. The BIDDFS compromises the increasing memory usage of the Dijkstra's algorithm, where the memory clears enables the BIDDFS to consume less memory than the Dijkstra's algorithm. The expansion redundancy of the iterative-deepening depth-first search (IDDFS) is also compensated; it is faster than the IDDFS in all of the testing instances conducted. The BIDDFS is further enhanced for bidirectional searching to allow expanding to fewer nodes and reducing pathfinding time. The bidirectional BIDDFS and the parallel bidirectional BIDDFS are also proposed. The proposed BIDDFS is further extended to the multi-goal BIDDFS, which is able to search for multiple goals present on the map in a single search. Simulation examples and comparisons have revealed the good performance of the proposed algorithms.
    Original languageEnglish
    Pages (from-to)2722-2730
    Number of pages9
    JournalExpert Systems with Applications
    Issue number5
    Publication statusPublished - Apr 2015


    Dive into the research topics of 'Uninformed pathfinding: A new approach'. Together they form a unique fingerprint.

    Cite this