Towards a Better Understanding of Bidirectional Search

Henry W. Davis; Randy B. Pollack; Thomas Sudkamp

Towards a Better Understanding of Bidirectional Search

Henry W. Davis, Randy B. Pollack, Thomas Sudkamp

Wright State University

Research output: Contribution to journal › Article › peer-review

Abstract

Three admissible bidirectional search algorithms have been described in the literature: A Cartesian product approach due to Doran, Pohl's BHPA, and Champeaux and Sint's BHFFA2. This paper describes an algorithm, GP, which contains the latter two and others. New admissibility results are obtained. A first order analysis is made comparing the run times of Cartesian products search, two versions of GP, and unidirectional A . The goal is to gain insight on when bidirectional search is useful and direction for seeking better bidirectional search algorithms.

Original language	American English
Journal	Fourth National Conference on Artificial Intelligence
State	Published - Aug 1 1984

Disciplines

Computer Sciences
Engineering
Mathematics
Physical Sciences and Mathematics

Access to Document

http://www.aaai.org/Papers/AAAI/1984/AAAI84-012.pdf

Cite this

@article{db0006b56f3e4676a6876ed2e1952b09,

title = "Towards a Better Understanding of Bidirectional Search",

abstract = " Three admissible bidirectional search algorithms have been described in the literature: A Cartesian product approach due to Doran, Pohl's BHPA, and Champeaux and Sint's BHFFA2. This paper describes an algorithm, GP, which contains the latter two and others. New admissibility results are obtained. A first order analysis is made comparing the run times of Cartesian products search, two versions of GP, and unidirectional A . The goal is to gain insight on when bidirectional search is useful and direction for seeking better bidirectional search algorithms.",

author = "Davis, {Henry W.} and Pollack, {Randy B.} and Thomas Sudkamp",

year = "1984",

month = aug,

day = "1",

language = "American English",

journal = "Fourth National Conference on Artificial Intelligence",

}

TY - JOUR

T1 - Towards a Better Understanding of Bidirectional Search

AU - Davis, Henry W.

AU - Pollack, Randy B.

AU - Sudkamp, Thomas

PY - 1984/8/1

Y1 - 1984/8/1

N2 - Three admissible bidirectional search algorithms have been described in the literature: A Cartesian product approach due to Doran, Pohl's BHPA, and Champeaux and Sint's BHFFA2. This paper describes an algorithm, GP, which contains the latter two and others. New admissibility results are obtained. A first order analysis is made comparing the run times of Cartesian products search, two versions of GP, and unidirectional A . The goal is to gain insight on when bidirectional search is useful and direction for seeking better bidirectional search algorithms.

AB - Three admissible bidirectional search algorithms have been described in the literature: A Cartesian product approach due to Doran, Pohl's BHPA, and Champeaux and Sint's BHFFA2. This paper describes an algorithm, GP, which contains the latter two and others. New admissibility results are obtained. A first order analysis is made comparing the run times of Cartesian products search, two versions of GP, and unidirectional A . The goal is to gain insight on when bidirectional search is useful and direction for seeking better bidirectional search algorithms.

UR - https://corescholar.libraries.wright.edu/cse/466

UR - http://www.aaai.org/Papers/AAAI/1984/AAAI84-012.pdf

M3 - Article

JO - Fourth National Conference on Artificial Intelligence

JF - Fourth National Conference on Artificial Intelligence

ER -

Towards a Better Understanding of Bidirectional Search

Abstract

Disciplines

Access to Document

Other files and links

Cite this