General Optimization Framework for Recurrent Reachability Objectives
| Authors | |
|---|---|
| Year of publication | 2022 |
| Type | Article in Proceedings |
| Conference | Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, IJCAI 2022 |
| MU Faculty or unit | |
| Citation | |
| web | Paper URL |
| Doi | http://dx.doi.org/10.24963/ijcai.2022/644 |
| Keywords | recurrent reachability objectives; strategy synthesis |
| Description | We consider the mobile robot path planning problem for a class of recurrent reachability objectives. These objectives are parameterized by the expected time needed to visit one position from another, the expected square of this time, and also the frequency of moves between two neighboring locations. We design an efficient strategy synthesis algorithm for recurrent reachability objectives and demonstrate its functionality on non-trivial instances. |
| Related projects: |