Canadian Traveller Problem: a note about Game Theory Approach

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26210%2F14%3APU113678" target="_blank" >RIV/00216305:26210/14:PU113678 - isvavai.cz</a>
Alternative codes found
RIV/00216305:26210/14:PU122563
Result on the web
—
DOI - Digital Object Identifier
—

Result language
angličtina
Original language name
Canadian Traveller Problem: a note about Game Theory Approach
Original language description
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 themost 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 solution is compared with advance swarm in
Czech name
—
Czech description
—

Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
BA - General mathematics
OECD FORD branch
—

Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year
2014
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)