Publication detail

Canadian traveller problem: A note about Game Theory approach

HRDINA, J. MATOUŠEK, R.

Original Title

Canadian traveller problem: A note about Game Theory approach

Type

journal article in Scopus

Language

English

Original Abstract

In a variety of real world problems from robot navigation to logistics, agents face the challenge of path optimization on a graph with unknown edge costs. It is known as the Canadian Traveller Problem (CTP). There are many variants of CTP and many path planning approaches to find an optimal solution of the CTP. The aim of the paper is to present the possible way for a solution strategy and possible problem description by means of the Game Theory (GT). The paper presents initial study and theoretical background of the Game Theory approaches to find a proper CTP policy. In this problem the agent known as a traveller needs to go trough the real-life ways implemented by CTP. The presented CTP problem is a base problem with unrecoverable edges. Because the most of the CTP solution strategies are based on heuristic and meta-heuristic algorithms, i.e. on the ground of Artificial Intelligence (AI) approaches, we also present this kind of solution. The GT solution is compared with advance swarm intelligence strategy based on Elitist Ant System (AS).

Keywords

Ant System; Canadian Traveller Problem; CTP; Game Theory; Swarm intelligence

Authors

HRDINA, J.; MATOUŠEK, R.

RIV year

2014

Released

1. 9. 2014

Publisher

Brno University of Technology

Location

Brno

ISBN

1803-3814

Periodical

Mendel Journal series

Year of study

2014

Number

1

State

Czech Republic

Pages from

403

Pages to

406

Pages count

4

BibTex

@article{BUT132900,
  author="Jaroslav {Hrdina} and Radomil {Matoušek}",
  title="Canadian traveller problem: A note about Game Theory approach",
  journal="Mendel Journal series",
  year="2014",
  volume="2014",
  number="1",
  pages="403--406",
  issn="1803-3814"
}