Mobile Robot Path Planning by Means of Case-Based Reasoning

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26210%2F05%3APU55452" target="_blank" >RIV/00216305:26210/05:PU55452 - isvavai.cz</a>

Result on the web

—

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

Mobile Robot Path Planning by Means of Case-Based Reasoning

Original language description

The aim of the path planning is searching for a path from a start to a goal position without collisions with known obstacles minimizing length and difficulty (risk) of the path. We have investigated possibilities to use case-based reasoning (CBR) for improvement of existing path planning methods. We have proposed methods based on using a case graph, which is a structure composed of segments of already used paths. These methods try to construct a new path combining paths in the case graph with paths findby any other path searching method. In this year, we studied methods combining CBR with genetic algorithm, heuristic local search and graph searching algorithms.

Czech name

—

Czech description

—

Type

C - Chapter in a specialist book

CEP classification

JD - Use of computers, robotics and its application

OECD FORD branch

—

Project

—

Continuities

Z - Vyzkumny zamer (s odkazem do CEZ)

Publication year

2005

Confidentiality

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

Book/collection name

Simulation Modelling of Mechatronic Systems I

ISBN

80-214-3144-X

Number of pages of the result

6

Pages from-to

—

Number of pages of the book

160

Publisher name

Brno University of Technology

Place of publication

Brno

UT code for WoS chapter

—