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...
Benjamin J. McMahan, Guoqiang Pan, Patrick Porter,...
— 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...
Eric Rohmer, Giulio Reina, Genya Ishigami, Keiji N...
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 ...
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...
Christopher Amato, Jilles Steeve Dibangoye, Shlomo...
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...