Comparison of several machine learning techniques in pursuit-evasion games

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

This paper describes the results of an empirical evaluation comparing the performance of five different algorithms in a pursuit and evasion game. The pursuit and evasion game was played using two robots. The task of the pursuer was to catch the other robot (the evader). The algorithms tested were a random player, the optimal player, a genetic algorithm learner, a k-nearest neighbor learner, and a reinforcement learner. The k-nearest neighbor learner performed best overall, but a closer analysis of the results showed that the genetic algorithm suffered from an exploration-exploitation problem.

Original languageEnglish
Title of host publicationRoboCup 2001
Subtitle of host publicationRobot Soccer World Cup V
Pages269-274
Number of pages6
Publication statusPublished - 2002 Dec 1
Event5th Robot World Cup Soccer Games and Conferences, RoboCup 2001 - Seattle, WA, United States
Duration: 2001 Aug 22001 Aug 10

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2377 LNAI
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other5th Robot World Cup Soccer Games and Conferences, RoboCup 2001
CountryUnited States
CitySeattle, WA
Period01/8/201/8/10

Fingerprint

Pursuit-evasion Games
Pursuit
Learning systems
Nearest Neighbor
Machine Learning
Robot
Genetic algorithms
Genetic Algorithm
Robots
Game
Reinforcement
Exploitation
Evaluation

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Baltes, H. J., & Park, Y. (2002). Comparison of several machine learning techniques in pursuit-evasion games. In RoboCup 2001: Robot Soccer World Cup V (pp. 269-274). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2377 LNAI).

Comparison of several machine learning techniques in pursuit-evasion games. / Baltes, Hansjoerg (Jacky); Park, Yongjoo.

RoboCup 2001: Robot Soccer World Cup V. 2002. p. 269-274 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2377 LNAI).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Baltes, HJ & Park, Y 2002, Comparison of several machine learning techniques in pursuit-evasion games. in RoboCup 2001: Robot Soccer World Cup V. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 2377 LNAI, pp. 269-274, 5th Robot World Cup Soccer Games and Conferences, RoboCup 2001, Seattle, WA, United States, 01/8/2.
Baltes HJ, Park Y. Comparison of several machine learning techniques in pursuit-evasion games. In RoboCup 2001: Robot Soccer World Cup V. 2002. p. 269-274. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Baltes, Hansjoerg (Jacky) ; Park, Yongjoo. / Comparison of several machine learning techniques in pursuit-evasion games. RoboCup 2001: Robot Soccer World Cup V. 2002. pp. 269-274 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{8b2b7f1e2a9f4eaa85c75750a4818522,
title = "Comparison of several machine learning techniques in pursuit-evasion games",
abstract = "This paper describes the results of an empirical evaluation comparing the performance of five different algorithms in a pursuit and evasion game. The pursuit and evasion game was played using two robots. The task of the pursuer was to catch the other robot (the evader). The algorithms tested were a random player, the optimal player, a genetic algorithm learner, a k-nearest neighbor learner, and a reinforcement learner. The k-nearest neighbor learner performed best overall, but a closer analysis of the results showed that the genetic algorithm suffered from an exploration-exploitation problem.",
author = "Baltes, {Hansjoerg (Jacky)} and Yongjoo Park",
year = "2002",
month = "12",
day = "1",
language = "English",
isbn = "3540439129",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "269--274",
booktitle = "RoboCup 2001",

}

TY - GEN

T1 - Comparison of several machine learning techniques in pursuit-evasion games

AU - Baltes, Hansjoerg (Jacky)

AU - Park, Yongjoo

PY - 2002/12/1

Y1 - 2002/12/1

N2 - This paper describes the results of an empirical evaluation comparing the performance of five different algorithms in a pursuit and evasion game. The pursuit and evasion game was played using two robots. The task of the pursuer was to catch the other robot (the evader). The algorithms tested were a random player, the optimal player, a genetic algorithm learner, a k-nearest neighbor learner, and a reinforcement learner. The k-nearest neighbor learner performed best overall, but a closer analysis of the results showed that the genetic algorithm suffered from an exploration-exploitation problem.

AB - This paper describes the results of an empirical evaluation comparing the performance of five different algorithms in a pursuit and evasion game. The pursuit and evasion game was played using two robots. The task of the pursuer was to catch the other robot (the evader). The algorithms tested were a random player, the optimal player, a genetic algorithm learner, a k-nearest neighbor learner, and a reinforcement learner. The k-nearest neighbor learner performed best overall, but a closer analysis of the results showed that the genetic algorithm suffered from an exploration-exploitation problem.

UR - http://www.scopus.com/inward/record.url?scp=84867465162&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84867465162&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:84867465162

SN - 3540439129

SN - 9783540439127

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 269

EP - 274

BT - RoboCup 2001

ER -