Sciweavers

810 search results - page 4 / 162
» Solving Time-Dependent Planning Problems
Sort
View
AIPS
1998
13 years 9 months ago
How to Solve It Automatically: Selection Among Problem Solving Methods
The choice of an appropriate problem-solving method, from available methods, is a crucial skill for experts in many areas. We describe a technique for the automatic selection amon...
Eugene Fink
IJCAI
2007
13 years 9 months ago
Constraint Partitioning for Solving Planning Problems with Trajectory Constraints and Goal Preferences
The PDDL3 specifications include soft goals and trajectory constraints for distinguishing highquality plans among the many feasible plans in a solution space. To reduce the compl...
Chih-Wei Hsu, Benjamin W. Wah, Ruoyun Huang, Yixin...
CP
2005
Springer
14 years 1 months ago
Solving Simple Planning Problems with More Inference and No Search
Many problems used in AI planning including Blocks, Logistics, Gripper, Satellite, and others lack the interactions that characterize puzzles and can be solved nonoptimally in low...
Vincent Vidal, Hector Geffner
WSC
2008
13 years 10 months ago
Solving volume and capacity planning problems in semiconductor manufaturing: A computational study
In this paper, we suggest a linear programming formulation that allows for solving volume and capacity planning problems in semiconductor manufacturing systems. We assume a genera...
Christoph Habla, Lars Mönch
IDA
2005
Springer
14 years 1 months ago
Miner Ants Colony: A New Approach to Solve a Mine Planning Problem
In this paper we introduce a simple ant based algorithm for solving a copper mine planning problem. In the last 10 years this realworld problem has been tackled using linear intege...
María-Cristina Riff, Michael Moossen, Xavie...