链接:Web上的AI规划资源

R. Amant, R. Young
{"title":"链接:Web上的AI规划资源","authors":"R. Amant, R. Young","doi":"10.1145/376451.376464","DOIUrl":null,"url":null,"abstract":"W ith the introduction of new, efficient techniques for planning, interest in the field has risen sharply in recent years. Planning systems have come a long way since the days of Blocks World. Today, planning and scheduling techniques are being used to solve problems in military campaign planning, robot navigation, industrial equipment scheduling, human-computer interaction, and many other real-world domains. Planning, which is the process of finding a sequence of actions that meets an agents goal, is a thriving area of artificial intelligence (AI) research and is growing almost faster than one can keep track. Fortunately, an abundance of information about planning is available, in both paper and electronic forms; answers to most of the questions a newcomer to the field might ask can easily be found. Early approaches to planning , as exemplified by STRIPS (Stanford Research Institute Problem Solver), viewed the planning problem as that of generating a sequence of operators that will transform the current state of the environment into a goal state. This approach is sometimes referred to in the planning literature as \" state space search. \" Eventually a different perspective gained dominance , in which states represented not properties of the environment but the plans being considered. That is, rather than searching through a space of world states, planning systems searched through a space of partially elaborated plans. Penberthy and Weld's UCPOP, a partial-order planner, is one of the best known examples of this approach. More recently, with the development of the Graphplan algorithm by Blum and Furst, another conceptual shift has taken place. Many systems now treat planning as a form of constraint satisfaction, exploiting new work on efficient algorithms in this area. These are just a few high points in a rich and very branchy history of planning systems. A good historical introduction to planning starts with an article in AI Magazine titled \" AI Planning: Systems and Techniques \" (Hendler et al. 1990). Beginning with a description of the planning problem as \" designing systems which can describe a set of actions (or plan) which can be expected to allow the system to reach a desired goal, \" Hendler et al. discuss common techniques used for planning, a chronology of planning systems, and some of the problems that planning addresses: reasoning about time, physical constraints on solutions, execution uncertainty, perception, and multi-agent systems. In addition to Hendler et al.'s discussion of …","PeriodicalId":8272,"journal":{"name":"Appl. Intell.","volume":"7 1","pages":"17-19"},"PeriodicalIF":0.0000,"publicationDate":"2001-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Links: AI planning resources on the Web\",\"authors\":\"R. Amant, R. Young\",\"doi\":\"10.1145/376451.376464\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"W ith the introduction of new, efficient techniques for planning, interest in the field has risen sharply in recent years. Planning systems have come a long way since the days of Blocks World. Today, planning and scheduling techniques are being used to solve problems in military campaign planning, robot navigation, industrial equipment scheduling, human-computer interaction, and many other real-world domains. Planning, which is the process of finding a sequence of actions that meets an agents goal, is a thriving area of artificial intelligence (AI) research and is growing almost faster than one can keep track. Fortunately, an abundance of information about planning is available, in both paper and electronic forms; answers to most of the questions a newcomer to the field might ask can easily be found. Early approaches to planning , as exemplified by STRIPS (Stanford Research Institute Problem Solver), viewed the planning problem as that of generating a sequence of operators that will transform the current state of the environment into a goal state. This approach is sometimes referred to in the planning literature as \\\" state space search. \\\" Eventually a different perspective gained dominance , in which states represented not properties of the environment but the plans being considered. That is, rather than searching through a space of world states, planning systems searched through a space of partially elaborated plans. Penberthy and Weld's UCPOP, a partial-order planner, is one of the best known examples of this approach. More recently, with the development of the Graphplan algorithm by Blum and Furst, another conceptual shift has taken place. Many systems now treat planning as a form of constraint satisfaction, exploiting new work on efficient algorithms in this area. These are just a few high points in a rich and very branchy history of planning systems. A good historical introduction to planning starts with an article in AI Magazine titled \\\" AI Planning: Systems and Techniques \\\" (Hendler et al. 1990). Beginning with a description of the planning problem as \\\" designing systems which can describe a set of actions (or plan) which can be expected to allow the system to reach a desired goal, \\\" Hendler et al. discuss common techniques used for planning, a chronology of planning systems, and some of the problems that planning addresses: reasoning about time, physical constraints on solutions, execution uncertainty, perception, and multi-agent systems. In addition to Hendler et al.'s discussion of …\",\"PeriodicalId\":8272,\"journal\":{\"name\":\"Appl. Intell.\",\"volume\":\"7 1\",\"pages\":\"17-19\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2001-03-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Appl. Intell.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/376451.376464\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Appl. Intell.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/376451.376464","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

近年来,随着新的、有效的规划技术的引入,人们对这一领域的兴趣急剧上升。自Blocks World时代以来,规划系统已经走过了漫长的道路。今天,计划和调度技术正被用于解决军事行动计划、机器人导航、工业设备调度、人机交互和许多其他现实世界领域的问题。规划是寻找满足代理目标的一系列行动的过程,是人工智能(AI)研究的一个蓬勃发展的领域,其发展速度几乎快得让人无法追踪。幸运的是,有大量关于规划的信息,有纸质的,也有电子的;这个领域的新手可能会问的大多数问题的答案都很容易找到。早期的规划方法,如斯坦福研究所问题解决器(strip)所示,将规划问题视为生成一系列将环境当前状态转换为目标状态的操作符的问题。这种方法有时在规划文献中被称为“状态空间搜索”。最终,一种不同的观点占据了主导地位,在这种观点中,国家代表的不是环境的属性,而是正在考虑的计划。也就是说,计划系统不是在世界状态的空间中搜索,而是在部分详细计划的空间中搜索。Penberthy和Weld的偏序规划器UCPOP就是这种方法最著名的例子之一。最近,随着Blum和Furst的Graphplan算法的发展,另一个概念上的转变发生了。许多系统现在将规划视为约束满足的一种形式,在这一领域开发了高效算法的新工作。这些只是规划系统丰富而分支的历史中的几个亮点。关于规划的一个很好的历史介绍始于AI杂志上的一篇题为“AI规划:系统和技术”的文章(Hendler et al. 1990)。Hendler等人首先将规划问题描述为“设计能够描述一系列行动(或计划)的系统,这些行动(或计划)可以使系统达到预期目标”,然后讨论了用于规划的常用技术,规划系统的年表,以及规划解决的一些问题:时间推理,解决方案的物理约束,执行不确定性,感知和多代理系统。除了Hendler等人关于…
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Links: AI planning resources on the Web
W ith the introduction of new, efficient techniques for planning, interest in the field has risen sharply in recent years. Planning systems have come a long way since the days of Blocks World. Today, planning and scheduling techniques are being used to solve problems in military campaign planning, robot navigation, industrial equipment scheduling, human-computer interaction, and many other real-world domains. Planning, which is the process of finding a sequence of actions that meets an agents goal, is a thriving area of artificial intelligence (AI) research and is growing almost faster than one can keep track. Fortunately, an abundance of information about planning is available, in both paper and electronic forms; answers to most of the questions a newcomer to the field might ask can easily be found. Early approaches to planning , as exemplified by STRIPS (Stanford Research Institute Problem Solver), viewed the planning problem as that of generating a sequence of operators that will transform the current state of the environment into a goal state. This approach is sometimes referred to in the planning literature as " state space search. " Eventually a different perspective gained dominance , in which states represented not properties of the environment but the plans being considered. That is, rather than searching through a space of world states, planning systems searched through a space of partially elaborated plans. Penberthy and Weld's UCPOP, a partial-order planner, is one of the best known examples of this approach. More recently, with the development of the Graphplan algorithm by Blum and Furst, another conceptual shift has taken place. Many systems now treat planning as a form of constraint satisfaction, exploiting new work on efficient algorithms in this area. These are just a few high points in a rich and very branchy history of planning systems. A good historical introduction to planning starts with an article in AI Magazine titled " AI Planning: Systems and Techniques " (Hendler et al. 1990). Beginning with a description of the planning problem as " designing systems which can describe a set of actions (or plan) which can be expected to allow the system to reach a desired goal, " Hendler et al. discuss common techniques used for planning, a chronology of planning systems, and some of the problems that planning addresses: reasoning about time, physical constraints on solutions, execution uncertainty, perception, and multi-agent systems. In addition to Hendler et al.'s discussion of …
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Object interaction-based surveillance video synopsis Total generalized variational-liked network for image denoising Multi-level clustering based on cluster order constructed with dynamic local density Natural-language processing for computer-supported instruction Is AI abstract and impractical? isn't the answer obvious?
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1