[0] Potential fields can't tell you a route is a dead end until you reach the dead end. Then they only tell you you're at a dead end, but don't tell you how to get out and find a viable route. Add-on exit-a-dead-end algorithms I've seen have very inefficient movement.
Algorithms to avoid the dead end in the first place have to look ahead so far that you might as well use Dijkstra/A*.
----
Some papers I've turned up:
Potential fields:
- http://www.gamedev.net/page/resources/_/technical/artificial...
- http://www.heikohoffmann.de/htmlthesis/node56.html
- http://www.researchgate.net/publication/222662144_Solving_th...
- https://randomaccessmaths.wordpress.com/2013/10/27/potential...
Harmonic Potential Functions (related to potential fields, they attempt to solve the local minima/maxima problem)
- http://repository.cmu.edu/cgi/viewcontent.cgi?article=1625&c...
- http://www.itst2007.eurecom.fr/site/var/html/h1053/file1221....
- http://ieeexplore.ieee.org/xpl/login.jsp?tp=&arnumber=429591...
- http://ncsu.summon.serialssolutions.com/search?s.cmd=addFace...