565 search results - page 55 / 113 » Heuristics for Planning with SAT |
IJCAI
2001
13 years 9 months ago
2001
Boolean linear programs (BLPs) are ubiquitous in AI. Satisfiability testing, planning with resource constraints, and winner determination in combinatorial auctions are all example...
AI
2012
Springer
12 years 3 months ago
2012
Springer
This paper describes a challenging plan recognition problem that arises in environments in which agents engage widely in exploratory behavior, and presents new algorithms for eff...
IJCAI
1989
13 years 9 months ago
1989
Partially ordered plans have not solved the goal ordering problem. Consider: a goal in a par tially ordered plan is an operator precondition that is not yet achieved; operators,...
ICDE
2007
IEEE
14 years 9 months ago
2007
IEEE
Algorithms that exploit sort orders are widely used to implement joins, grouping, duplicate elimination and other set operations. Query optimizers traditionally deal with sort ord...
ICRA
2005
IEEE
14 years 1 months ago
2005
IEEE
Motion planning for robots with many degrees of freedom requires the exploration of an exponentially large configuration space. Single-query motion planners restrict exploration ...