Sciweavers

810 search results - page 21 / 162
» Solving Time-Dependent Planning Problems
Sort
View
CLIMA
2004
15 years 1 months ago
A New HTN Planning Framework for Agents in Dynamic Environments
In a dynamic environment, even if an agent makes a plan to obtain a goal, the environment might change while the agent is executing the plan. In that case, the plan, which was init...
Hisashi Hayashi, Kenta Cho, Akihiko Ohsuga
AIPS
2007
15 years 2 months ago
Planning with Respect to an Existing Schedule of Events
Decomposition has proved an effective strategy in planning, with one decomposition-based planner, SGPLAN, exhibiting strong performance in the last two IPCs. By decomposing planni...
Andrew Coles, Maria Fox, Derek Long, Amanda Smith
AIPS
1994
15 years 1 months ago
A Framework for Automatic Problem Decomposition in Planning
An intelligent problem solver must be able to decompose a complex problem into simpler parts. A decomposition algorithm would not only be bene cial for traditional subgoal-oriente...
Qiang Yang, Shuo Bai, Guiyou Qiu
CEC
2008
IEEE
15 years 6 months ago
EA-MP: An evolutionary algorithm for a mine planning problem
In this paper we introduce an evolutionary algorithm for solving a copper mine planning problem. In the last 10 years this realworld problem has been tackled using linear integer p...
María-Cristina Riff, Teddy Alfaro, Xavier B...
111
Voted
ECAI
2008
Springer
15 years 1 months ago
A Simulation-based Approach for Solving Generalized Semi-Markov Decision Processes
Time is a crucial variable in planning and often requires special attention since it introduces a specific structure along with additional complexity, especially in the case of dec...
Emmanuel Rachelson, Gauthier Quesnel, Fréd&...