Philip Hingston
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Philip Hingston has a total of 25 co-authors. Here are the top co-authors by number of shared publications:
- Chiou Peng Lam
Edith Cowan University
4 shared publications - Martin Masek
Edith Cowan University
3 shared publications - Andrew Pech
School of Computer and Security Science, Edith Cowan University, Perth, Australia
2 shared publications - Andrew Pech
Edith Cowan University
1 shared publication - Aravind Gowrisankar
Department of Computer Sciences, University of Texas, Austin, USA
1 shared publication - C.H. Tan
Department of Electrical and Computer Engineering, National University of Singapore, 4, Engineering Drive 3, Singapore 117576, Singapore
1 shared publication
Latest Publications
- 15 March 2016
- Published by Springer Nature
- p. 636-652
Using Isovists to Evolve Terrains with Gameplay Elements
- 15 March 2016
- Published by Springer Nature
- p. 636-652
Using Isovists to Evolve Terrains with Gameplay Elements
- 11 January 2016
- Published by Springer Nature in Cluster Computing
- Vol. 19 (1) , 79-86
Distributed denial-of-service attacks against HTTP/2 services
- 11 January 2016
- Published by Springer Nature in Cluster Computing
- Vol. 19 (1) , 79-86
Distributed denial-of-service attacks against HTTP/2 services
- 2 January 2016
- Published by Taylor & Francis in Connection Science
- Vol. 28 (1) , 63-82
Game level layout generation using evolved cellular automata
Design of level layouts typically involves the production of a set of levels which are different, yet display a consistent style based on the purpose of a particular level. In this paper, a new approach to the generation of unique level layouts, based on a target set of attributes, is presented. These attributes, which are learned automatically from an example layout, are used for the off-line evolution of a set of cellular automata rules. These rules can then be used for the real-time generation of level layouts that meet the target parameters. The approach is demonstrated on a set of maze-like level layouts. Results are presented to show the effect of various CA parameters and rule representation.
- 2 January 2016
- Published by Taylor & Francis in Connection Science
- Vol. 28 (1) , 63-82
Game level layout generation using evolved cellular automata
Design of level layouts typically involves the production of a set of levels which are different, yet display a consistent style based on the purpose of a particular level. In this paper, a new approach to the generation of unique level layouts, based on a target set of attributes, is presented. These attributes, which are learned automatically from an example layout, are used for the off-line evolution of a set of cellular automata rules. These rules can then be used for the real-time generation of level layouts that meet the target parameters. The approach is demonstrated on a set of maze-like level layouts. Results are presented to show the effect of various CA parameters and rule representation.
- 21 May 2014
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computational Intelligence and AI in Games
- Vol. 7 (1) , 53-65
Multiple Opponent Optimization of Prisoner’s Dilemma Playing Agents
Agents for playing iterated prisoner's dilemma are commonly trained using a coevolutionary system in which a player's score against a selection of other members of an evolving population forms the fitness function. In this study we examine instead a version of evolutionary iterated prisoner's dilemma in which an agent's fitness is measured as the average score it obtains against a fixed panel of opponents called an examination board. The performance of agents trained using examination boards is compared against agents trained in the usual coevolutionary fashion. This includes assessing the relative competitive ability of players evolved with evolution and coevolution. The difficulty of several experimental boards as optimization problems is compared. A number of new types of strategies are introduced. These include sugar strategies which can be exploited with some difficulty and treasure hunt strategies which have multiple trapping states with different levels of exploitability. The degree to which strategies trained with different examination boards produce different agents is investigated using fingerprints.
- 21 May 2014
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computational Intelligence and AI in Games
- Vol. 7 (1) , 53-65
Multiple Opponent Optimization of Prisoner’s Dilemma Playing Agents
Agents for playing iterated prisoner's dilemma are commonly trained using a coevolutionary system in which a player's score against a selection of other members of an evolving population forms the fitness function. In this study we examine instead a version of evolutionary iterated prisoner's dilemma in which an agent's fitness is measured as the average score it obtains against a fixed panel of opponents called an examination board. The performance of agents trained using examination boards is compared against agents trained in the usual coevolutionary fashion. This includes assessing the relative competitive ability of players evolved with evolution and coevolution. The difficulty of several experimental boards as optimization problems is compared. A number of new types of strategies are introduced. These include sugar strategies which can be exploited with some difficulty and treasure hunt strategies which have multiple trapping states with different levels of exploitability. The degree to which strategies trained with different examination boards produce different agents is investigated using fingerprints.
- 4 August 2009
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Computational Intelligence Magazine
- Vol. 4 (3) , 8-9
2008 IEEE Symposium on Computational Intelligence and Games (CIG 2008) [conference report]
- 4 August 2009
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Computational Intelligence Magazine
- Vol. 4 (3) , 8-9
2008 IEEE Symposium on Computational Intelligence and Games (CIG 2008) [conference report]
- 9 July 2008
- Published by Springer Nature in Genetic Programming and Evolvable Machines
- Vol. 9 (4) , 295-329
The 2007 IEEE CEC simulated car racing competition
- 9 July 2008
- Published by Springer Nature in Genetic Programming and Evolvable Machines
- Vol. 9 (4) , 295-329
The 2007 IEEE CEC simulated car racing competition
- 1 April 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 9, 382-389
Use of the WFG Toolkit and PISA for Comparison of MOEAs
Understanding the behaviour of different optimisation algorithms is important in order to apply the best algorithm to a particular problem. The WFG toolkit was designed to aid this task for multi-objective evolutionary algorithms (MOEAs), offering an easily modifiable framework that allows practitioners the ability to test different features by "plugging" in different forms of transformations. In doing so, the WFG toolkit provides a set of problems that exhibit a variety of different characteristics. This paper presents a comparison between two state of the art MOEAs (NSGA-II and SPEA2) that exemplifies the unique capabilities of the WFG toolkit. By altering the control parameters or even the transformations that compose the WFG problems, we are able to explore the different types of problems where SPEA2 and NSGA-II each excel. Our results show that the performance of the two algorithms differ not only on the dimensionality of the problem, but also by properties such as the shape and size of the underlying Pareto surface. As such, the tunability of the WFG toolkit is key in allowing the easy exploration of these different features.
- 1 April 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 9, 382-389
Use of the WFG Toolkit and PISA for Comparison of MOEAs
Understanding the behaviour of different optimisation algorithms is important in order to apply the best algorithm to a particular problem. The WFG toolkit was designed to aid this task for multi-objective evolutionary algorithms (MOEAs), offering an easily modifiable framework that allows practitioners the ability to test different features by "plugging" in different forms of transformations. In doing so, the WFG toolkit provides a set of problems that exhibit a variety of different characteristics. This paper presents a comparison between two state of the art MOEAs (NSGA-II and SPEA2) that exemplifies the unique capabilities of the WFG toolkit. By altering the control parameters or even the transformations that compose the WFG problems, we are able to explore the different types of problems where SPEA2 and NSGA-II each excel. Our results show that the performance of the two algorithms differ not only on the dimensionality of the problem, but also by properties such as the shape and size of the underlying Pareto surface. As such, the tunability of the WFG toolkit is key in allowing the easy exploration of these different features.
- 1 January 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 23254270,p. 168-174
Evolving Players for an Ancient Game: Hnefatafl
Hnefatafl is an ancient Norse game - an ancestor of chess. In this paper, we report on the development of computer players for this game. In the spirit of Blondie24, we evolve neural networks as board evaluation functions for different versions of the game. An unusual aspect of this game is that there is no general agreement on the rules: it is no longer much played, and game historians attempt to infer the rules from scraps of historical texts, with ambiguities often resolved on gut feeling as to what the rules must have been in order to achieve a balanced game. We offer the evolutionary method as a means by which to judge the merits of alternative rule sets
- 1 January 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 23254270,p. 168-174
Evolving Players for an Ancient Game: Hnefatafl
Hnefatafl is an ancient Norse game - an ancestor of chess. In this paper, we report on the development of computer players for this game. In the spirit of Blondie24, we evolve neural networks as board evaluation functions for different versions of the game. An unusual aspect of this game is that there is no general agreement on the rules: it is no longer much played, and game historians attempt to infer the rules from scraps of historical texts, with ambiguities often resolved on gut feeling as to what the rules must have been in order to achieve a balanced game. We offer the evolutionary method as a means by which to judge the merits of alternative rule sets