Bots with attitude

Penny Baillie De Byl

Research output: Contribution to journalArticleResearchpeer-review

Abstract

Bot navigation in many computer games is achieved with static waypoints placed throughout a map. This allows path
finding to be performed by implementing search algorithms to find the optimal path between waypoints using a heuristic
function. This heuristic is usually based on Euclidian distance and terrain. While this type of path finding is effective, it
does not provide for adaptable path finding in a dynamic environment. One concept that promises to achieve adaptive
responses in differing situations in artificial agents is that of emotion. In this paper, we examine the use of positive and
negative feelings, referred to as attitude, in developing a dynamic heuristic for A* that responds by finding paths
between waypoints influenced by a bot’s internal state and its feelings toward objects in the game. Using a traditional
A* heuristic, a bot needing to travel to two goal locations will firstly perform path finding to move to the first goal followed
by path finding for the second goal. Using our dynamic heuristic, the second path finding operation is eliminated as a
path to the second goal via the first goal is calculated. This dynamic heuristic is illustrated in this paper through
experimentation with a bot traversing a map of random waypoints
Original languageEnglish
Pages (from-to)10-18
Number of pages9
JournalInternational Journal of Intelligent Games & Simulation
Volume4
Issue number1
Publication statusPublished - 2005
Externally publishedYes

Fingerprint

Computer games
Navigation

Cite this

De Byl, Penny Baillie. / Bots with attitude. In: International Journal of Intelligent Games & Simulation. 2005 ; Vol. 4, No. 1. pp. 10-18.
@article{eab4549930664627ba6052e02b340c0c,
title = "Bots with attitude",
abstract = "Bot navigation in many computer games is achieved with static waypoints placed throughout a map. This allows pathfinding to be performed by implementing search algorithms to find the optimal path between waypoints using a heuristicfunction. This heuristic is usually based on Euclidian distance and terrain. While this type of path finding is effective, itdoes not provide for adaptable path finding in a dynamic environment. One concept that promises to achieve adaptiveresponses in differing situations in artificial agents is that of emotion. In this paper, we examine the use of positive andnegative feelings, referred to as attitude, in developing a dynamic heuristic for A* that responds by finding pathsbetween waypoints influenced by a bot’s internal state and its feelings toward objects in the game. Using a traditionalA* heuristic, a bot needing to travel to two goal locations will firstly perform path finding to move to the first goal followedby path finding for the second goal. Using our dynamic heuristic, the second path finding operation is eliminated as apath to the second goal via the first goal is calculated. This dynamic heuristic is illustrated in this paper throughexperimentation with a bot traversing a map of random waypoints",
author = "{De Byl}, {Penny Baillie}",
year = "2005",
language = "English",
volume = "4",
pages = "10--18",
journal = "International Journal of Intelligent Games & Simulation",
issn = "1477-2043",
number = "1",

}

Bots with attitude. / De Byl, Penny Baillie.

In: International Journal of Intelligent Games & Simulation, Vol. 4, No. 1, 2005, p. 10-18.

Research output: Contribution to journalArticleResearchpeer-review

TY - JOUR

T1 - Bots with attitude

AU - De Byl, Penny Baillie

PY - 2005

Y1 - 2005

N2 - Bot navigation in many computer games is achieved with static waypoints placed throughout a map. This allows pathfinding to be performed by implementing search algorithms to find the optimal path between waypoints using a heuristicfunction. This heuristic is usually based on Euclidian distance and terrain. While this type of path finding is effective, itdoes not provide for adaptable path finding in a dynamic environment. One concept that promises to achieve adaptiveresponses in differing situations in artificial agents is that of emotion. In this paper, we examine the use of positive andnegative feelings, referred to as attitude, in developing a dynamic heuristic for A* that responds by finding pathsbetween waypoints influenced by a bot’s internal state and its feelings toward objects in the game. Using a traditionalA* heuristic, a bot needing to travel to two goal locations will firstly perform path finding to move to the first goal followedby path finding for the second goal. Using our dynamic heuristic, the second path finding operation is eliminated as apath to the second goal via the first goal is calculated. This dynamic heuristic is illustrated in this paper throughexperimentation with a bot traversing a map of random waypoints

AB - Bot navigation in many computer games is achieved with static waypoints placed throughout a map. This allows pathfinding to be performed by implementing search algorithms to find the optimal path between waypoints using a heuristicfunction. This heuristic is usually based on Euclidian distance and terrain. While this type of path finding is effective, itdoes not provide for adaptable path finding in a dynamic environment. One concept that promises to achieve adaptiveresponses in differing situations in artificial agents is that of emotion. In this paper, we examine the use of positive andnegative feelings, referred to as attitude, in developing a dynamic heuristic for A* that responds by finding pathsbetween waypoints influenced by a bot’s internal state and its feelings toward objects in the game. Using a traditionalA* heuristic, a bot needing to travel to two goal locations will firstly perform path finding to move to the first goal followedby path finding for the second goal. Using our dynamic heuristic, the second path finding operation is eliminated as apath to the second goal via the first goal is calculated. This dynamic heuristic is illustrated in this paper throughexperimentation with a bot traversing a map of random waypoints

M3 - Article

VL - 4

SP - 10

EP - 18

JO - International Journal of Intelligent Games & Simulation

JF - International Journal of Intelligent Games & Simulation

SN - 1477-2043

IS - 1

ER -