FOND planning for pure-past linear temporal logic goals
Recently, Pure-Past Temporal Logic (PPLTL) has proven highly effective in specifying temporally extended goals in deterministic planning domains. In this paper, we show its effectiveness also for fully observable nondeterministic (FOND) planning, both for strong and strong-cyclic plans. We present a...
| Main Authors: | , , , , , |
|---|---|
| Format: | Conference item |
| Language: | English |
| Published: |
IOS Press
2023
|
| _version_ | 1826312784925687808 |
|---|---|
| author | Bonassi, L De Giacomo, G Favorito, M Fuggitti, F Gerevini, AE Scala, E |
| author_facet | Bonassi, L De Giacomo, G Favorito, M Fuggitti, F Gerevini, AE Scala, E |
| author_sort | Bonassi, L |
| collection | OXFORD |
| description | Recently, Pure-Past Temporal Logic (PPLTL) has proven highly effective in specifying temporally extended goals in deterministic planning domains. In this paper, we show its effectiveness also for fully observable nondeterministic (FOND) planning, both for strong and strong-cyclic plans. We present a notably simple encoding of FOND planning for PPLTL goals into standard FOND planning for final-state goals. The encoding only introduces few fluents (at most linear in the PPLTL goal) without adding any spurious action and allows planners to lazily build the relevant part of the deterministic automaton for the goal formula on-the-fly during the search. We formally prove its correctness, implement it in a tool called Plan4Past, and experimentally show its practical effectiveness. |
| first_indexed | 2024-04-23T08:26:05Z |
| format | Conference item |
| id | oxford-uuid:99f2f506-f083-48db-9508-534a359a88bf |
| institution | University of Oxford |
| language | English |
| last_indexed | 2024-04-23T08:26:05Z |
| publishDate | 2023 |
| publisher | IOS Press |
| record_format | dspace |
| spelling | oxford-uuid:99f2f506-f083-48db-9508-534a359a88bf2024-04-16T12:39:15ZFOND planning for pure-past linear temporal logic goalsConference itemhttp://purl.org/coar/resource_type/c_5794uuid:99f2f506-f083-48db-9508-534a359a88bfEnglishSymplectic ElementsIOS Press2023Bonassi, LDe Giacomo, GFavorito, MFuggitti, FGerevini, AEScala, ERecently, Pure-Past Temporal Logic (PPLTL) has proven highly effective in specifying temporally extended goals in deterministic planning domains. In this paper, we show its effectiveness also for fully observable nondeterministic (FOND) planning, both for strong and strong-cyclic plans. We present a notably simple encoding of FOND planning for PPLTL goals into standard FOND planning for final-state goals. The encoding only introduces few fluents (at most linear in the PPLTL goal) without adding any spurious action and allows planners to lazily build the relevant part of the deterministic automaton for the goal formula on-the-fly during the search. We formally prove its correctness, implement it in a tool called Plan4Past, and experimentally show its practical effectiveness. |
| spellingShingle | Bonassi, L De Giacomo, G Favorito, M Fuggitti, F Gerevini, AE Scala, E FOND planning for pure-past linear temporal logic goals |
| title | FOND planning for pure-past linear temporal logic goals |
| title_full | FOND planning for pure-past linear temporal logic goals |
| title_fullStr | FOND planning for pure-past linear temporal logic goals |
| title_full_unstemmed | FOND planning for pure-past linear temporal logic goals |
| title_short | FOND planning for pure-past linear temporal logic goals |
| title_sort | fond planning for pure past linear temporal logic goals |
| work_keys_str_mv | AT bonassil fondplanningforpurepastlineartemporallogicgoals AT degiacomog fondplanningforpurepastlineartemporallogicgoals AT favoritom fondplanningforpurepastlineartemporallogicgoals AT fuggittif fondplanningforpurepastlineartemporallogicgoals AT gereviniae fondplanningforpurepastlineartemporallogicgoals AT scalae fondplanningforpurepastlineartemporallogicgoals |