Modified OCL search integrates generative rollouts and learned heuristics for efficient inference in planning models across combinatorial domains.
Proceedings of the AAAI Conference on Artificial Intelligence , author=
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.AI 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Efficient Test-time Inference for Generative Planning Models with OCL Search
Modified OCL search integrates generative rollouts and learned heuristics for efficient inference in planning models across combinatorial domains.