Reasoning and predicting POMDP planning complexity via covering numbers

DOI10.1007/s11704-015-5038-5zbMath1403.68248OpenAlexW2296402458MaRDI QIDQ1712497

Quan Liu, Qiming Fu, Zongzhang Zhang, Xiaofang Zhang

Publication date: 22 January 2019

Published in: Frontiers of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11704-015-5038-5

zbMATH Keywords

covering numbercomplexity theorysearch spacePOMDP planning

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Uses Software

• POMDPS
• DESPOT

Cites Work

• Planning and acting in partially observable stochastic domains
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item