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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
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)
Benhamou, F., Granvilliers, L.: Continuous and interval constraints. In: Handbook of Constraint Programming, ch. 16, pp. 571–604. Elsevier (2006)
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)
Chabert, G., Beldiceanu, N.: Sweeping with Continous Domains. In: Cohen, D. (ed.) CP 2010. LNCS, vol. 6308, pp. 137–151. Springer, Heidelberg (2010)
Chabert, G., Jaulin, L.: Contractor Programming. Artificial Intelligence 173(11), 1079–1100 (2009)
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)
Ishii, D., Goldsztejn, A., Jermann, C.: Interval-Based Projection Method for Under-Constrained Numerical Systems. Constraints 17(4), 432–460 (2012)
Jaulin, L., Kieffer, M., Didrit, O., Walter, E.: Applied Interval Analysis. Springer (2001)
Jaulin, L., Walter, E.: Set Inversion via Interval Analysis for Nonlinear Bounded-Error Estimation. Automatica 29(4), 1053–1064 (1993)
Ratschan, S.: RSolver
Ratschan, S.: Efficient Solving of Quantified Inequality Constraints over the Real Numbers. ACM Transactions on Computational Logic 7(4), 723–748 (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Salas, I., Chabert, G., Goldsztejn, A. (2014). The Non-overlapping Constraint between Objects Described by Non-linear Inequalities. In: O’Sullivan, B. (eds) Principles and Practice of Constraint Programming. CP 2014. Lecture Notes in Computer Science, vol 8656. Springer, Cham. https://doi.org/10.1007/978-3-319-10428-7_49
Download citation
DOI: https://doi.org/10.1007/978-3-319-10428-7_49
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-10427-0
Online ISBN: 978-3-319-10428-7
eBook Packages: Computer ScienceComputer Science (R0)