Sökning: onr:"swepub:oai:DiVA.org:liu-198769" >
PARIS: Planning Alg...
PARIS: Planning Algorithms for Reconfiguring Independent Sets
-
- Christen, Remo (författare)
- University of Basel
-
- Eriksson, Salomé (författare)
- University of Basel
-
- Katz, Michael (författare)
- IBM T.J. Watson Research Center
-
visa fler...
-
- Muise, Christian (författare)
- Queen’s University
-
- Petrov, Alice (författare)
- Queen’s University
-
- Pommerening, Florian (författare)
- University of Basel
-
- Seipp, Jendrik (författare)
- Linköpings universitet,Artificiell intelligens och integrerade datorsystem,Tekniska fakulteten
-
- Sievers, Silvan (författare)
- University of Basel
-
- Speck, David, 1992- (författare)
- Linköpings universitet,Artificiell intelligens och integrerade datorsystem,Tekniska fakulteten
-
visa färre...
-
University of Basel IBM TJ. Watson Research Center (creator_code:org_t)
- 2023
- 2023
- Engelska.
-
Ingår i: Proceedings of the 26th European Conference on Artificial Intelligence (ECAI 2023). ; , s. 453-460
- Relaterad länk:
-
https://ebooks.iospr...
-
visa fler...
-
https://urn.kb.se/re...
-
https://doi.org/10.3...
-
visa färre...
Abstract
Ämnesord
Stäng
- Combinatorial reconfiguration is the problem of transforming one solution of a combinatorial problem into another, where each transformation may only apply small changes to a solution and may not leave the solution space. An important example is the independent set reconfiguration (ISR) problem, where an independent set of a graph (a subset of its vertices without edges between them) has to be transformed into another by a sequence of transformations that can replace a vertex in the current subset such that the new subset is still an independent set. The 1st Combinatorial Reconfiguration Challenge (CoRe Challenge 2022) was a competition focused on the ISR problem. The PARIS team successfully participated with two solvers that model the ISR problem as a planning task and employ different planning techniques for solving it. In this work, we describe these models and solvers. For a fair comparison to competing ISR approaches, we re-run the entire competition under equal computational conditions. Besides showcasing the success of planning technology, we hope that this work will create a cross-fertilization of the two research fields.
Ämnesord
- NATURVETENSKAP -- Data- och informationsvetenskap -- Datavetenskap (hsv//swe)
- NATURAL SCIENCES -- Computer and Information Sciences -- Computer Sciences (hsv//eng)
Nyckelord
- Classical planning
- Automated planning
- Artificial Intelligence
- Combinatorial reconfiguration
- WASP
Publikations- och innehållstyp
- ref (ämneskategori)
- kon (ämneskategori)
- Av författaren/redakt...
-
Christen, Remo
-
Eriksson, Salomé
-
Katz, Michael
-
Muise, Christian
-
Petrov, Alice
-
Pommerening, Flo ...
-
visa fler...
-
Seipp, Jendrik
-
Sievers, Silvan
-
Speck, David, 19 ...
-
visa färre...
- Om ämnet
-
- NATURVETENSKAP
-
NATURVETENSKAP
-
och Data och informa ...
-
och Datavetenskap
- Artiklar i publikationen
- Proceedings of t ...
- Av lärosätet
-
Linköpings universitet