SLIM:一种用于规划识别的半惰性推理机制
SLIM: Semi-Lazy Inference Mechanism for Plan Recognition
摘要:
计划识别算法需要识别一个完整的层次结构,解释代理的行动和目标。虽然这种算法的输出是信息的识别器,其计算的成本是高的运行时间,空间和完整性。此外,在线执行计划识别需要观察代理对尚未看到的未来行动进行推理,并维护一组假设来支持所有可能的选项。本文提出了一种新的有效的在线计划识别算法SLIM(半惰性推理机制)。它结合了自下而上和自上而下的解析过程,允许它只实时提交最少的必要操作,但仍然提供完整的假设事后。我们从理论上和经验表明,虽然这个过程的计算成本仍然是指数级的,有一个显着的改善,在运行时间相比,最先进的计划识别算法。
英文摘要:
Plan Recognition algorithms require to recognize a complete hierarchy explaining the agent's actions and goals. While the output of such algorithms is informative to the recognizer, the cost of its calculation is high in run-time, space, and completeness. Moreover, performing plan recognition online requires the observing agent to reason about future actions that have not yet been seen and maintain a set of hypotheses to support all possible options. This paper presents a new and efficient algorithm for online plan recognition called SLIM (Semi-Lazy Inference Mechanism). It combines both a bottom-up and top-down parsing processes, which allow it to commit only to the minimum necessary actions in real-time, but still provide complete hypotheses post factum. We show both theoretically and empirically that although the computational cost of this process is still exponential, there is a significant improvement in run-time when compared to a state of the art of plan recognition algorithm.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。