520 search results - page 3 / 104 » New Complexity Results for Classical Planning Benchmarks |
139
Voted
AAAI
2012
13 years 2 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...
128
Voted
AAAI
2006
15 years 1 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...
121
Voted
AI
2010
Springer
15 years 17 days 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...
99
Voted
IROS
2009
IEEE
15 years 7 months 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...
105
click to vote
FOCS
2006
IEEE
15 years 6 months 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...