Dynamic Potential Search on Weighted Graphs.

Wheeler Ruml, Jordan T. Thayer, Bounded suboptimal search: a direct approach using inadmissible estimates international joint conference on artificial intelligence. pp. 674- 679 ,(2011) , 10.5591/978-1-57735-516-8/IJCAI11-119

Ira Pohl, The avoidance of (relative) catastrophe, heuristic competence, genuine dynamic weighting and computational issues in heuristic problem solving international joint conference on artificial intelligence. pp. 12- 17 ,(1973)

Nathan R. Sturtevant, Shahab Jabbari Arfaee, Richard Valenzano, Jordan Thayer, Roni Stern, Using alternative suboptimality bounds in Heuristic Search international conference on automated planning and scheduling. pp. 233- 241 ,(2013)

Wheeler Ruml, Christopher Makoto Wilt, Speedy Versus Greedy Search annual symposium on combinatorial search. ,(2014)

Rüdiger Ebendt, Rolf Drechsler, Weighted A∗ search -- unifying view and application Artificial Intelligence. ,vol. 173, pp. 1310- 1342 ,(2009) , 10.1016/J.ARTINT.2009.06.004

Roni Stern, Ariel Felner, Jur van den Berg, Rami Puzis, Rajat Shah, Ken Goldberg, Potential-based bounded-cost search and Anytime Non-ParametricA⁎ Artificial Intelligence. ,vol. 214, pp. 1- 25 ,(2014) , 10.1016/J.ARTINT.2014.05.002

Wheeler Ruml, Christopher Makoto Wilt, Cost-Based Heuristic Search Is Sensitive to the Ratio of Operator Costs annual symposium on combinatorial search. ,(2011)

Malte Helmert, Landmark Heuristics for the Pancake Problem annual symposium on combinatorial search. ,(2010)

Malte Helmert, Jordan Tyler Thayer, J. Benton, Better parameter-free anytime search by minimizing time between solutions SOCS. ,(2012)

Ariel Felner, Roni Stern, Daniel Gilon, Dynamic Potential Search — A New Bounded Suboptimal Search annual symposium on combinatorial search. pp. 36- 44 ,(2016)