菜单

关于 🐙 GitHub
arXiv 提交日期: 2026-05-04
📄 Abstract - Counterfactual Reasoning in Automated Planning

Automated planning traditionally assumes that all aspects of a planning task (initial state, goals, and available actions) are fully specified in advance, an approach well-suited to domains with fixed rules and deterministic execution. However, real-world planning often requires flexibility, allowing for deviations from the original task parameters in response to unforeseen circumstances or to improve outcomes. This paper surveys existing works on counterfactual reasoning in automated planning, categorizing them by what elements are changed, when the reasoning is triggered, and why and how these changes are made. We conclude by discussing key findings and outlining open research questions to guide future work in this area.

顶级标签: agents machine learning
详细标签: automated planning counterfactual reasoning flexibility survey open questions 或 搜索:

自动化规划中的反事实推理 / Counterfactual Reasoning in Automated Planning


1️⃣ 一句话总结

该论文探讨了在自动化规划中如何通过反事实推理(即假设“如果当初情况不同会怎样”)来灵活调整任务参数,以应对意外或优化结果,并系统梳理了现有研究的分类方式、关键发现与未来方向。

源自 arXiv: 2605.02603