408 search results - page 7 / 82 » A lookahead strategy for solving large planning problems |
86
Voted
CEC
2008
IEEE
15 years 4 months ago
2008
IEEE
—As more and more real-world optimization problems become increasingly complex, algorithms with more capable optimizations are also increasing in demand. For solving large scale ...
AAI
2004
14 years 9 months ago
2004
Work allocation planning is a vital and notoriously difficult task in areas characterised by large work forces, contiguous and sometimes overlapping shifts, regulatory and corpora...
AI
1999
Springer
14 years 9 months ago
1999
Springer
There are many different approaches to solving planning problems, one of which is the use of domain specific control knowledge to help guide a domain independent search algorithm. ...
CP
2010
Springer
14 years 8 months ago
2010
Springer
Generic SAT solvers have been very successful in solving hard combinatorial problems in various application areas, including AI planning. There is potential for improved performanc...
AIPS
2009
14 years 10 months ago
2009
In this paper a planning framework based on Ant Colony Optimization techniques is presented. It is well known that finding optimal solutions to planning problems is a very hard co...