000001650 001__ 1650
000001650 005__ 20141118153459.0
000001650 04107 $$acze
000001650 046__ $$k2007-05-14
000001650 100__ $$aKrček, P.
000001650 24500 $$aMOBILE ROBOT PATH PLANNING BY MEANS OF GENETIC ALGORITHMS

000001650 24630 $$n13$$pEngineering Mechanics 2007
000001650 260__ $$bInstitute of Thermomechanics AS CR, v.v.i., Prague
000001650 506__ $$arestricted
000001650 520__ $$2eng$$aIn this paper, we deal with mobile robot path planning in a twodimensional continuous space in which known static polygonal obstacles are defined. The aim of the path planning is searching for a path from a start to a goal position without collisions with known obstacles minimizing such criteria as length, difficulty and risk of the path. We investigate possibilities of using genetic algorithms for solving this problem and describe various problem specific genetic operators and fitness functions. We study also an ability of proposed algorithm to adapt a previous solution to changes of start or goal position and changes of environment. Results of computational experiments are presented.

000001650 540__ $$aText je chráněný podle autorského zákona č. 121/2000 Sb.
000001650 653__ $$a

000001650 7112_ $$aEngineering Mechanics 2007$$cSvratka (CZ)$$d2007-05-14 / 2007-05-17$$gEM2007
000001650 720__ $$aKrček, P.$$iDvořák, J.
000001650 8560_ $$ffischerc@itam.cas.cz
000001650 8564_ $$s487049$$uhttp://invenio.itam.cas.cz/record/1650/files/065-Krcek-PT.pdf$$y
             Original version of the author's contribution as presented on CD, .
            
000001650 962__ $$r1585
000001650 980__ $$aPAPER