arXiv (All)
open access
LeanPlan: Optimal Planning with LLM-Generated Heuristics and Admissibility Proofs
Frontier large language models (LLMs) can generate heuristic functions that guide search to achieve state-of-the-art performance in satisficing planning, where any plan is acceptable. However, these heuristics are not guaranteed to be admissible and can lead to suboptimal plans. We introduce LeanPla
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- BANGLAPLAN: A Benchmark for Constraint-Based Planning and Decision-Making in Bangla#1354393
- RECAST: Expanding the Boundaries of LLMs' Complex Instruction Following with Multi-Constraint Data#925783
- Any House Any Task: Scalable Long-Horizon Planning for Abstract Human Tasks#1297037
- SimpleEvol: An Agent-Loop Framework for LLM-Driven Automated Heuristic Design with Minimal Human Priors#1132373
- MeEvo: Metacognitive Evolution Combined with Natural Evolution for Automatic Heuristic Design#926078
Record · ID 1217981
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive