Exploiting single-cycle symmetries in continuous constraint problems

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 tha...

Descripción completa

Detalles Bibliográficos
Autores: Ruiz de Angulo, Vicente, Torras, Carme
Tipo de recurso: otro
Fecha de publicación:2007
País:España
Institución:Consejo Superior de Investigaciones Científicas (CSIC)
Repositorio:DIGITAL.CSIC. Repositorio Institucional del CSIC
OAI Identifier:oai:digital.csic.es:10261/30075
Acceso en línea:http://hdl.handle.net/10261/30075
Access Level:acceso abierto
Palabra clave:Symmetries
Continuous constraint problems
Automation
id ES_7a07fce2482ede4a4e9a2f4342a6e7c4
oai_identifier_str oai:digital.csic.es:10261/30075
network_acronym_str ES
network_name_str España
repository_id_str
spelling Exploiting single-cycle symmetries in continuous constraint problemsRuiz de Angulo, VicenteTorras, CarmeSymmetriesContinuous constraint problemsAutomationSymmetries 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.CSIC-UPC - Instituto de Robótica e Informática Industrial (IRII)201020102007info:eu-repo/semantics/otherhttp://purl.org/coar/resource_type/c_18ghinfo:eu-repo/semantics/reporthttp://hdl.handle.net/10261/30075reponame:DIGITAL.CSIC. Repositorio Institucional del CSICinstname:Consejo Superior de Investigaciones Científicas (CSIC)Inglésinfo:eu-repo/semantics/openAccessoai:digital.csic.es:10261/300752026-05-22T06:33:51Z
dc.title.none.fl_str_mv Exploiting single-cycle symmetries in continuous constraint problems
title Exploiting single-cycle symmetries in continuous constraint problems
spellingShingle Exploiting single-cycle symmetries in continuous constraint problems
Ruiz de Angulo, Vicente
Symmetries
Continuous constraint problems
Automation
title_short Exploiting single-cycle symmetries in continuous constraint problems
title_full Exploiting single-cycle symmetries in continuous constraint problems
title_fullStr Exploiting single-cycle symmetries in continuous constraint problems
title_full_unstemmed Exploiting single-cycle symmetries in continuous constraint problems
title_sort Exploiting single-cycle symmetries in continuous constraint problems
dc.creator.none.fl_str_mv Ruiz de Angulo, Vicente
Torras, Carme
author Ruiz de Angulo, Vicente
author_facet Ruiz de Angulo, Vicente
Torras, Carme
author_role author
author2 Torras, Carme
author2_role author
dc.subject.none.fl_str_mv Symmetries
Continuous constraint problems
Automation
topic Symmetries
Continuous constraint problems
Automation
description 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.
publishDate 2007
dc.date.none.fl_str_mv 2007
2010
2010
dc.type.none.fl_str_mv info:eu-repo/semantics/other
http://purl.org/coar/resource_type/c_18gh
dc.type.openaire.fl_str_mv info:eu-repo/semantics/report
format other
dc.identifier.none.fl_str_mv http://hdl.handle.net/10261/30075
url http://hdl.handle.net/10261/30075
dc.language.none.fl_str_mv Inglés
language_invalid_str_mv Inglés
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
eu_rights_str_mv openAccess
dc.publisher.none.fl_str_mv CSIC-UPC - Instituto de Robótica e Informática Industrial (IRII)
publisher.none.fl_str_mv CSIC-UPC - Instituto de Robótica e Informática Industrial (IRII)
dc.source.none.fl_str_mv reponame:DIGITAL.CSIC. Repositorio Institucional del CSIC
instname:Consejo Superior de Investigaciones Científicas (CSIC)
instname_str Consejo Superior de Investigaciones Científicas (CSIC)
reponame_str DIGITAL.CSIC. Repositorio Institucional del CSIC
collection DIGITAL.CSIC. Repositorio Institucional del CSIC
repository.name.fl_str_mv
repository.mail.fl_str_mv
_version_ 1869411407300132864
score 15.81155

Similares en LA Referencia