1146 search results - page 113 / 230 » On the Complexity of Domain-Independent Planning |
CP
1998
Springer
14 years 1 months ago
1998
Springer
The constraint paradigm provides powerful concepts to represent and solve different kinds of planning problems, e. g. factory scheduling. Factory scheduling is a demanding optimiz...
COMPGEOM
1987
ACM
14 years 21 days ago
1987
ACM
We are interested in Voronoi diagrams as a tool in robot path planning, where the search for a path in an r-dimensional space may be simplified to a search on an (r- l)-dimensional...
AAAI
2010
13 years 10 months ago
2010
Modern complex games and simulations pose many challenges for an intelligent agent, including partial observability, continuous time and effects, hostile opponents, and exogenous ...
SIGMOD
2007
ACM
14 years 9 months ago
2007
ACM
Good cardinality estimates are critical for generating good execution plans during query optimization. Complex predicates, correlations between columns, and user-defined functions...
ICRA
2009
IEEE
14 years 3 months ago
2009
IEEE
— The goal of motion planning is to find a feasible path that connects two positions and is free from collision with obstacles. Path sets are a robust approach to this problem i...