A Polynomial Planning Algorithm That Beats LAMA and FF

Research article (Proceedings of the International Conference on Automated Planning and Scheduling, 2017) · cited 23× · AI/ML

academia openalex:W2759610117

Press Enter · cited answer in seconds

A Polynomial Planning Algorithm That Beats LAMA and FF

Summary

A Polynomial Planning Algorithm That Beats LAMA and FF is a scholarly article^[1].

Key Facts

A Polynomial Planning Algorithm That Beats LAMA and FF's instance of is recorded as scholarly article^[2].

⭐ Popularity Graph

0/100 long tail

📊 Google Search Volume

no search data yet

Quick Facts

Instance of scholarly article

🔗 Connections

Authored by 1

Nir Lipovetzky

← Author of 1

Nir Lipovetzky

References

Programmatic citations — every numbered marker resolves to a verifiable graph row below.

Direct Wikidata claims

[2] ↑ A Polynomial Planning Algorithm That Beats LAMA and FF — instance of (P31): scholarly article. wikidata.org.

Class ancestry

[1] ↑ A Polynomial Planning Algorithm That Beats LAMA and FF is an instance of scholarly article (scholarly article) [P31, primary]. Wikidata. wikidata.org.

📑 Cite this page

Use these citations when quoting this entity in research, articles, AI prompts, or wherever provenance matters. We aggregate Wikidata + Wikipedia + authoritative open-data sources; the stitched, scored, cross-referenced view is what 4ort.xyz contributes.

APA

4ort.xyz Knowledge Graph. (2026). A Polynomial Planning Algorithm That Beats LAMA and FF. Retrieved May 24, 2026, from https://4ort.xyz/entity/a-polynomial-planning-algorithm-that-beats-lama-and-ff

MLA

“A Polynomial Planning Algorithm That Beats LAMA and FF.” 4ort.xyz Knowledge Graph, 4ort.xyz, 24 May. 2026, https://4ort.xyz/entity/a-polynomial-planning-algorithm-that-beats-lama-and-ff.

BibTeX

@misc{4ortxyz_a-polynomial-planning-algorithm-that-beats-lama-and-ff_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{A Polynomial Planning Algorithm That Beats LAMA and FF}}, year = {2026}, url = {https://4ort.xyz/entity/a-polynomial-planning-algorithm-that-beats-lama-and-ff}, note = {Accessed: 2026-05-24}}

LLM prompt

According to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): A Polynomial Planning Algorithm That Beats LAMA and FF — https://4ort.xyz/entity/a-polynomial-planning-algorithm-that-beats-lama-and-ff (retrieved 2026-05-24)

Canonical URL: https://4ort.xyz/entity/a-polynomial-planning-algorithm-that-beats-lama-and-ff · Last refreshed: May 24, 2026