Engineering Mechanics

Proceedings Vol. 11 (2005)

ENGINEERING MECHANICS 2005

Copyright © 2005 Institute of Mechanics of Solids, Faculty of Mechanical Engineering, Bruno University of Technology, Brno

 

Krček P., Dvořák J., Hodál J.
pages 169 - +8p., full text

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 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.

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.