Exploiting single-cycle symmetries in branch-and-prune algorithms
Document typeConference report
Rights accessOpen Access
All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder
ProjectANALISIS Y PLANIFICACION DEL MOVIMIENTO EN SISTEMAS ROBOTIZADOS COMPLEJOS (MEC-DPI2007-60858)
As a first attempt to exploit symmetries in continuous constraint problems, we focus on permutations of the variables consisting of one single cycle. We propose a procedure that takes advantage of these symmetries by interacting with a Branch-and-Prune algorithm without interfering with it. A key concept in this procedure are the classes of symmetric boxes formed by bisecting a n-dimensional cube at the same point in all dimensions at the same time. We quantify these classes as a function of n. Moreover, we propose a simple algorithm to generate the representatives of all these classes for any number of variables at very high rates. A problem example from the chemical field and a kinematics solver are used to show the performance of the approach in practice.
The final publication is available at link.springer.com
CitationRuiz De Angulo, V.; Torras, C. Exploiting single-cycle symmetries in branch-and-prune algorithms. A: International Conference on Principles and Practice of Constraint Programming. "Proceedings of the 13th International Conference on Principles and Practice of Constraint Programming". 2007, p. 864-871.