Sciweavers

810 search results - page 46 / 162
» Solving Time-Dependent Planning Problems
Sort
View
AAAI
2006
13 years 9 months ago
Techniques for Generating Optimal, Robust Plans when Temporal Uncertainty is Present
Planning under uncertainty has been well studied, but usually the uncertainty is in action outcomes. This work instead investigates uncertainty in the amount of time that actions ...
Janae N. Foss
CCCG
1996
13 years 9 months ago
Heuristic Motion Planning with Many Degrees of Freedom
We present a heuristic approach to the geometric motion planning problem with the aim to quickly solve intuitively simple problems. It is based on a divide-and-conquer path search...
Thomas Chadzelek, Jens Eckstein, Elmar Schöme...
AAAI
1998
13 years 9 months ago
An Expert System for Alarm System Planning
This paper discusses the design and implementation of ESSPL, an expert system which generates security plans for alarm systems (Figure 1). Security planning is the task of determi...
Akira Tsurushima, Kenji Urushima, Daigo Sakata, Hi...
MICAI
2000
Springer
13 years 11 months ago
Searching for a Solution to Program Verification=Equation Solving in CCS
Unique Fixpoint Induction, UFI, is a chief inference rule to prove the equivalence of recursive processes in CCS [7]. It plays a major role in the equational approach to verificati...
Raul Monroy, Alan Bundy, Ian Green
IOR
2007
106views more  IOR 2007»
13 years 8 months ago
Planning and Scheduling by Logic-Based Benders Decomposition
We combine mixed integer linear programming (MILP) and constraint programming (CP) to solve an important class of planning and scheduling problems. Tasks are allocated to faciliti...
John N. Hooker