Sciweavers

13 search results - page 2 / 3
» On Reformulating Planning as Dynamic Constraint Satisfaction
Sort
View
HYBRID
1997
Springer
13 years 9 months ago
On-Line, Reflexive Constraint Satisfaction for Hybrid Systems: First Steps
Abstract. We can achieve guaranteed constraint satisfaction of a hybrid dynamical system (which takes into account the underlying continuous dynamics) in a simple, hierarchical con...
Michael S. Branicky
JAIR
2000
94views more  JAIR 2000»
13 years 5 months ago
Planning Graph as a (Dynamic) CSP: Exploiting EBL, DDB and other CSP Search Techniques in Graphplan
This paper reviews the connections between Graphplan's planning-graph and the dynamic constraint satisfaction problem and motivates the need for adapting CSP search technique...
Subbarao Kambhampati
KBS
2007
75views more  KBS 2007»
13 years 5 months ago
Managing restaurant tables using constraints
Restaurant table management can have significant impact on both profitability and the customer experience. The core of the issue is a complex dynamic combinatorial problem. We sho...
Alfio Vidotto, Kenneth N. Brown, J. Christopher Be...
AIPS
2008
13 years 8 months ago
Fast Dynamic Scheduling of Disjunctive Temporal Constraint Networks through Incremental Compilation
Autonomous systems operating in real-world environments must plan, schedule, and execute missions while robustly adapting to uncertainty and disturbance. One way to mitigate the e...
Julie A. Shah, Brian C. Williams
AAAI
2006
13 years 7 months ago
Extending Dynamic Backtracking to Solve Weighted Conditional CSPs
Many planning and design problems can be characterized as optimal search over a constrained network of conditional choices with preferences. To draw upon the advanced methods of c...
Robert T. Effinger, Brian C. Williams