169 search results - page 12 / 34 » Tractability of Planning with Loops |
ICRA
2003
IEEE
15 years 3 months ago
2003
IEEE
This paper proposes a novel path planning algorithm of 3-D articulated robots with moving bases based on a generalized potential field model. The approach computes, similar to th...
108
click to vote
DARS
2000
Springer
15 years 2 months ago
2000
Springer
In this paper, we address the issue of motion planning for a bipartite class of modular self-reconfiguring robotic system (I-Cubes) that is a collection of active elements providin...
IJCAI
1993
14 years 11 months ago
1993
One method for reducing the time required for plan generation is to learn search control rules from experience. Most of the recent work in learning search control knowledge has co...
111
click to vote
AAAI
2012
13 years 23 days 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...
111
click to vote
IJCAI
2001
14 years 11 months ago
2001
Certain planning systems that deal with quantitative time constraints have used an underlying Simple Temporal Problem solver to ensure temporal consistency of plans. However, many...