The Computational Complexity of Probabilistic Planning
M. L. Littman, J. Goldsmith, M. Mundhenk
Abstract
We examine the computational complexity of testing and finding small plans in probabilistic planning domains with both flat and propositional representations. The complexity of plan evaluation and existence varies with the plan type sought; we examine totally ordered plans, acyclic plans, and looping plans, and partially ordered plans under three natural definitions of plan value. We show that problems of interest are complete for a variety of complexity classes: PL, P, NP, co-NP, PP, NPPP, co-NPPP, and PSPACE. In the process of proving that certain planning problems are complete for NPPP, we introduce a new basic NPPP-complete problem, E-MAJSAT, which generalizes the standard Boolean satisfiability problem to computations involving probabilistic quantities; our results suggest that the development of good heuristics for E-MAJSAT could be important for the creation of efficient algorithms for a wide variety of problems.
Create a lesson
Related papers
Co-Evolving Acting and Forecasting for Language Agents
Haofei Yu, Yixing Chen, Yining Zhao et al.
Scaling Discovery Requires Forgetting
Shangyin Tan, Ben Zhou, Lakshya A Agrawal et al.
PhySGA: A Physics-Space Grounded Agentic Framework for Generalizable and Interactive 3D Composition
Weichen Lyu, Chong Xia, Mingyu Dong et al.
ActiveEvidence: Decision-Focused Evidence Graphs with Verifiable Acquisition Gaps
Miaobo Hu, Shuhao Hu, Xiaobo Guo et al.
The Wealth of Agents: Scaling Agentic AI Across Developers
Austin W. Hanjie, Carlos E. Jimenez, Zirui Wang et al.
SafeAdapt-Poker: Counterfactual Risk Calibration for Budgeted Adaptation under Opponent Shift
Miaobo Hu, Shuhao Hu, Xiaobo Guo et al.