Abstract
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. © 2011 Springer-Verlag.
Cite
CITATION STYLE
Slušný, S., & Neruda, R. (2011). Local search heuristics for robotic routing planner. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6677 LNCS, pp. 31–40). https://doi.org/10.1007/978-3-642-21111-9_4
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
