1464 search results - page 185 / 293 » Optimal Planning with ACO |
EDBT
2004
ACM
14 years 9 months ago
2004
ACM
The join operation, which combines tuples from multiple relations, is the most fundamental and, typically, the most expensive operation in database queries. The standard approach t...
IROS
2008
IEEE
14 years 3 months ago
2008
IEEE
— In this paper, we propose an action planning algorithm and its evaluation method based on dynamic simulation for a novel type of hybrid leg-wheel rover for planetary exploratio...
ATAL
2007
Springer
14 years 3 months ago
2007
Springer
Planning in single-agent models like MDPs and POMDPs can be carried out by resorting to Q-value functions: a (near-) optimal Q-value function is computed in a recursive manner by ...
AIPS
2009
13 years 10 months ago
2009
Solving multiagent planning problems modeled as DECPOMDPs is an important challenge. These models are often solved by using dynamic programming, but the high resource usage of cur...
AIPS
2009
13 years 10 months ago
2009
abstraction heuristics, notably pattern-database and merge-and-shrink heuristics, are employed by some state-ofthe-art optimal heuristic-search planners. The major limitation of t...