Simon Mark Lucas

Simon Mark Lucas

Auto-generated profile, based on publicly available information

Simon Mark Lucas

School of Electronic Engineering and Computer Science, Queen Mary University of London, London, U.K.

Research Focus & Metrics

Academic Career Length

37Years (1990-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 March 2012 in IEEE Transactions on Computational Intelligence and AI in Games
Verified
Journal Article
Closed access
CBCameron Browne
Cameron Browne
EPEdward Powley
Edward Powley
DWDaniel Whitehouse
Daniel Whitehouse
SLSimon M. Lucas
Simon M. Lucas
PCPeter I. Cowling
Peter I. Cowling
SCSimon Colton
Simon Colton
Monte Carlo tree search (MCTS) is a recently proposed search method that combines the precision of tree search with the generality of random sampling. It has received considerable interest due to its spectacular success in the difficult problem of computer Go, but has also proved beneficial in a range of other domains. This paper is a survey of the literature to date, intended to provide a snapshot of the state of the art after the first five years of MCTS research. We outline the core algorithm's derivation, impart some structure on the many variations and enhancements that have been proposed, and summarize the results from the key game and nongame domains to which MCTS methods have been applied. A number of open research questions indicate that the field is ripe for future work.

12 April 2005
Verified
Conference Paper
Closed access
SLS.M. Lucas
S.M. Lucas
APA. Panaretos
A. Panaretos
LSL. Sosa
L. Sosa
ATA. Tang
A. Tang
SWS. Wong
S. Wong
RYR. Young
R. Young

1 July 2005 in International Journal on Document Analysis and Recognition (IJDAR)
Verified
Journal Article
Closed access
PDF file
SLSimon M. Lucas
Simon M. Lucas
APAlex Panaretos
Alex Panaretos
LSLuis Sosa
Luis Sosa
ATAnthony Tang
Anthony Tang
SWShirley Wong
Shirley Wong
XLXiaofan Lin
Xiaofan Lin

1 January 2005
Verified
Conference Paper
Closed access
SLS.M. Lucas
S.M. Lucas
This paper describes the results of the ICDAR 2005 competition for locating text in camera captured scenes. For this we used the same data as the ICDAR 2003 competition, which has been kept private until now. This allows a direct comparison with the 2003 entries. The main result is that the leading 2005 entry has improved significantly on the leading 2003 entry, with an increase in average f-score from 0.5 to 0.62, where the f-score is the same adapted information retrieval measure used for the 2003 competition. The paper also discusses the Web-based deployment and evaluation of text locating systems, and one of the leading entries has now been deployed in this way. This mode of usage could lead to more complete and more immediate knowledge of the strengths and weaknesses of each newly developed system.

1 January 2007
Verified
Conference Paper
Closed access
JTJulian Togelius
Julian Togelius
RNRenzo De Nardi
Renzo De Nardi
SLSimon M. Lucas
Simon M. Lucas
Evolutionary algorithms are commonly used to create high-performing strategies or agents for computer games. In this paper, we instead choose to evolve the racing tracks in a car racing game. An evolvable track representation is devised, and a multiobjective evolutionary algorithm maximises the entertainment value of the track relative to a particular human player. This requires a way to create accurate models of players' driving styles, as well as a tentative definition of when a racing track is fun, both of which are provided. We believe this approach opens up interesting new research questions and is potentially applicable to commercial racing games.

11 March 2019 in IEEE Transactions on Games
Verified
Journal Article
Closed access
DPDiego Perez-Liebana
Diego Perez-Liebana
JLJialin Liu
Jialin Liu
AKAhmed Abdel Samea Khalifa
Ahmed Abdel Samea Khalifa
RGRaluca D. Gaina
Raluca D. Gaina
JTJulian Togelius
Julian Togelius
SLSimon M. Lucas
Simon M. Lucas
General Video Game Playing (GVGP) aims at designing an agent that is capable of playing multiple video games with no human intervention. In 2014, The General Video Game AI (GVGAI) competition framework was created and released with the purpose of providing researchers a common open-source and easy to use platform for testing their AI methods with potentially infinity of games created using Video Game Description Language (VGDL). The framework has been expanded into several tracks during the last few years to meet the demand of different research directions. The agents are required either to play multiple unknown games with or without access to game simulations, or to design new game levels or rules. This survey paper presents the VGDL, the GVGAI framework, existing tracks, and reviews the wide use of GVGAI framework in research, education and competitions five years after its birth. A future plan of framework improvements is also described.