Local Search Heuristics for Robotic Routing Planner

Autoři: Stanislav Slušný
Mgr. Roman Neruda, Ph.D.
Rok vydání: 2011
Typ publikace: Konferenční příspěvek (mezinárodní konf.)
Periodikum: Advances in Neural Networks – ISNN 2011. Part III
Projekty: Algoritmy učení neuronových sítí založené na teorii regularizace
Bibliografická citace: SLUŠNÝ, Stanislav, NERUDA, Roman. Local Search Heuristics for Robotic Routing Planner. In: LIU, D., ZHANG, H., POLYCARPOU, M., ALIPPI, C., HE, H., eds. Advances in Neural Networks – ISNN 2011. Part III. Berlin: Springer, 2011, S. 31-40. Lecture Notes in Computer Science, 6677. ISBN 978-3-642-21110-2. ISSN 0302-9743
Dostupné z: doi:10.1007/978-3-642-21111-9_4
DOI: 10.1007/978-3-642-21111-9_4
ID: 369161

Abstrakt

Several approaches to one particular variation of robot path planning problem are introduced in this paper. A detailed description of local neighborhood search heuristics as well as a comparison with more sophisticated algorithms based on constraint programming technique is presented. The enhancements and further adaptation to the real world environment are discussed as well.