1146 search results - page 34 / 230 » On the Complexity of Domain-Independent Planning |
SIGMOD
2003
ACM
14 years 8 months ago
2003
ACM
Decision-support applications generate queries with complex predicates. We show how the factorization of complex query expressions exposes significant opportunities for exploiting...
ICTAI
2002
IEEE
14 years 22 days 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...
IROS
2007
IEEE
14 years 2 months ago
2007
IEEE
— This paper considers the problem of coordinating multiple vehicles with kinodynamic constraints that operate in the same partially-known environment. The vehicles are able to c...
AIPS
2008
13 years 10 months ago
2008
We present a complex scheduling problem where we want to plan meetings between customers and exhibitors at a trade event. One cause of the complexity of the problem is the general...
Presentation
In robotic navigation, path planning is aimed at getting the optimum collision-free
path between a starting and target locations. The optimality criterion depends on
the surround...