Task Sequencing for Autonomous Robotic Vacuum Cleaners

Various planning problems for robotic systems are of considerable interest. One of such problems is the problem of task sequencing. In this paper, we consider the problem of task sequencing for autonomous vacuum floor cleaning robots. We consider a graph model for the problem. We propose an efficient approach to solve the problem. In particular, we use an explicit reduction from the decision version of the problem to the satisfiability problem. We present the results of computational experiments for different satisfiability algorithms.