General Optimization Framework for Recurrent Reachability Objectives

May 27, 2022 Β· Declared Dead Β· πŸ› International Joint Conference on Artificial Intelligence

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors David KlaΕ‘ka, AntonΓ­n Kučera, VΓ­t Musil, VojtΔ›ch ŘehΓ‘k arXiv ID 2205.14057 Category cs.RO: Robotics Cross-listed cs.GT Citations 1 Venue International Joint Conference on Artificial Intelligence Last Checked 3 months ago
Abstract
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.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Robotics

Died the same way β€” πŸ‘» Ghosted