The minimal set of states that must be expanded in a front-to-end bidirectional search

Eshed Shaham; Jingwei Chen; Ariel Felner; Nathan R. Sturtevant

The minimal set of states that must be expanded in a front-to-end bidirectional search

Eshed Shaham, Jingwei Chen, Ariel Felner, Nathan R. Sturtevant

Department of Software and Information Systems Engineering

Ben-Gurion University of the Negev

Research output: Contribution to conference › Paper › peer-review

Abstract

A* is optimal among admissible unidirectional algorithms when searching with a consistent heuristic. Recently, similar optimality bounds have been established for bidirectional search but, no practical algorithm is guaranteed to always achieve this bound. In this paper we study the nature of the number of nodes that must be expanded in any front-to-end bidirectional search. We present an efficient algorithm for computing that number and show that a theoretical parameterized generalization of MM, with the correct parameter, is the optimal front-to-end bidirectional search. We then experimentally compare various algorithms and show how far they are from optimal.

Original language	English
Pages	82-90
Number of pages	9
State	Published - 1 Jan 2017
Event	10th Annual Symposium on Combinatorial Search, SoCS 2017 - Pittsburgh, United States Duration: 16 Jun 2017 → 17 Jun 2017

Conference

Conference	10th Annual Symposium on Combinatorial Search, SoCS 2017
Country/Territory	United States
City	Pittsburgh
Period	16/06/17 → 17/06/17

All Science Journal Classification (ASJC) codes

Computer Networks and Communications

Cite this

@conference{1fb54ef7fd3a43c9b7a2a603240c2fe1,

title = "The minimal set of states that must be expanded in a front-to-end bidirectional search",

abstract = "A* is optimal among admissible unidirectional algorithms when searching with a consistent heuristic. Recently, similar optimality bounds have been established for bidirectional search but, no practical algorithm is guaranteed to always achieve this bound. In this paper we study the nature of the number of nodes that must be expanded in any front-to-end bidirectional search. We present an efficient algorithm for computing that number and show that a theoretical parameterized generalization of MM, with the correct parameter, is the optimal front-to-end bidirectional search. We then experimentally compare various algorithms and show how far they are from optimal.",

author = "Eshed Shaham and Jingwei Chen and Ariel Felner and Sturtevant, {Nathan R.}",

note = "Publisher Copyright: Copyright c 2017, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved.; 10th Annual Symposium on Combinatorial Search, SoCS 2017 ; Conference date: 16-06-2017 Through 17-06-2017",

year = "2017",

month = jan,

day = "1",

language = "الإنجليزيّة",

pages = "82--90",

}

TY - CONF

T1 - The minimal set of states that must be expanded in a front-to-end bidirectional search

AU - Shaham, Eshed

AU - Chen, Jingwei

AU - Felner, Ariel

AU - Sturtevant, Nathan R.

PY - 2017/1/1

Y1 - 2017/1/1

N2 - A* is optimal among admissible unidirectional algorithms when searching with a consistent heuristic. Recently, similar optimality bounds have been established for bidirectional search but, no practical algorithm is guaranteed to always achieve this bound. In this paper we study the nature of the number of nodes that must be expanded in any front-to-end bidirectional search. We present an efficient algorithm for computing that number and show that a theoretical parameterized generalization of MM, with the correct parameter, is the optimal front-to-end bidirectional search. We then experimentally compare various algorithms and show how far they are from optimal.

AB - A* is optimal among admissible unidirectional algorithms when searching with a consistent heuristic. Recently, similar optimality bounds have been established for bidirectional search but, no practical algorithm is guaranteed to always achieve this bound. In this paper we study the nature of the number of nodes that must be expanded in any front-to-end bidirectional search. We present an efficient algorithm for computing that number and show that a theoretical parameterized generalization of MM, with the correct parameter, is the optimal front-to-end bidirectional search. We then experimentally compare various algorithms and show how far they are from optimal.

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

M3 - محاضرة

SP - 82

EP - 90

T2 - 10th Annual Symposium on Combinatorial Search, SoCS 2017

Y2 - 16 June 2017 through 17 June 2017

ER -

The minimal set of states that must be expanded in a front-to-end bidirectional search

Abstract

Conference

All Science Journal Classification (ASJC) codes

Other files and links

Cite this