【24h】

AI Planning through Mixed-Integer Programming

机译:通过混合整数编程进行AI规划

获取原文

摘要

We introduce a new ontology, a modeling approach to planning in STRIPS-like domains, and an extended numeric framework based on converting planning problems into Mixed-Integer Programming problems (MIPs). We describe a new planner, OptiPlan, which is based on that ontology. Frugal by design, OptiPlan always finds the provable "cheapest" plan or proves that the problem is infeasible. Extensions of STRIPS-like domains are applicable to a wide variety of Supply Chain Problems and thus build a bridge between Artificial Intelligence Planning and Manufacturing Planning. Furthermore, the new ontology offers an efficient, constructive alternative to a fifty-year old Bill-of-Materials (BOM) and Routing modeling philosophy with the controversial issue of BOM/Routing separation.
机译:我们介绍了一种新的本体,一种用于在类似STRIPS的域中进行规划的建模方法,以及一种基于将规划问题转换为混合整数编程问题(MIP)的扩展数字框架。我们描述了一个基于该本体的新计划程序OptiPlan。通过精打细算,OptiPlan总是找到可证明的“最便宜”计划或证明问题是不可行的。类似STRIPS的域的扩展适用于各种各样的供应链问题,从而在人工智能计划和制造计划之间架起了一座桥梁。此外,新的本体为具有五十年历史的物料清单(BOM)和工艺路线建模哲学提供了一种有效的,建设性的替代方案,其中包含有争议的BOM /工艺路线分离问题。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号