A geometric constraint over k-dimensional objects and shapes subject to business rules
Number of Authors: 4
2008 (English)In: Proc. CP'2008, Springer-Verlag , 2008, 2, Vol. 5202, 15 p.220-234 p.Conference paper (Refereed)
This report presents a global constraint that enforces rules written in a language based on arithmetic and first-order logic to hold among a set of objects. In a first step, the rules are rewritten to Quantifier-Free Presburger Arithmetic (QFPA) formulas. Secondly, such formulas are compiled to generators of k-dimensional forbidden sets. Such generators are a generalization of the indexicals of cc(FD). Finally, the forbidden sets generated by such indexicals are aggregated by a sweep-based algorithm and used for filtering. The business rules allow to express a great variety of packing and placement constraints, while admitting efficient and effective filtering of the domain variables of the k-dimensional object, without the need to use spatial data structures. The constraint was used to directly encode the packing knowledge of a major car manufacturer and tested on a set of real packing problems under these rules, as well as on a packing-unpacking problem.
Place, publisher, year, edition, pages
Springer-Verlag , 2008, 2. Vol. 5202, 15 p.220-234 p.
Computer and Information Science
IdentifiersURN: urn:nbn:se:ri:diva-22922DOI: 10.1007/978-3-540-85958-1_15OAI: oai:DiVA.org:ri-22922DiVA: diva2:1042487
CP 2008: 14th International Conference on Principles and Practice of Constraint Programming
Published in Lecture Notes in Computer Science; Volume 52022016-10-312016-10-31Bibliographically approved