9065 search results - page 1613 / 1813 » Robotics |
149
click to vote
ECP
1997
Springer
15 years 7 months ago
1997
Springer
We present a framework for encoding planning problems in logic programs with negation as failure, having computational e ciency as our major consideration. In order to accomplish o...
127
click to vote
ECP
1997
Springer
15 years 7 months ago
1997
Springer
Akey question in conditional planning is: howmany, and whichof the possible executionfailures shouldbe plannedfor? Onecannot, in general, plan for all the possiblefailures because...
137
click to vote
ECP
1997
Springer
15 years 7 months ago
1997
Springer
A possibilistic approach of planning under uncertainty has been developed recently. It applies to problems in which the initial state is partially known and the actions have graded...
131
click to vote
ECP
1997
Springer
15 years 7 months ago
1997
Springer
In 1969 Cordell Green presented his seminal description of planning as theorem proving with the situation calculus. The most pleasing feature of Green's account was the negli...
139
click to vote
GD
1997
Springer
15 years 7 months ago
1997
Springer
Although routing is a well-studied problem in various contexts, there remain unsolved problems in routing edges for graph layouts. In contrast with techniques from other domains su...