Real Time Robot Path Planning and Cleaning

Authors: Stanislav Slušný, M. Zerola, Roman Neruda
Publication year: 2010
Publication type: Konferenční příspěvek (mezinárodní konf.)
Periodical: Advanced Intelligent Computing Theories and Applications With Aspects of Artificial Intelligence
Projects: Centre for Applied Cybernetics
Bibliographic citation: SLUŠNÝ, Stanislav, ZEROLA, M., NERUDA, Roman. Real Time Robot Path Planning and Cleaning. In: GOEBEL, R., SIEKMANN, J., WAHLSTER, W., eds. Advanced Intelligent Computing Theories and Applications With Aspects of Artificial Intelligence. Berlin: Springer, 2010, S. 442-449. Lecture Notes in Artificial Intelligence, 6216. ISBN 978-3-642-14931-3. ISSN 0302-9743
Dostupné z: doi:10.1007/978-3-642-14932-0_55
DOI: 10.1007/978-3-642-14932-0_55
ID: 348932

Abstract

The paper tackles the robot path planning problem with additional capacity constraints. We present new optimization model based on Constraint Programming. The emphasis is put on several comparisons including the pure CP solver performance, solution convergence, and application of the model within other local search methods. Experiments indicate fairly decent CP performance on smaller instances. Embedding CP into local search methods improves the runtime/convergence performance, and satisfiable solutions are found even under severe time constraints.