English(EN) Finding Optimal Cost-Bounded Plan Reductions: Refined Model

新的ILP模型精炼成本约束计划缩减

作者 PulseAugur 编辑部 · [1 个来源] · 2026-07-29 04:00

研究人员开发了一个精炼模型，用于从预计算的计划中提取最优成本约束子计划。当初始计划制定后出现预算限制时，这是一项关键任务。这种新方法在成本限制内最大限度地提高了效用，同时保留了原始动作顺序和可执行性。该研究引入了一种增强的整数线性规划（ILP）公式，显著减小了模型规模并提高了计算效率，该研究建立在ICAPS 2026上发表的先前工作的基础上。 AI

影响这项研究可能导致在面临动态预算限制的人工智能规划系统中实现更高效的资源管理。

排序理由该集群包含一篇学术论文，详细介绍了一种用于规划问题的新模型和方法。[lever_c_demoted from research: ic=1 ai=1.0]

在 arXiv cs.AI 阅读 →

AI 生成摘要 · Google Gemini · 来自 1 个来源。我们如何撰写摘要 →

本文如何被排名

Signal score: 0 / 100; Composite score across the factors below. Higher = stronger signal that this story matters right now.
Newsworthiness bucket: Tool; 该集群包含一篇学术论文，详细介绍了一种用于规划问题的新模型和方法。[lever_c_demoted from research: ic=1 ai=1.0]
Source corroboration: Single-source cluster; Only one publisher covered this so far. Single-source stories can still rank when the publisher is high-authority, but they lack cross-source corroboration.
Topics: paper, other; Editorial topic classification. Feeds into how the story surfaces on /topic/<slug> hub pages and into the per-entity coverage mix.
AI-industry relevance: High; Clearly on-topic for AI-industry coverage.
Story freshness: 64 days old; Aged out of breaking-news scoring windows; ranking reflects the durable signal from the full source set.

完整方法见我们的编辑标准。

报道来源 [1]

arXiv cs.AI TIER_1 English(EN) · Martha Del Toro, Raquel Fuentetaja, Angel Garc\'ia-Olaya · 2026-07-29 04:00

寻找最优成本约束计划缩减：精炼模型

arXiv:2607.25484v1 Announce Type: new Abstract: In some real applications a plan may later become unfeasible due to newly imposed budget constraints, yet, at the same time, using only the original actions of the plan and their order is mandatory. In this paper, we study the probl…

本文如何被排名

报道来源 [1]

寻找最优成本约束计划缩减：精炼模型

相关实体

相关话题