Optimal Path Planning under Temporal Logic Contstraints
| Název česky | Plánování optimální cesty při omezeních daných temporální logikou |
|---|---|
| Autoři | |
| Rok publikování | 2010 |
| Druh | Článek ve sborníku |
| Konference | Proceedings of the 2010 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2010) |
| Fakulta / Pracoviště MU | |
| Citace | |
| Obor | Informatika |
| Klíčová slova | Motion Control; Navigation |
| Popis | We present a method for automatically generating optimal robot trajectories satisfying high level mission specifications. The motion of the robot in the environment is modeled as a weighted transition system. The mission is specified by a linear temporal logic formula. In addition, we require that an optimizing proposition must be repeatedly satisfied. The cost function that we seek to minimize is the maximum time between satisfying instances of the optimizing proposition. For every environment model, and for every formula, our method computes a robot trajectory which minimizes the cost function. The problem is motivated by robotic monitoring and data gathering. In this setting, the optimizing proposition is satisfied at locations where data can be uploaded, and the formula specifies a an infinite horizon data collection mission. |
| Související projekty: |