SixthSense: Fast and Reliable Recognition of Dead Ends in MDPs

14Citations
Citations of this article
28Readers
Mendeley users who have this article in their library.

Abstract

The results of the latest International Probabilistic Planning Competition (IPPC-2008) indicate that the presence of dead ends, states with no trajectory to the goal, makes MDPs hard for modern probabilistic planners. Implicit dead ends, states with executable actions but no path to the goal, are particularly challenging; existing MDP solvers spend much time and memory identifying these states. As a first attempt to address this issue, we propose a machine learning algorithm called SIXTHSENSE. SIXTHSENSE helps existing MDP solvers by finding nogoods, conjunctions of literals whose truth in a state implies that the state is a dead end. Importantly, our learned nogoods are sound, and hence the states they identify are true dead ends. SIXTHSENSE is very fast, needs little training data, and takes only a small fraction of total planning time. While IPPC problems may have millions of dead ends, they may typically be represented with only a dozen or two no-goods. Thus, nogood learning efficiently produces a quick and reliable means for dead-end recognition. Our experiments show that the nogoods found by SIXTHSENSE routinely reduce planning space and time on IPPC domains, enabling some planners to solve problems they could not previously handle.

Cite

CITATION STYLE

APA

Kolobov, A., Mausam, & Weld, D. S. (2010). SixthSense: Fast and Reliable Recognition of Dead Ends in MDPs. In Proceedings of the 24th AAAI Conference on Artificial Intelligence, AAAI 2010 (pp. 1108–1114). AAAI Press. https://doi.org/10.1609/aaai.v24i1.7752

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free