Abstract
Dynamic Potential Search (DPS) is a recently introduced search algorithm that returns a bounded-suboptimal cost solution. DPS orders nodes in the open-list based on their potential which is a combination of both the g- and h-values of a node. In this paper we study the behavior of DPS on weighted graphs. In particular, we develop a new variant of DPS, called DPSU which calculates the potential by counting one for each edge regardless of its costs. We develop an eager version and a restrained version of DPSU. We then compare all these algorithms on a number of weighted graphs and study the pros and cons of each of them.
Original language | English |
---|---|
Pages | 119-123 |
Number of pages | 5 |
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 |
ASJC Scopus subject areas
- Computer Networks and Communications