Exploiting single-cycle symmetries in continuous constraint problems
Visualitza/Obre
Estadístiques de LA Referencia / Recolecta
Inclou dades d'ús des de 2022
Cita com:
hdl:2117/2698
Tipus de documentReport de recerca
Data publicació2007
Condicions d'accésAccés obert
Tots els drets reservats. Aquesta obra està protegida pels drets de propietat intel·lectual i
industrial corresponents. Sense perjudici de les exempcions legals existents, queda prohibida la seva
reproducció, distribució, comunicació pública o transformació sense l'autorització del titular dels drets
Abstract
Symmetries in discrete constraint satisfaction problems have been explored and exploited in the last years, but symmetries in continuous constraint problems have not received the same attention. Here 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 continuous constraint solver 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 analyze these classes and quantify them as a function of the cube dimensionality. 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.
CitacióRuiz de Angulo, Vicente; Torras, Carme. "Exploiting single-cycle symmetries in continuous constraint problems". Technical Report IRI-DT-07-02, Institut de Robòtica i Informàtica Industrial, CSIC-UPC, 2007.
Fitxers | Descripció | Mida | Format | Visualitza |
---|---|---|---|---|
doc1.pdf | 422,6Kb | Visualitza/Obre |