A probabilistic plan recognition algorithm based on plan tree grammars-Reference-Cited by-同舟云学术

A probabilistic plan recognition algorithm based on plan tree grammars

Published:2009-07 Issue:11 Volume:173 Page:1101-1132
ISSN:0004-3702
Container-title:Artificial Intelligence
language:en
Short-container-title:Artificial Intelligence

Author:

Geib Christopher W.,Goldman Robert P.

Publisher

Elsevier BV

Subject

Artificial Intelligence,Linguistics and Language,Language and Linguistics

Reference55 articles.

1. D. Avrahami-Zilberbrand, G.A. Kaminka, Fast and complete symbolic plan recognition, in: Proceedings of the International Joint Conference on Artificial Intelligence, 2005

2. On a routing problem;Bellman;Quarterly of Applied Mathematics,1958

3. Temporal reasoning for planning and scheduling: Lessons learned;Boddy,1996

4. Scheduling with partial orders and a causal model;Boddy,1992

5. M. Boddy, R. Goldman, Empirical results on scheduling and dynamic backtracking, in: Proceedings of the International Symposium on Artificial Intelligence, Robotics, and Automation for Space, 1994

Cited by 96 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Optimizing pathfinding for goal legibility and recognition in cooperative partially observable environments;Artificial Intelligence;2024-08

2. Deceptive Path Planning via Count-Based Reinforcement Learning under Specific Time Constraint;Mathematics;2024-06-26

3. CASPER: Cognitive Architecture for Social Perception and Engagement in Robots;International Journal of Social Robotics;2024-03-14

4. RTS AI Problems and Techniques;Encyclopedia of Computer Graphics and Games;2024

5. Temporally extended goal recognition in fully observable non-deterministic domain models;Applied Intelligence;2023-12-14