Proceedings Vol. 12 (2006)
ENGINEERING MECHANICS 2006
May 15 – 18, 2006, Svratka, Czech Republic
Copyright © 2006 Institute of Theoretical and Applied Mechanics, Academy of Sciences of the Czech Republic, Prague
ISSN 1805-8248 (printed)
ISSN 1805-8256 (electronic)
list of papers scientific commitee
pages 180 - +9p., full text
The aim of the robot path planning is searching for a path from a robot start configuration to a goal configuration without collisions with known obstacles minimizing weight of the path. We consider a nonholonomic robot moving in a two-dimensional continuous space with known polygonal obstacles. When planning a path by Case-Based Reasoning, the most similar cases (already used paths or their parts) are searched for to be subsequently adapted to the new problem. Rapidly-exploring Random Trees are 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.
back to list of papers
Text and facts may be copied and used freely, but credit should be given to these Proceedings.
All papers were reviewed by members of the scientific committee.