CORE
🇺🇦
make metadata, not war
Services
Services overview
Explore all CORE services
Access to raw data
API
Dataset
FastSync
Content discovery
Recommender
Discovery
OAI identifiers
OAI Resolver
Managing content
Dashboard
Bespoke contracts
Consultancy services
Support us
Support us
Membership
Sponsorship
Community governance
Advisory Board
Board of supporters
Research network
About
About us
Our mission
Team
Blog
FAQs
Contact us
Contingent planning under uncertainty via stochastic satisfiability
Authors
Michael L. Littman
Stephen M. Majercik
Publication date
1 July 2003
Publisher
Bowdoin Digital Commons
Doi
Cite
Abstract
We describe a new planning technique that efficiently solves probabilistic propositional contingent planning problems by converting them into instances of stochastic satisfiability (SSAT) and solving these problems instead. We make fundamental contributions in two areas: the solution of SSAT problems and the solution of stochastic planning problems. This is the first work extending the planning-as-satisfiability paradigm to stochastic domains. Our planner, ZANDER, can solve arbitrary, goal-oriented, finite-horizon partially observable Markov decision processes (POMDPs). An empirical study comparing ZANDER to seven other leading planners shows that its performance is competitive on a range of problems. © 2003 Elsevier Science B.V. All rights reserved
Similar works
Full text
Open in the Core reader
Download PDF
Available Versions
Elsevier - Publisher Connector
See this paper in CORE
Go to the repository landing page
Download from data provider
Last time updated on 05/06/2019
Elsevier - Publisher Connector
See this paper in CORE
Go to the repository landing page
Download from data provider
Last time updated on 06/05/2017
Bowdoin College
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:digitalcommons.bowdoin.edu...
Last time updated on 19/07/2023