Abstract
Potential Search (PS) is an algorithm that is designed to solve bounded cost search problems. In this paper, we modify PS to work within the framework of bounded suboptimal search and introduce Dynamic Potential Search (DPS). DPS uses the idea of PS but modifies the bound to be the product of the minimal f-value in OPEN and the required suboptimal bound. We study DPS and its attributes. We then experimentally compare DPS to WA* and to EES on a variety of domains and study parameters that affect the behavior of these algorithms. In general we show that in domains with unit edge costs (e.g., many standard benchmarks) DPS significantly outperforms WA* and EES but there are exceptions.
| Original language | English |
|---|---|
| Title of host publication | Proceedings of the 9th Annual Symposium on Combinatorial Search, SoCS 2016 |
| Editors | Jorge A. Baier, Adi Botea |
| Publisher | AAAI press |
| Pages | 36-44 |
| Number of pages | 9 |
| ISBN (Electronic) | 9781577357698 |
| State | Published - 2016 |
| Externally published | Yes |
| Event | 9th Annual Symposium on Combinatorial Search, SoCS 2016 - Tarrytown, United States Duration: 6 Jul 2016 → 8 Jul 2016 |
Publication series
| Name | Proceedings of the 9th Annual Symposium on Combinatorial Search, SoCS 2016 |
|---|---|
| Volume | 2016-January |
Conference
| Conference | 9th Annual Symposium on Combinatorial Search, SoCS 2016 |
|---|---|
| Country/Territory | United States |
| City | Tarrytown |
| Period | 6/07/16 → 8/07/16 |
Bibliographical note
Publisher Copyright:Copyright © 2016, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved.
Funding
The research was supported by the Israeli Science Foundation (ISF) under grant #417/13 to Ariel Felner.
| Funders | Funder number |
|---|---|
| Israeli Science Foundation | |
| Israel Science Foundation | 417/13 |