Partitioning of Temporal Planning Problems in Mixed Space using the Theory of Extended Saddle Points

  • Benjamin W. Wah
  • , Yixin Chen

Research output: Contribution to journalConference articlepeer-review

Abstract

We study the partitioning of temporal planning problems formulated as mixed-integer nonlinear programming problems, develop methods to reduce the search space of partitioned subproblems, and propose algorithms for resolving unsatisfied global constraints. The algorithms are based on the necessary and sufficient extended saddle-point condition for constrained local minimization developed in this paper. When compared with the MIPS planner in solving some PDDL2.1 planning problems, our distributed implementation of MIPS shows significant improvements in time and quality.

Original languageEnglish
Pages (from-to)266-273
Number of pages8
JournalProceedings of the International Conference on Tools with Artificial Intelligence
StatePublished - 2003
EventProceedings: 15th IEEE International Conference on Tools with artificial Intelligence - Sacramento, CA, United States
Duration: Nov 3 2003Nov 5 2003

Fingerprint

Dive into the research topics of 'Partitioning of Temporal Planning Problems in Mixed Space using the Theory of Extended Saddle Points'. Together they form a unique fingerprint.

Cite this