首页> 外文学位 >Recognizing Teams and Their Plans: General Plan Recognition in Multi-Agent Domains
【24h】

Recognizing Teams and Their Plans: General Plan Recognition in Multi-Agent Domains

机译:识别团队及其计划:多代理域中的总体计划识别

获取原文
获取原文并翻译 | 示例

摘要

The ability to observe the actions of individual agents and from those to infer which are working together as teams and what they are attempting to accomplish is the focus of Multi- Agent Plan Recognition (MAPR) research. MAPR is a subset of the Plan, Activity, and Intent Recognition (PAIR) research topic in Artificial Intelligence (AI). Most current MAPR solutions tend to target recognizing activities in specific domains, rely on matching observations to human generated libraries of "sequences to look for", depend on base rates, and/or forensically analyzing the structures of complete synchronized traces. Our contributions avoid all of these simplifications to the MAPR challenge while focusing on persistent non-interfering teams and team-level goal-oriented plans.;In this research, we extend MAPR research by introducing three new recognition algorithms that are application independent (i.e., general), match observations to planning domain descriptions, and provide on-line recognitions after every serial observation. Our initial algorithm, Event Sequence Alignment (ESA) generates its own plan library and compares it to observations. Our second and third algorithms extend Plan Recognition as Planning (PRAP) to multiple agents with discrete and probabilistic versions of Multi-Agent PRAP (MAPRAP). For each algorithm we detail its design and evaluate its recall, precision, and accuracy as a function of time (i.e., observations) and across three multi-agent domains. We introduce our framework for evaluating and several methods for predicting performance.;Our results show that when agent traces are optimal, MAPRAP and P-MAPRAP achieve perfect recall over the entire trace, ensuring that early-stage recognition does not miss the correct interpretation, and increasing accuracy and precision levels. For ESA, we show previously unreported challenges with a prior plan libraries that are amplified with multiagent scheduling. For P-MAPRAP we evaluate online MAPR in non-ideal condition such as dropped observations and suboptimal team plans. We present differences in recognition approach, domain, team compositions, and degree of error.
机译:观察单个代理的行为以及从中推断单个代理的行为的能力以及他们试图完成的工作是多代理计划识别(MAPR)研究的重点。 MAPR是人工智能(AI)中计划,活动和意图识别(PAIR)研究主题的子集。当前的大多数MAPR解决方案都倾向于针对特定域中的识别活动,依赖于与人类生成的“要查找的序列”库相匹配的观察结果,依赖于基本速率和/或进行法医分析完整同步迹线的结构。我们的贡献避免了针对MAPR挑战的所有这些简化,同时专注于持久的无干扰团队和团队级别的目标导向计划。;在本研究中,我们通过引入三种独立于应用程序的新识别算法(即,一般),将观察结果与计划域描述相匹配,并在每次进行串行观察后提供在线识别。我们的初始算法,事件序列比对(ESA)会生成自己的计划库,并将其与观测值进行比较。我们的第二种算法和第三种算法将计划识别为计划(PRAP)扩展到了具有多个和不同版本的Multi-Agent PRAP(MAPRAP)的多个代理。对于每种算法,我们都会详细介绍其设计并评估其回忆性,准确性和准确性随时间的变化(即观察值)以及跨三个多主体域的时间。我们介绍了评估框架和几种预测性能的方法。我们的结果表明,当代理踪迹最佳时,MAPRAP和P-MAPRAP可以在整个踪迹上实现完美的召回率,从而确保早期识别不会错过正确的解释,并提高准确性和精度水平。对于ESA,我们展示了先前计划库中未曾报告的挑战,该计划库已通过多主体调度进行了放大。对于P-MAPRAP,我们在非理想条件下(例如,观察值下降和团队计划不理想)评估在线MAPR。我们介绍了识别方法,领域,团队组成和错误程度的差异。

著录项

  • 作者

    Argenta, Christopher F.;

  • 作者单位

    North Carolina State University.;

  • 授予单位 North Carolina State University.;
  • 学科 Computer science.;Artificial intelligence.
  • 学位 Ph.D.
  • 年度 2017
  • 页码 231 p.
  • 总页数 231
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类
  • 关键词

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号