Abstract probabilistic modeling of action
Proceedings of the first international conference on Artificial intelligence planning systems
Using abstractions for decision-theoretic planning with time constraints
AAAI'94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 2)
AAAI'90 Proceedings of the eighth National conference on Artificial intelligence - Volume 1
Planning with deadlines in stochastic domains
AAAI'93 Proceedings of the eleventh national conference on Artificial intelligence
Efficient decision-theoretic planning: techniques and empirical analysis
UAI'95 Proceedings of the Eleventh conference on Uncertainty in artificial intelligence
Sound abstraction of probabilistic actions in the constraint mass assignment framework
UAI'96 Proceedings of the Twelfth international conference on Uncertainty in artificial intelligence
Geometric foundations for interval-based probabilities
Annals of Mathematics and Artificial Intelligence
A Replanning Algorithm for a Reactive Agent Architecture
AIMSA '02 Proceedings of the 10th International Conference on Artificial Intelligence: Methodology, Systems, and Applications
Partially observable Markov decision processes with imprecise parameters
Artificial Intelligence
Approximate algorithms for credal networks with binary variables
International Journal of Approximate Reasoning
Geometry of relative plausibility and relative belief of singletons
Annals of Mathematics and Artificial Intelligence
Robustness analysis of Bayesian networks with local convex sets of distributions
UAI'97 Proceedings of the Thirteenth conference on Uncertainty in artificial intelligence
Sound abstraction of probabilistic actions in the constraint mass assignment framework
UAI'96 Proceedings of the Twelfth international conference on Uncertainty in artificial intelligence
International Journal of Approximate Reasoning
Hi-index | 0.00 |
Modeling worlds and actions under uncertainty is one of the central problems in the framework of decision-theoretic planning. The representation must be general enough to capture real-world problems but at the same time it must provide a basis upon which theoretical results can be derived. The central notion in the framework we propose here is that of the affine-operator, which serves as a tool for constructing (convex) sets of probability distributions, and which can be considered as a generalization of belief functions and interval mass assignments. Uncertainty in the state of the worlds is modeled with sets of probability distributions, represented by affine-trees, while actions are defined as tree-manipulators. A small set of key properties of the affine-operator is presented, forming the basis for most existing operator-based definitions of probabilistie action projection and action abstraction. We derive and prove correct three projection rules, which vividly illustrate the precision-complexity tradeoff in plan projection. Finally, we show how the three types of action abstraction identified by Haddawy and Doan are manifested in the present framework.