1146 search results - page 33 / 230 » On the Complexity of Domain-Independent Planning |
ICRA
2010
IEEE
13 years 6 months ago
2010
IEEE
Abstract— Enabling mobile robots to assemble large structures in constrained environments requires planning systems that are both capable of dealing with high complexity and can ...
EDBT
2008
ACM
14 years 8 months ago
2008
ACM
For complex data mining queries, query optimization issues arise, similar to those for the traditional database queries. However, few works have applied the cost-based query optim...
ICRA
2005
IEEE
14 years 1 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 ...
COMPGEOM
2004
ACM
14 years 1 months ago
2004
ACM
Let B be a set of n unit balls in R3 . We show that the combinatorial complexity of the space of lines in R3 that avoid all the balls of B is O(n3+ε ), for any ε > 0. This re...
LREC
2008
13 years 9 months ago
2008
This paper describes a study of the levels at which different rhetorical relations occur in rhetorical structure trees. In a previous empirical study (Williams and Reiter, 2003) o...