On Verifying Linear Execution Strategies in Planning Against Nature

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21730%2F24%3A00375705" target="_blank" >RIV/68407700:21730/24:00375705 - isvavai.cz</a>

Výsledek na webu

<a href="https://doi.org/10.1609/icaps.v34i1.31464" target="_blank" >https://doi.org/10.1609/icaps.v34i1.31464</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1609/icaps.v34i1.31464" target="_blank" >10.1609/icaps.v34i1.31464</a>

Jazyk výsledku

angličtina

Název v původním jazyce

On Verifying Linear Execution Strategies in Planning Against Nature

Popis výsledku v původním jazyce

While planning and acting in environments in which nature can trigger non-deterministic events, the agent has to consider that the state of the environment might change without its consent. Practically, it means that the agent has to make sure that it eventually achieves its goal (if possible) despite the acts of nature. In this paper, we first formalize the semantics of such problems in Alternating-time Temporal Logic, which allows us to prove some theoretical properties of different types of solutions. Then, we focus on linear execution strategies, which resemble classical plans in that they follow a fixed sequence of actions. We show that any problem that can be solved by a linear execution strategy can be solved by a particular form of linear execution strategy which assigns wait-for preconditions to each action in the plan that specifies when to execute that action. Then, we propose a sound algorithm that verifies a sequence of actions and assigns wait-for preconditions to them by leveraging abstraction.

Název v anglickém jazyce

On Verifying Linear Execution Strategies in Planning Against Nature

Popis výsledku anglicky

While planning and acting in environments in which nature can trigger non-deterministic events, the agent has to consider that the state of the environment might change without its consent. Practically, it means that the agent has to make sure that it eventually achieves its goal (if possible) despite the acts of nature. In this paper, we first formalize the semantics of such problems in Alternating-time Temporal Logic, which allows us to prove some theoretical properties of different types of solutions. Then, we focus on linear execution strategies, which resemble classical plans in that they follow a fixed sequence of actions. We show that any problem that can be solved by a linear execution strategy can be solved by a particular form of linear execution strategy which assigns wait-for preconditions to each action in the plan that specifies when to execute that action. Then, we propose a sound algorithm that verifies a sequence of actions and assigns wait-for preconditions to them by leveraging abstraction.

Druh

D - Stať ve sborníku

CEP obor

—

OECD FORD obor

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Projekt

Výsledek vznikl pri realizaci vícero projektů. Více informací v záložce Projekty.

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Rok uplatnění

2024

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název statě ve sborníku

Proceedings of the Thirty-Fourth International Conference on Automated Planning and Scheduling

ISBN

978-1-57735-889-3

ISSN

2334-0835

e-ISSN

2334-0843

Počet stran výsledku

9

Strana od-do

86-94

Název nakladatele

AAAI Press

Místo vydání

Menlo Park, California

Místo konání akce

Banff

Datum konání akce

1. 6. 2024

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

—