Constraint partitioning in penalty formulations for solving temporal planning problems

  title={Constraint partitioning in penalty formulations for solving temporal planning problems},
  author={Benjamin W. Wah and Yixin Chen},
  journal={Artif. Intell.},
In this paper, we study the partitioning of constraints in temporal planning problems formulated as mixed-integer nonlinear programming (MINLP) problems. Constraint partitioning is attractive because it leads to much easier subproblems, where each is a significant relaxation of the original problem. Moreover, each subproblem is very similar to the original problem and can be solved by any existing solver with little or no modification. Constraint partitioning, however, introduces global… CONTINUE READING
Highly Cited
This paper has 56 citations. REVIEW CITATIONS


Publications citing this paper.

56 Citations

Citations per Year
Semantic Scholar estimates that this publication has 56 citations based on the available data.

See our FAQ for additional information.


Publications referenced by this paper.
Showing 1-10 of 53 references

ASPEN—Automating space mission operations using automated planning and scheduling

  • S. Chien
  • in: Proc. SpaceOps, Space Operations Organization…
  • 2000
Highly Influential
7 Excerpts

Applied Dynamic Programming

  • R. Bellman, S. Dreyfus
  • Princeton Univ. Press, Princeton, NJ, 1962. 230…
  • 2006
1 Excerpt

UCPOP: A sound

  • J. Penberethy, D. Weld
  • complete, partial order planner for ADL, in: Proc…
  • 2006
1 Excerpt

Similar Papers

Loading similar papers…