Categories recording A polynomial planning algorithm that beats FF and LAMA Post date June 20, 2017 ICAPS 2017: A polynomial planning algorithm that beats FF and LAMAWatch this video on YouTube Nir Lipovetzky and Hector GeffnerA polynomial planning algorithm that beats FF and LAMAshort paper ← Symmetry Breaking in Star-Topology Decoupled Search → Improving MPGAA* for Extended Visibility Ranges