Bp 357 en
Any-angle path-planning algorithms
Author: Matej Grajciar
This thesis examines the profitability of the any-angle path-planning algorithms (Basic Theta * Lazy * Theta, Phi * Incremental Phi *). Algorithms are tested in different representations (Grid, triangulation mesh, tetrahedral mesh). All of the mentioned algorithms are programmed and tested in large scale experiments. The results of any-angle algorithms are compared with the results of the most known standard algorithm A*.
- Grajciar Matej, tel: +420 775 428 917, mailto:firstname.lastname@example.org