Použití případového usuzování pro plánování cesty mobilního robotu

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26210%2F08%3APU79941" target="_blank" >RIV/00216305:26210/08:PU79941 - isvavai.cz</a>

Výsledek na webu

—

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

Using Case-Based Reasoning for Mobile Robot Path Planning

Popis výsledku v původním jazyce

The mobile robot path planning involves finding the shortest and least difficult path from a start to a goal position in a given environment without collisions with known obstacles. The main idea of case-based reasoning (CBR) is a presumption that similar tasks probably also have similar solutions. New tasks are solved by adapting old proved solutions of similar tasks to new conditions. Tasks and their solutions (cases) are stored in a case base. The focal point of this paper is the proposition of a path planning method based on CBR combined with graph algorithms in the environment represented by a rectangular grid. On the basis of the experimental results obtained, it is possible to say that case-based reasoning can significantly save computation costs, particularly in large environments.

Název v anglickém jazyce

Using Case-Based Reasoning for Mobile Robot Path Planning

Popis výsledku anglicky

The mobile robot path planning involves finding the shortest and least difficult path from a start to a goal position in a given environment without collisions with known obstacles. The main idea of case-based reasoning (CBR) is a presumption that similar tasks probably also have similar solutions. New tasks are solved by adapting old proved solutions of similar tasks to new conditions. Tasks and their solutions (cases) are stored in a case base. The focal point of this paper is the proposition of a path planning method based on CBR combined with graph algorithms in the environment represented by a rectangular grid. On the basis of the experimental results obtained, it is possible to say that case-based reasoning can significantly save computation costs, particularly in large environments.

Druh

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

CEP obor

JD - Využití počítačů, robotika a její aplikace

OECD FORD obor

—

Projekt

—

Návaznosti

Z - Vyzkumny zamer (s odkazem do CEZ)

Rok uplatnění

2008

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

Engineering Mechanics

ISSN

1802-1484

e-ISSN

—

Svazek periodika

15

Číslo periodika v rámci svazku

3

Stát vydavatele periodika

CZ - Česká republika

Počet stran výsledku

11

Strana od-do

—

Kód UT WoS článku

—

EID výsledku v databázi Scopus

—