408 search results - page 14 / 82 » A lookahead strategy for solving large planning problems |
ECP
1997
Springer
15 years 1 months ago
1997
Springer
During the planning process, a planner may have many options for refinements to perform on the plan being developed. The planner’s efficiency depends on how it chooses which ref...
ATMOS
2007
14 years 11 months ago
2007
Abstract. Approximate dynamic programming offers a new modeling and algorithmic strategy for complex problems such as rail operations. Problems in rail operations are often modeled...
66
Voted
AAAI
1997
14 years 11 months ago
1997
We report on the performance of an enhanced version of the “Davis-Putnam” (DP) proof procedure for propositional satisfiability (SAT) on large instances derived from realworld...
LPAR
2001
Springer
15 years 2 months ago
2001
Springer
When it comes to building robot controllers, highlevel programming arises as a feasible alternative to planning. The task then is to verify a high-level program by finding a lega...
76
Voted
AIIA
2003
Springer
15 years 1 months ago
2003
Springer
This paper attempts to analyze the issue of planning and scheduling integration from the point of view of information sharing. This concept is the basic bridging factor between the...