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

Computer Science and Engineering

Research output: Contribution to conference › Paper › 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
Pages	68-72
Number of pages	5
State	Published - 1984
Event	AAAI-84: Fourth National Conference on Artificial Intelligence - University of Texas, Austin, United States Duration: Aug 6 1984 → Aug 10 1984

Conference

Conference	AAAI-84: Fourth National Conference on Artificial Intelligence
Country/Territory	United States
City	Austin
Period	8/6/84 → 8/10/84

ASJC Scopus Subject Areas

General Engineering

Disciplines

Computer Sciences
Engineering
Mathematics

Access to Document

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

Cite this

@conference{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",

language = "American English",

pages = "68--72",

note = "AAAI-84: Fourth National Conference on Artificial Intelligence ; Conference date: 06-08-1984 Through 10-08-1984",

}

TY - CONF

T1 - Towards a Better Understanding of Bidirectional Search

AU - Davis, Henry W.

AU - Pollack, Randy B.

AU - Sudkamp, Thomas

PY - 1984

Y1 - 1984

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 - http://www.scopus.com/inward/record.url?scp=0020979436&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0020979436&partnerID=8YFLogxK

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

M3 - Paper

SP - 68

EP - 72

T2 - AAAI-84: Fourth National Conference on Artificial Intelligence

Y2 - 6 August 1984 through 10 August 1984

ER -

Towards a Better Understanding of Bidirectional Search

Abstract

Conference

ASJC Scopus Subject Areas

Disciplines

Access to Document

Other files and links

Cite this