000003308 001__ 3308
000003308 005__ 20141118153404.0
000003308 04107 $$acze
000003308 046__ $$k2005-05-09
000003308 100__ $$aKrček, P.
000003308 24500 $$aMobile robot path planning by means of case graph and genetic algorithms

000003308 24630 $$n11.$$pENGINEERING MECHANICS 2005
000003308 260__ $$bInstitute of Thermomechanics AS CR, v.v.i., Brno
000003308 506__ $$arestricted
000003308 520__ $$2eng$$aThe 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 or Dijkstra’s 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.

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

000003308 7112_ $$aENGINEERING MECHANICS 2005$$cSvratka (CZ)$$d2005-05-09 / 2005-05-12$$gEM2005
000003308 720__ $$aKrček, P.$$iHodál, J.$$iDvořák, J.
000003308 8560_ $$ffischerc@itam.cas.cz
000003308 8564_ $$s109729$$uhttps://invenio.itam.cas.cz/record/3308/files/Krcek-PT.pdf$$y
             Original version of the author's contribution as presented on CD, .
            
000003308 962__ $$r3238
000003308 980__ $$aPAPER