520 search results - page 3 / 104 » New Complexity Results for Classical Planning Benchmarks |
AAAI
2012
11 years 8 months ago
2012
The early classifications of the computational complexity of planning under various restrictions in STRIPS (Bylander) and SAS+ (B¨ackstr¨om and Nebel) have influenced followin...
AAAI
2006
13 years 7 months ago
2006
Temporally extended goals (TEGs) refer to properties that must hold over intermediate and/or final states of a plan. The problem of planning with TEGs is of renewed interest becau...
AI
2010
Springer
13 years 6 months ago
2010
Springer
Case-based planning can take advantage of former problem-solving experiences by storing in a plan library previously generated plans that can be reused to solve similar planning p...
IROS
2009
IEEE
14 years 27 days ago
2009
IEEE
Abstract— Optimal motions are usually used as joint reference trajectories for repetitive or complex motions. In the case of soccer robots, the kicking motion is usually a benchm...
FOCS
2006
IEEE
14 years 9 days ago
2006
IEEE
We address well-studied problems concerning the learnability of parities and halfspaces in the presence of classification noise. Learning of parities under the uniform distributi...