140 search results - page 11 / 28 » Possibilistic Planning: Representation and Complexity |
ICRA
2005
IEEE
14 years 2 months ago
2005
IEEE
— We present a new approach to path planning for flexible wires. We introduce a method for computing stable configurations of a wire subject to manipulation constraints. These ...
AI
2007
Springer
14 years 3 months ago
2007
Springer
DEC-POMDPs provide formal models of many cooperative multiagent problems, but their complexity is NEXP-complete in general. We investigate a sub-class of DEC-POMDPs termed multiage...
CEC
2005
IEEE
14 years 2 months ago
2005
IEEE
Evolutionary Computation has demonstrated the ability to design novel and interesting objects. Such objects are increasingly being assembled in the physical world, albeit with some...
IJCAI
2007
13 years 10 months ago
2007
The PDDL3 specifications include soft goals and trajectory constraints for distinguishing highquality plans among the many feasible plans in a solution space. To reduce the compl...
PKDD
2009
Springer
14 years 3 months ago
2009
Springer
Probabilistic relational models are an efficient way to learn and represent the dynamics in realistic environments consisting of many objects. Autonomous intelligent agents that gr...