Detail publikace

Using Case-Based Reasoning and Genetic Algorithms for Mobile Robot Path Planning

DVOŘÁK, J. KRČEK, P. SAMOHÝL, P.

Anglický název

Using Case-Based Reasoning and Genetic Algorithms for Mobile Robot Path Planning

Typ

Článek recenzovaný mimo WoS a Scopus

Jazyk

en

Originální abstrakt

The aim of the robot path planning is searching for a path from a start to a goal position without collisions with known obstacles minimizing length, difficulty and risk of the path. A two-dimensional grid with known static obstacles models the robot environment. When planning a path, the most similar cases (already used paths or their parts) are searched for to be subsequently adapted to the new problem. A genetic algorithm is used to find the missing parts of the constructed paths or new paths if similar cases are not found or adapted solutions are not good enough.

Klíčová slova anglicky

mobile robot; path planning; case-based reasoning; genetic algorithm

Vydáno

2004-09-01

ISSN

0033-2089

Ročník

2004

Číslo

8-9

Strany od–do

55–

Počet stran

3

BIBTEX


@article{BUT46493,
  author="Jiří {Dvořák} and Petr {Krček} and Petr {Samohýl}",
  title="Using Case-Based Reasoning and Genetic Algorithms for Mobile Robot Path Planning",
  journal="Elektronika",
  year="2004",
  volume="2004",
  number="8-9",
  pages="3",
  issn="0033-2089"
}