Mostrar el registro sencillo del ítem
Sequentially dependent meta-constraint satisfaction problem: An application to video games
dc.contributor.author | Soto R. | |
dc.contributor.author | Crawford B. | |
dc.contributor.author | Monfroy E. | |
dc.contributor.author | Paredes F. | |
dc.date.accessioned | 2020-09-02T22:28:42Z | |
dc.date.available | 2020-09-02T22:28:42Z | |
dc.date.issued | 2014 | |
dc.identifier.citation | 17, 2, 204-216 | |
dc.identifier.issn | 14538245 | |
dc.identifier.uri | https://hdl.handle.net/20.500.12728/6313 | |
dc.description | A Constraint Satisfaction Problem (CSP) consists in a sequence of variables holding a domain of possible values and relations among these variables called constraints. A meta-CSP can be seen as a metaproblem whose decomposition leads to a set of CSPs. The meta-variables correspond to sub-problems of the original problem, and a meta-constraint is a relation among those meta-variables. Meta-CSPs find many applications in industry, usually in processes that involve time and actions such as the control of a robot, a manufacturing process, or the scheduling of any common activity. In this paper, we introduce the notion of Sequentially Dependent Meta-CSP (SD Meta-CSP), which extends the meta-CSP in order to support applications where a dependency between sub-problems is mandatory. In this case, the meta-CSP is decomposed into a set of sub-problems {Pi, Pi+1, . . . , Pn}, but the instance of the sub-problem Pi+1 sequentially depends on the solution of the sub-problem Pi . In this work we provide a formal definition for the SD Meta-CSPs, a framework to handle it, and we illustrate its applicability to video games. In particular, we model and implement agents as SD Meta-CSPs able to autonomously play two classic games: Ms. Pac-Man and Super Mario Bros. | |
dc.language.iso | en | |
dc.publisher | Editura Academiei Romane | |
dc.subject | Artificial intelligence | |
dc.subject | Constraint satisfaction problem | |
dc.subject | Video-games | |
dc.title | Sequentially dependent meta-constraint satisfaction problem: An application to video games | |
dc.type | Article |