914 search results - page 27 / 183 » The Computational Complexity of Probabilistic Planning |
AIPS
2010
14 years 20 days ago
2010
Factored planning methods aim to exploit locality to efficiently solve large but "loosely coupled" planning problems by computing solutions locally and propagating limit...
ICSOC
2003
Springer
14 years 3 months ago
2003
Springer
Abstract Interaction with web services enabled marketplaces would be greatly facilitated if users were given a high level service request language to express their goals in complex...
ICRA
2006
IEEE
14 years 4 months ago
2006
IEEE
— The configuration space of a robot is partitioned into free space and C-obstacle space. Most of the prior work in collision detection and motion planning algorithms is targete...
IJCINI
2007
13 years 10 months ago
2007
: The theme of this issue of IJCINI is on cognitive mechanisms of autonomic computing and laws of human cooperative work organization. This editorial addresses key notions of this ...
RAS
2006
13 years 10 months ago
2006
The probabilistic roadmap approach is one of the leading motion planning techniques. Over the past decade the technique has been studied by many different researchers. This has le...