University of Limerick Institutional Repository

Context sensitive grammatical evolution: a novel attribute grammar based approach to the integration of semantics in grammatical evolution

DSpace Repository

Show simple item record

dc.contributor.advisor Ryan, Conor
dc.contributor.author Patten, James Vincent
dc.date.accessioned 2020-10-07T14:21:41Z
dc.date.available 2020-10-07T14:21:41Z
dc.date.issued 2020
dc.identifier.uri http://hdl.handle.net/10344/9305
dc.description peer-reviewed en_US
dc.description.abstract The merit of Evolutionary Algorithms (EAs) as a means of automatic problem solving has been demonstrated numerous times on a diverse set of problem types across a range of different domains. The central hypothesis of this thesis is that by improving the expressiveness of EAs we can better support their deployment in domains in which context sensitive decision making is useful. After describing the principal structures and operations which allow EAs operate effectively as a general problem solving technique, we describe a sample problem and outline how two EA types, Genetic Programming (GP) and Grammatical Evolution (GE), might be configured to solve it. After some foundational elements of the discipline game design are presented, we highlight how a move towards more formal specifications of design elements presents new opportunities for the deployment of EAs as a means of Procedural Content Generation (PCG). Subsequently a set of experiments are described in which a system, designed to support encoding of data type information using a variant of GP called Strongly Typed Genetic Programming (STGP), is used to generate Player Character (PC) controllers for the digital video game Ms. Pac-Man. Following this an overview of Formal Grammars (FGs) is presented and the principal structures and operations of a third EA type, GE, are described. After which a number of more expressive FGs than Context Free Grammar (CFG), the grammar traditionally used with GE, are outlined. Finally, we outline a new GE variant designed to support usage Attribute Grammars (AGs), a means of specifying solution semantics in addition to syntax, and outline a set of experiments conducted using it. After highlighting the gains that can be made by using this GE variant in traditional problem domains such as symbolic regression, we discuss its potential as a means of PCG in digital video games. as a means of automatic problem solving has been demonstrated numerous times on a diverse set of problem types across a range of different domains. The central hypothesis of this thesis is that by improving the expressiveness of EAs we can better support their deployment in domains in which context sensitive decision making is useful. After describing the principal structures and operations which allow EAs operate effectively as a general problem solving technique, we describe a sample problem and outline how two EA types, Genetic Programming (GP) and Grammatical Evolution (GE), might be configured to solve it. After some foundational elements of the discipline game design are presented, we highlight how a move towards more formal specifications of design elements presents new opportunities for the deployment of EAs as a means of Procedural Content Generation (PCG). Subsequently a set of experiments are described in which a system, designed to support encoding of data type information using a variant of GP called Strongly Typed Genetic Programming (STGP), is used to generate Player Character (PC) controllers for the digital video game Ms. Pac-Man. Following this an overview of Formal Grammars (FGs) is presented and the principal structures and operations of a third EA type, GE, are described. After which a number of more expressive FGs than Context Free Grammar (CFG), the grammar traditionally used with GE, are outlined. Finally, we outline a new GE variant designed to support usage Attribute Grammars (AGs), a means of specifying solution semantics in addition to syntax, and outline a set of experiments conducted using it. After highlighting the gains that can be made by using this GE variant in traditional problem domains such as symbolic regression, we discuss its potential as a means of PCG in digital video games. en_US
dc.language.iso eng en_US
dc.publisher University of Limerick en_US
dc.subject Evolutionary Algorithms (EAs) en_US
dc.subject problem solving en_US
dc.subject video games en_US
dc.title Context sensitive grammatical evolution: a novel attribute grammar based approach to the integration of semantics in grammatical evolution en_US
dc.type info:eu-repo/semantics/doctoralThesis en_US
dc.type.supercollection all_ul_research en_US
dc.type.supercollection ul_published_reviewed en_US
dc.type.supercollection ul_theses_dissertations en_US
dc.rights.accessrights info:eu-repo/semantics/openAccess en_US


Files in this item

This item appears in the following Collection(s)

Show simple item record

Search ULIR


Browse

My Account

Statistics