Date of this Version
In this paper, we consider the problem of robot motion planning in order to satisfy formulas expressible in temporal logics. Temporal logics naturally express traditional robot specifications such as reaching a goal or avoiding an obstacle, but also more sophisticated specifications such as sequencing, coverage, or temporal ordering of different tasks. In order to provide computational solutions to this problem, we first construct discrete abstractions of robot motion based on some environmental decomposition. We then generate discrete plans satisfying the temporal logic formula using powerful model checking tools, and finally translate the discrete plans to continuous trajectories using hybrid control. Critical to our approach is providing formal guarantees ensuring that if the discrete plan satisfies the temporal logic formula, then the continuous motion also satisfies the exact same formula.
Motion planning, temporal logics, model checking, discrete abstrations, hybrid control
Geogios E. Fainekos, Hadas Kress-Gazit, and George J. Pappas, "Temporal Logic Motion Planning for Mobile Robots", . April 2005.
Date Posted: 12 October 2010
This document has been peer reviewed.