Sweeping with Continuous Domains.

Gilles Chabert 1 Nicolas Beldiceanu 1
1 TASC - Theory, Algorithms and Systems for Constraints
LINA - Laboratoire d'Informatique de Nantes Atlantique, Département informatique - EMN, Inria Rennes – Bretagne Atlantique
Abstract : The geost constraint has been proposed to model and solve discrete placement problems involving multi-dimensional boxes (packing in space and time). The filtering technique is based on a sweeping algorithm that requires the ability for each constraint to compute a forbidden box around a given fixed point and within a surrounding area. Several cases have been studied so far, including integer linear inequalities. Motivated by the placement of objects with curved shapes, this paper shows how to implement this service for continuous constraints with arbitrary mathematical expressions. The approach relies on symbolic processing and defines a new interval arithmetic.
Complete list of metadatas

https://hal.inria.fr/hal-00915701
Contributor : Contraintes Lina <>
Submitted on : Monday, December 9, 2013 - 11:40:46 AM
Last modification on : Friday, June 22, 2018 - 9:28:42 AM

Links full text

Identifiers

Citation

Gilles Chabert, Nicolas Beldiceanu. Sweeping with Continuous Domains.. Principles and Practice of Constraint Programming - CP 2010, Oct 2010, St. Andrews, United Kingdom. pp.137-151, ⟨10.1007/978-3-642-15396-9_14⟩. ⟨hal-00915701⟩

Share

Metrics

Record views

292