Efficient single frontier bidirectional search

Marco Lippi; Marco Ernandes; Ariel Felner

Efficient single frontier bidirectional search

Marco Lippi, Marco Ernandes, Ariel Felner

Department of Software and Information Systems Engineering

Ben-Gurion University of the Negev

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

The Single Frontier Bi-Directional Search (SBS) framework was recently introduced. A node in SBS corresponds to a pair of states, one from each of the frontiers and it uses front-tofront heuristics. In this paper we present an enhanced version of SBS, called eSBS, where pruning and caching techniques are applied, which significantly reduce both time and memory needs of SBS. We then present a hybrid of eSBS and IDA* which potentially uses only the square root of the memory required by A* but enables to prune many nodes that IDA* would generate. Experimental results show the benefit of our new approaches on a number of domains.

Original language	English
Title of host publication	Proceedings of the 5th Annual Symposium on Combinatorial Search, SoCS 2012
Pages	49-56
Number of pages	8
State	Published - 1 Dec 2012
Event	5th International Symposium on Combinatorial Search, SoCS 2012 - Niagara Falls, ON, Canada Duration: 19 Jul 2012 → 21 Jul 2012

Publication series

Name	Proceedings of the 5th Annual Symposium on Combinatorial Search, SoCS 2012

Conference

Conference	5th International Symposium on Combinatorial Search, SoCS 2012
Country/Territory	Canada
City	Niagara Falls, ON
Period	19/07/12 → 21/07/12

All Science Journal Classification (ASJC) codes

Computer Networks and Communications

Cite this

@inproceedings{b256cb94eee6457b848c04f6c9634691,

title = "Efficient single frontier bidirectional search",

abstract = "The Single Frontier Bi-Directional Search (SBS) framework was recently introduced. A node in SBS corresponds to a pair of states, one from each of the frontiers and it uses front-tofront heuristics. In this paper we present an enhanced version of SBS, called eSBS, where pruning and caching techniques are applied, which significantly reduce both time and memory needs of SBS. We then present a hybrid of eSBS and IDA* which potentially uses only the square root of the memory required by A* but enables to prune many nodes that IDA* would generate. Experimental results show the benefit of our new approaches on a number of domains.",

author = "Marco Lippi and Marco Ernandes and Ariel Felner",

year = "2012",

month = dec,

day = "1",

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

isbn = "9781577355847",

series = "Proceedings of the 5th Annual Symposium on Combinatorial Search, SoCS 2012",

pages = "49--56",

booktitle = "Proceedings of the 5th Annual Symposium on Combinatorial Search, SoCS 2012",

note = "5th International Symposium on Combinatorial Search, SoCS 2012 ; Conference date: 19-07-2012 Through 21-07-2012",

}

TY - GEN

T1 - Efficient single frontier bidirectional search

AU - Lippi, Marco

AU - Ernandes, Marco

AU - Felner, Ariel

PY - 2012/12/1

Y1 - 2012/12/1

N2 - The Single Frontier Bi-Directional Search (SBS) framework was recently introduced. A node in SBS corresponds to a pair of states, one from each of the frontiers and it uses front-tofront heuristics. In this paper we present an enhanced version of SBS, called eSBS, where pruning and caching techniques are applied, which significantly reduce both time and memory needs of SBS. We then present a hybrid of eSBS and IDA* which potentially uses only the square root of the memory required by A* but enables to prune many nodes that IDA* would generate. Experimental results show the benefit of our new approaches on a number of domains.

AB - The Single Frontier Bi-Directional Search (SBS) framework was recently introduced. A node in SBS corresponds to a pair of states, one from each of the frontiers and it uses front-tofront heuristics. In this paper we present an enhanced version of SBS, called eSBS, where pruning and caching techniques are applied, which significantly reduce both time and memory needs of SBS. We then present a hybrid of eSBS and IDA* which potentially uses only the square root of the memory required by A* but enables to prune many nodes that IDA* would generate. Experimental results show the benefit of our new approaches on a number of domains.

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

M3 - منشور من مؤتمر

SN - 9781577355847

T3 - Proceedings of the 5th Annual Symposium on Combinatorial Search, SoCS 2012

SP - 49

EP - 56

BT - Proceedings of the 5th Annual Symposium on Combinatorial Search, SoCS 2012

T2 - 5th International Symposium on Combinatorial Search, SoCS 2012

Y2 - 19 July 2012 through 21 July 2012

ER -

Efficient single frontier bidirectional search

Abstract

Publication series

Conference

All Science Journal Classification (ASJC) codes

Other files and links

Fingerprint

Cite this