Loading...

Using Satisfiability in Solving Planning Problems having Numerical Values

Ellahi, Mojtaba | 2014

337 Viewed
  1. Type of Document: M.Sc. Thesis
  2. Language: Farsi
  3. Document No: 46103 (19)
  4. University: Sharif University of Technology
  5. Department: Computer Engineering
  6. Advisor(s): Ghasem Sani, Gholamreza
  7. Abstract:
  8. Considering numerical values is an important step toward real world problems in planning. Although planning community has been aware of this fact since many years ago, but the complication involved in reasoning with numerical values made this challenge too difficult, thus very little and occasional research has been done on this issue.This dissertation is an effort to find an efficient method for solving numerical planning problems; in this regard, we use the “planning as satisfiability” approach. Planning as satisfiability is one of the most important and successful approaches for solving planning problems. Furthermore, developing SAT solvers with the capability of considering numerical constraints has motivated us for using this approach.In this dissertation two methods are introduced and examined. The first method, which we called PartialActionSMT, solves numerical planning problems by usingSMT solver. This method tries to break up actions and use their common properties to alleviate the problem caused by using SMT solver. Second method usesa usual SAT solver. For considering numerical values in this method, we have devised a novel encoding to translate the numerical planning problems to satisfiability problems. The experimental results show a significant improvement of the proposed methods over the current state of the art method
  9. Keywords:
  10. Satisfiability ; Satisfiability-based Planning ; Artificial Intelligence Planning ; Numerical Planning

 Digital Object List

 Bookmark