Counterexample-guided Planning

07/04/2012
by   Krishnendu Chatterjee, et al.
0

Planning in adversarial and uncertain environments can be modeled as the problem of devising strategies in stochastic perfect information games. These games are generalizations of Markov decision processes (MDPs): there are two (adversarial) players, and a source of randomness. The main practical obstacle to computing winning strategies in such games is the size of the state space. In practice therefore, one typically works with abstractions of the model. The diffculty is to come up with an abstraction that is neither too coarse to remove all winning strategies (plans), nor too fine to be intractable. In verification, the paradigm of counterexample-guided abstraction refinement has been successful to construct useful but parsimonious abstractions automatically. We extend this paradigm to probabilistic models (namely, perfect information games and, as a special case, MDPs). This allows us to apply the counterexample-guided abstraction paradigm to the AI planning problem. As special cases, we get planning algorithms for MDPs and deterministic systems that automatically construct system abstractions.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

11/30/2018

Online abstraction with MDP homomorphisms for Deep Learning

Abstraction of Markov Decision Processes is a useful tool for solving co...
04/16/2019

Method for Constructing Artificial Intelligence Player with Abstraction to Markov Decision Processes in Multiplayer Game of Mahjong

We propose a method for constructing artificial intelligence (AI) of mah...
11/22/2017

Asymmetric Action Abstractions for Multi-Unit Control in Adversarial Real-Time Games

Action abstractions restrict the number of legal actions available durin...
07/19/2021

Rational Verification for Probabilistic Systems

Rational verification is the problem of determining which temporal logic...
08/14/2017

Motion Planning under Partial Observability using Game-Based Abstraction

We study motion planning problems where agents move inside environments ...
03/12/2020

Invariant Causal Prediction for Block MDPs

Generalization across environments is critical to the successful applica...
01/18/2014

Proximity-Based Non-uniform Abstractions for Approximate Planning

In a deterministic world, a planning agent can be certain of the consequ...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.