Integrating Probabilistic Reasoning into Plan Recognition

نویسنده

  • Mathias Bauer
چکیده

Plan recognition is an important task whenever a system has to take into account an agent's actions and goals in order to be able to react adequately. Many plan recognizers, however, are only capable of deriving a set of equally plausible plan hypotheses. This is of little use whenever the system actually has to react, e.g., when an intelligent help system is asked to give advice to the user of an application system or when the user is to be ooered semantic plan completion. In such cases it is crucial to have a way of measuring which allows assessment of the various hypotheses and eventual selection of the \best" one if necessary. In this paper we describe how such a measure can be deened on the basis of Dempster-Shafer Theory and how it can be applied to any plan recognizer.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Probabilistic Plan Recognition for Hostile Agents

This paper presents a probabilistic and abductive theory of plan recognition that handles agents that are actively hostile to the inference of their plans. This focus violates a primary assumption of most previous work, namely complete observability of the executed actions.

متن کامل

Decision-Theoretic Approach to Plan Recognition

In this report, first we give a survey of the work in plan recognition field, including the evolution of different approaches, their strength and weaknesses. Then we propose two decision-theoretic approaches to plan recognition problem, which explicitly take outcome utilities into consideration. One is an extension within the probabilistic reasoning framework, by adding utility nodes to belief ...

متن کامل

Bayesian Abductive Logic Programs: A Probabilistic Logic for Abductive Reasoning

In this proposal, we introduce Bayesian Abductive Logic Programs (BALP), a probabilistic logic that adapts Bayesian Logic Programs (BLPs) for abductive reasoning. Like BLPs, BALPs also combine first-order logic and Bayes nets. However, unlike BLPs, which use deduction to construct Bayes nets, BALPs employ logical abduction. As a result, BALPs are more suited for problems like plan/activity reco...

متن کامل

Plan Recognition in Military Simulation: Incorporating Machine Learning with Intelligent Agents

A view of plan recognition shaped by both operational and computational requirements is presented. Operational requirements governing the level of delity and nature of the reasoning process combine with computational requirements including performance speed and software engineering e ort to constrain the types of solutions available to the software developer. By adopting machine learning to pro...

متن کامل

Probabilistic Abduction using Markov Logic Networks

Abduction is inference to the best explanation of a given set of evidence. It is important for plan or intent recognition systems. Traditional approaches to abductive reasoning have either used first-order logic, which is unable to reason under uncertainty, or Bayesian networks, which can handle uncertainty using probabilities but cannot directly handle an unbounded number of related entities. ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1994