Dynamic potential search on weighted graphs

Daniel Gilon, Ariel Felner, Roni Stern

Research output: Contribution to conferencePaperpeer-review


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 languageEnglish
Number of pages5
StatePublished - 1 Jan 2017
Event10th Annual Symposium on Combinatorial Search, SoCS 2017 - Pittsburgh, United States
Duration: 16 Jun 201717 Jun 2017


Conference10th Annual Symposium on Combinatorial Search, SoCS 2017
Country/TerritoryUnited States

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications


Dive into the research topics of 'Dynamic potential search on weighted graphs'. Together they form a unique fingerprint.

Cite this