350 search results - page 4 / 70 » Complexity of Planning with Partial Observability |
ICRA
2005
IEEE
14 years 18 days ago
2005
IEEE
Abstract— We present a simple randomized POMDP algorithm for planning with continuous actions in partially observable environments. Our algorithm operates on a set of reachable b...
AIPS
2000
13 years 8 months ago
2000
AI
1998
Springer
13 years 6 months ago
1998
Springer
ATAL
2005
Springer
14 years 17 days ago
2005
Springer
We present the agent programming language POGTGolog, which combines explicit agent programming in Golog with game-theoretic multi-agent planning in a special kind of partially obs...
MATES
2009
Springer
14 years 1 months ago
2009
Springer
Abstract. It has been observed that there are interesting relations between planning and agent programming. This is not surprising as agent programming was partially motivated by t...