140 search results - page 9 / 28 » Possibilistic Planning: Representation and Complexity |
AIPS
2007
15 years 2 months ago
2007
We consider the problem of finding an n-agent jointpolicy for the optimal finite-horizon control of a decentralized Pomdp (Dec-Pomdp). This is a problem of very high complexity ...
ICRA
2008
IEEE
15 years 6 months ago
2008
IEEE
— This paper presents a dynamic and distributed reconfiguration planning algorithm for chain-type selfreconfigurable robots, by which a robot can autonomously self-reconfigure fr...
105
Voted
ICRA
2009
IEEE
15 years 6 months ago
2009
IEEE
— An autonomous robot system that is to act in a real-world environment is faced with the problem of having to deal with a high degree of both complexity as well as uncertainty. ...
AIPS
2006
15 years 1 months ago
2006
This paper presents an adaptation of the standard quantum search technique to enable application within Dynamic Programming, in order to optimise a Markov Decision Process. This i...
107
click to vote
ICTAI
2002
IEEE
15 years 4 months ago
2002
IEEE
(Appears as a regular paper in the proceedings of IEEE International Conference on Tools with Artificial Intelligence (ICTAI), IEEE Computer Society, Washington D.C. Nov. 2002, p...