0


使用组合范畴文法的概率规划识别和规划

Using Combinatory Categorial Grammars for Probabilistic Plan Recognition and Planning
课程网址: http://videolectures.net/is2011_geib_robotics/  
主讲教师: Christopher W. Geib
开课单位: 爱丁堡大学
开课时间: 2011-11-17
课程语种: 英语
中文简介:
** //免责声明:// VideoLectures.NET强调我们不是此录音的作者。**构建能够识别人类用户在高级别计划和目标方面的行动的智能系统继续变得越来越重要自动化系统在我们的日常生活中发挥着更大的作用因此,计划识别在机器人技术,用户界面,计算机网络安全,老年人辅助系统和许多其他领域中的应用越来越多。但是,之前关于计划识别的工作往往效率低下,无法将其应用于这些领域。计划认可的早期工作早期对假设的目标和计划作出了承诺。这可能导致维持大量假设,后来发现这是不可能的。之前的工作往往也未能利用这样一个事实,即某些行动对其父母计划的信息量明显高于其他行动。在本次演讲中,我将讨论一种新的计划识别概率算法,该算法代表了采用自然语言处理(称为组合分类语法(CCG))的语法形式所识别的计划。我将证明用CCG代表计划将使我们能够解决先前工作的这些局限性并导致显着的计算收益。
课程简介: **//Disclaimer:// VideoLectures.NET emphasizes we are not the authors of this recording.** Building intelligent systems that are capable of recognizing the actions of their human users in terms of high level plans and goals continues to gain importance as automated systems play a larger role in our everyday lives. As such, plan recognition has growing applications in robotics, user interfaces, computer network security, assistive systems for the elderly and many other areas. However, previous work on plan recognition has often been inefficient preventing its application to these domains. Much early work in plan recognition made early commitments to hypothesized goals and plans. This can result in maintaining a large number of hypothesis that will later be found to be impossible. Prior work has also often failed to leverage the fact that some actions are significantly more informative of their parent plans than others. In this talk I will argue for a new probabilistic algorithm for plan recognition that represents the plans to be recognized with a grammatical formalism taken from natural language processing called Combinatory Categorial Grammar (CCG). I will show that representing plans with CCG will allow us to address these limitations of prior work and result in significant computational gains.
关 键 词: 自动化系统; 安全辅助系统; 新概率算法识别
课程来源: 视频讲座网
最后编审: 2020-06-29:yumf
阅读次数: 56