Canadian Traveller Problem: a note about Game Theory Approach

Kód výsledku v 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>

Nalezeny alternativní kódy

RIV/00216305:26210/14:PU122563

Výsledek na webu

—

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

Canadian Traveller Problem: a note about Game Theory Approach

Popis výsledku v původním jazyce

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

Název v anglickém jazyce

Canadian Traveller Problem: a note about Game Theory Approach

Popis výsledku anglicky

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

Druh

J_x - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)

CEP obor

BA - Obecná matematika

OECD FORD obor

—

Projekt

Výsledek vznikl pri realizaci vícero projektů. Více informací v záložce Projekty.

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Rok uplatnění

2014

Kód důvěrnosti údajů

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

Název periodika

Mendel Journal series

ISSN

1803-3814

e-ISSN

—

Svazek periodika

20

Číslo periodika v rámci svazku

1

Stát vydavatele periodika

CZ - Česká republika

Počet stran výsledku

4

Strana od-do

403-406

Kód UT WoS článku

—

EID výsledku v databázi Scopus

—