This thesis focuses on improving the process of automated planing through symmetry breaking. The aim is to describe symmetries, which are often observed by human programmers, but haven't been properly theoretically formalized. After an analysis of available research, there are new definitions of symmetries proposed in context of classical planning, such as state equivalence, T1 automorphisms and more general automorphisms of constants. Several theorems are proved about new symmetries. As a result, an algorithm for detecting a special symmetry class is proposed, together with a method of exploiting such class during planning. Experimens are made to show the effect of symmetry breaking on the performance of the planner. Powered by TCPDF (www.tcpdf.org)
| Identifer | oai:union.ndltd.org:nusl.cz/oai:invenio.nusl.cz:352437 |
| Date | January 2017 |
| Creators | Kuckir, Ivan |
| Contributors | Barták, Roman, Chrpa, Lukáš |
| Source Sets | Czech ETDs |
| Language | English |
| Detected Language | English |
| Type | info:eu-repo/semantics/masterThesis |
| Rights | info:eu-repo/semantics/restrictedAccess |
Page generated in 0.0014 seconds