38 search results - page 3 / 8 » Effective Approaches for Partial Satisfaction (Over-Subscrip... |
SARA
2009
Springer
13 years 11 months ago
2009
Springer
Constraint Programming is an attractive approach for solving AI planning problems by modelling them as Constraint Satisfaction Problems (CSPs). However, formulating effective cons...
AAAI
2012
11 years 7 months ago
2012
Recent work on planning in incomplete domains focuses on constructing plans that succeed despite incomplete knowledge of action preconditions and effects. As planning models becom...
ICRA
2010
IEEE
13 years 3 months ago
2010
IEEE
Abstract— We propose a planning algorithm that allows usersupplied domain knowledge to be exploited in the synthesis of information feedback policies for systems modeled as parti...
FSR
2007
Springer
13 years 11 months ago
2007
Springer
Sampling in the space of controls or actions is a well-established method for ensuring feasible local motion plans. However, as mobile robots advance in performance and competence ...
LOGCOM
2011
12 years 8 months ago
2011
Planning as Satisfiability is one of the most well-known and effective techniques for classical planning: satplan has been the winning system in the deterministic track for optim...