1 code implementation • 16 Jan 2014 • Kenny Daniel, Alex Nash, Sven Koenig, Ariel Felner
Angle-Propagation Theta* achieves a better worst-case complexity per vertex expansion than Basic Theta* by propagating angle ranges when it expands vertices, but is more complex, not as fast and finds slightly longer paths.
