As the limitations of traditional AI plan representations have become apparent, researchers have turned to temporal logic as one means of providing rich languages for structuring planning knowledge. But these languages lack the ability to represent uncertainty, as well as lacking any kind of link to a theory of rational behavior. Decision Theory provides a normative model of choice under uncertainty such that recommended choices can be said to be rational under a well-defined notion of rationality. But traditional decision-theoretic representations are limited in their ability to structure knowledge other than beliefs and preferences.This thesis integrates AI and decision-theoretic approaches to the representation of planning problems by developing a first-order logic of time, chance, and action for representing and reasoning about plans. The semantics of the logic incorporates intuitive properties of time, chance, and action central to the planning problem. The logical language integrates both modal and probabilistic constructs and allows quantification over time points, probability values, and domain individuals. Probability is treated as a sentential operator in the language, so it can be arbitrarily nested and combined with other logical operators. The language can represent the chance that facts hold and events occur at various times. It can represent the chance that actions and other events affect the future. The model of action distinguishes between action feasibility, executability, and effects. Using this distinction, a notion of expected utility for acts that may not be feasible is defined. This notion is used to reason about the chance that trying a plan will achieve a given goal. An algorithm for the problem of building construction planning is developed and the logic is used to prove the algorithm correct.
Cited By
- Shakarian P, Parker A, Simari G and Subrahmanian V (2011). Annotated probabilistic temporal logic, ACM Transactions on Computational Logic (TOCL), 12:2, (1-44), Online publication date: 1-Jan-2011.
- Dix J, Kraus S and Subrahmanian V (2006). Heterogeneous temporal probabilistic agents, ACM Transactions on Computational Logic (TOCL), 7:1, (151-198), Online publication date: 1-Jan-2006.
- Dix J, Kraus S and Subrahmanian V Agents dealing with time and uncertainty Proceedings of the first international joint conference on Autonomous agents and multiagent systems: part 2, (912-919)
- Dix J, Nanni M and Subrahmanian V (2000). Probabilistic agent programs, ACM Transactions on Computational Logic (TOCL), 1:2, (208-246), Online publication date: 1-Oct-2000.
- Blythe J Planning with external events Proceedings of the Tenth international conference on Uncertainty in artificial intelligence, (94-101)
Index Terms
- Representing plans under uncertainty: a logic of time, chance, and action
Recommendations
Conformant plans and beyond: Principles and complexity
Conformant planning is used to refer to planning for unobservable problems whose solutions, like classical planning, are linear sequences of operators called linear plans. The term 'conformant' is automatically associated with both the unobservable ...
Arguing about plans: plan representation and reasoning for mixed-initiative planning
AIPS'94: Proceedings of the Second International Conference on Artificial Intelligence Planning SystemsWe consider the problem of representing plans for mixed-initiative planning, where several participants cooperate to develop plans. We claim that in such an environment, a crucial task is plan communication: the ability to suggest aspects of a plan, ...
On computing conformant plans using classical planners: a generate-and-complete approach
ICAPS'12: Proceedings of the Twenty-Second International Conference on International Conference on Automated Planning and SchedulingThe paper illustrates a novel approach to conformant planning using classical planners. The approach relies on two core ideas developed to deal with incomplete information in the initial situation: the use of a classical planner to solve non-classical ...