The Non-overlapping Constraint between Objects Described by Non-linear Inequalities

  • Ignacio Salas
  • Gilles Chabert
  • Alexandre Goldsztejn
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8656)

Abstract

Packing 2D objects in a limited space is an ubiquitous problem with many academic and industrial variants. In any case, solving this problem requires the ability to determine where a first object can be placed so that it does not intersect a second, previously placed, object. This subproblem is called the non-overlapping constraint. The complexity of this non-overlapping constraint depends on the type of objects considered. It is simple in the case of rectangles. It has also been studied in the case of polygons. This paper proposes a numerical approach for the wide class of objects described by non-linear inequalities. Our goal here is to calculate the non-overlapping constraint, that is, to describe the set of all positions and orientations that can be assigned to the first object so that intersection with the second one is empty. This is done using a dedicated branch & prune approach. We first show that the non-overlapping constraint can be cast into a Minkowski sum, even if we take into account orientation. We derive from this an inner contractor, that is, an operator that removes from the current domain a subset of positions and orientations that necessarily violate the non-overlapping constraint. This inner contractor is then embedded in a sweeping loop, a pruning technique that was only used with discrete domains so far. We finally come up with a branch & prune algorithm that outperforms Rsolver, a generic state-of-the-art solver for continuous quantified constraints.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [ATNC14]
    Araya, I., Trombettoni, G., Neveu, B., Chabert, G.: Upper Bounding in Inner Regions for Global Optimization under Inequality Constraints. In: Journal of Global Optimization (to appear, 2014)Google Scholar
  2. [BG06]
    Benhamou, F., Granvilliers, L.: Continuous and interval constraints. In: Handbook of Constraint Programming, ch. 16, pp. 571–604. Elsevier (2006)Google Scholar
  3. [BGT01]
    Beldiceanu, N., Guo, Q., Thiel, S.: Non-Overlapping Constraints between Convex Polytopes. In: Walsh, T. (ed.) CP 2001. LNCS, vol. 2239, pp. 392–407. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  4. [CB10]
    Chabert, G., Beldiceanu, N.: Sweeping with Continous Domains. In: Cohen, D. (ed.) CP 2010. LNCS, vol. 6308, pp. 137–151. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  5. [CJ09]
    Chabert, G., Jaulin, L.: Contractor Programming. Artificial Intelligence 173(11), 1079–1100 (2009)CrossRefMATHMathSciNetGoogle Scholar
  6. [GJ06]
    Goldsztejn, A., Jaulin, L.: Inner and Outer Approximations of Existentially Quantified Equality Constraints. In: Benhamou, F. (ed.) CP 2006. LNCS, vol. 4204, pp. 198–212. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  7. [IGJ12]
    Ishii, D., Goldsztejn, A., Jermann, C.: Interval-Based Projection Method for Under-Constrained Numerical Systems. Constraints 17(4), 432–460 (2012)CrossRefMathSciNetGoogle Scholar
  8. [JKDW01]
    Jaulin, L., Kieffer, M., Didrit, O., Walter, E.: Applied Interval Analysis. Springer (2001)Google Scholar
  9. [JW93]
    Jaulin, L., Walter, E.: Set Inversion via Interval Analysis for Nonlinear Bounded-Error Estimation. Automatica 29(4), 1053–1064 (1993)CrossRefMATHMathSciNetGoogle Scholar
  10. [Rat]
    Ratschan, S.: RSolverGoogle Scholar
  11. [Rat06]
    Ratschan, S.: Efficient Solving of Quantified Inequality Constraints over the Real Numbers. ACM Transactions on Computational Logic 7(4), 723–748 (2006)CrossRefMathSciNetGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  • Ignacio Salas
    • 1
  • Gilles Chabert
    • 1
  • Alexandre Goldsztejn
    • 2
  1. 1.Mines de Nantes, LINA UMR 6241France
  2. 2.CNRS, LINA UMR 6241France

Personalised recommendations