Real time robot path planning and cleaning

Authors:
Stanislav Slušný;Michal Zerola;Roman Neruda
Affiliations:
Institute of Computer Science, Academy of Sciences of the Czech Republic;Department of Mathematics, FNSPE, Czech Technical University;Institute of Computer Science, Academy of Sciences of the Czech Republic
Venue:
ICIC'10 Proceedings of the Advanced intelligent computing theories and applications, and 6th international conference on Intelligent computing
Year:
2010

Citing 4
Cited 0

Robust Monte Carlo localization for mobile robots

Artificial Intelligence
Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties

Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties
A Robust Layered Control System For a Mobile Robot

A Robust Layered Control System For a Mobile Robot
Elephants don't play chess

Robotics and Autonomous Systems

Quantified Score

Hi-index	0.00

Visualization

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.