Sciweavers

810 search results - page 30 / 162
» Solving Time-Dependent Planning Problems
Sort
View
ATAL
2010
Springer
13 years 9 months ago
Merging example plans into generalized plans for non-deterministic environments
We present a new approach for finding generalized contingent plans with loops and branches in situations where there is uncertainty in state properties and object quantities, but ...
Siddharth Srivastava, Neil Immerman, Shlomo Zilber...
IJCAI
1997
13 years 9 months ago
Scaling the Dynamic Approach to Autonomous Path Planning: Planning Horizon Dynamics
In the dynamical systems approach to robot path planning both sensed and remembered information contribute to shape a nonlinear vector eld that governs the behavior of an autonomo...
Edward W. Large, Henrik I. Christensen, Ruzena Baj...
AIPS
2006
13 years 9 months ago
Solving Factored MDPs with Exponential-Family Transition Models
Markov decision processes (MDPs) with discrete and continuous state and action components can be solved efficiently by hybrid approximate linear programming (HALP). The main idea ...
Branislav Kveton, Milos Hauskrecht
DATE
2003
IEEE
84views Hardware» more  DATE 2003»
14 years 1 months ago
Interconnect Planning with Local Area Constrained Retiming
We present a framework that considers global routing, repeater insertion, and flip-flop relocation for early interconnect planning. We formulate the interconnect retiming and ï¬...
Ruibing Lu, Cheng-Kok Koh
AIPS
1996
13 years 9 months ago
Planning for Manufacturing Workpieces by Storing, Indexing and Replaying Planning Decisions
Planning for manufacturing workpiecesis a complex task that requires the interaction of a domain-specific reasoner and a generic planning mechanism.In this paper wepresent an arch...
Hector Muñoz-Avila, Frank Weberskirch