Sciweavers

15 search results - page 2 / 3
» In Search of the Tractability Boundary of Planning Problems
Sort
View
AIPS
1994
13 years 7 months ago
Design Tradeoffs in Partial Order (Plan space) Planning
Despite the long history of classical planning, there has been very little comparative analysis of the performance tradeoffs offered by the multitude of existing planning algorith...
Subbarao Kambhampati
KES
2006
Springer
13 years 5 months ago
A computational framework for package planning
We consider a novel class of applications where a set of activities conducted by a group of people over a time period needs to be planned, taking into account each member's p...
Yang Xiang, Michael Janzen
GECCO
2003
Springer
114views Optimization» more  GECCO 2003»
13 years 10 months ago
Genetic Algorithm for Supply Planning Optimization under Uncertain Demand
Supply planning optimization is one of the most important issues for manufacturers and distributors. Supply is planned to meet the future demand. Under the uncertainty involved in ...
Masaru Tezuka, Masahiro Hiji
DARS
2000
Springer
128views Robotics» more  DARS 2000»
13 years 10 months ago
Motion Planning for a Modular Self-Reconfiguring Robotic System
In this paper, we address the issue of motion planning for a bipartite class of modular self-reconfiguring robotic system (I-Cubes) that is a collection of active elements providin...
Cem Ünsal, Han Kiliççöte, ...
JAIR
2006
157views more  JAIR 2006»
13 years 5 months ago
Decision-Theoretic Planning with non-Markovian Rewards
A decision process in which rewards depend on history rather than merely on the current state is called a decision process with non-Markovian rewards (NMRDP). In decisiontheoretic...
Sylvie Thiébaux, Charles Gretton, John K. S...