179 search results - page 9 / 36 » Using Classical Planners to Solve Nondeterministic Planning ... |
145
click to vote
JAIR
2011
14 years 8 months ago
2011
Current evaluation functions for heuristic planning are expensive to compute. In numerous planning problems these functions provide good guidance to the solution, so they are wort...
ICRA
2005
IEEE
15 years 7 months ago
2005
IEEE
— The last decade, sampling based planners like the Probabilistic Roadmap Method have proved to be successful in solving complex motion planning problems. We give a reachability ...
106
click to vote
ICRA
2005
IEEE
15 years 7 months ago
2005
IEEE
Abstract— High-dimensional problems arising from complex robotic systems test the limits of current motion planners and require the development of efficient distributed motion p...
AIPS
2010
15 years 4 months ago
2010
We present an extension of the planning framework based on action graphs and local search to deal with PDDL2.1 temporal problems requiring concurrency, while previously the approa...
127
click to vote
ICTAI
2002
IEEE
15 years 6 months ago
2002
IEEE
(Appears as a regular paper in the proceedings of IEEE International Conference on Tools with Artificial Intelligence (ICTAI), IEEE Computer Society, Washington D.C. Nov. 2002, p...