Nareyek, A. 2001. |
Local-Search Heuristics for Generative Planning.
In Proceedings of the Fifteenth Workshop on AI in Planning, Scheduling, Configuration and Design (PuK 2001), 56-70.
Local-search approaches promise very interesting features for planning, such as an anytime computation and an uncomplicated handling of the environment's dynamics. However, most local-search approaches require the availability of maximal structures what causes problems of scalability. Local search within a generative planning process is rarely looked into. This article presents some basic heuristics for generative planning, and demonstrates the approaches' capabilities by way of solving variations of combined planning and scheduling in the Logistics Domain.
|Download||Rules and Regulations [PostScript; 1607 Kb] [compressed PostScript; 228 Kb] [download viewer]|
The article includes content from the AI Center pages below. Please note that the online pages may contain updated/revised versions, and probably do not cover the complete article: