A common approach to planning with partial information is replanning: compute a plan based on assumptions about unknown information and replan if these assumptions are refuted during execution. To date, most planners with incomplete information have been designed to provide guarantees on completeness and soundness for the generated plans. Switching focus to performance, we measure the robustness of a plan, which quantifies the plan's ability to avoid failure. Given a plan and an agent's belief, which describes the set of states it deems as possible, robustness counts the number of world states in the belief from which the plan will achieve the goal without the need to replan. We formally describe the trade-off between robustness and plan cost and offer a solver that is guaranteed to produce plans that satisfy a required level of robustness. By evaluating our approach on a set of standard benchmarks, we demonstrate how it can improve the performance of a partially informed agent.

Reasoning about plan robustness versus plan cost for partially informed agents / Keren, S.; Bernardini, S.; Kwapong, K.; Parkes, D. C.. - 2:(2020), pp. 549-558. (Intervento presentato al convegno International Conference on the Principles of Knowledge Representation and Reasoning tenutosi a Rhodes, Greece) [10.24963/kr.2020/55].

Reasoning about plan robustness versus plan cost for partially informed agents

Bernardini S.;
2020

Abstract

A common approach to planning with partial information is replanning: compute a plan based on assumptions about unknown information and replan if these assumptions are refuted during execution. To date, most planners with incomplete information have been designed to provide guarantees on completeness and soundness for the generated plans. Switching focus to performance, we measure the robustness of a plan, which quantifies the plan's ability to avoid failure. Given a plan and an agent's belief, which describes the set of states it deems as possible, robustness counts the number of world states in the belief from which the plan will achieve the goal without the need to replan. We formally describe the trade-off between robustness and plan cost and offer a solver that is guaranteed to produce plans that satisfy a required level of robustness. By evaluating our approach on a set of standard benchmarks, we demonstrate how it can improve the performance of a partially informed agent.
2020
International Conference on the Principles of Knowledge Representation and Reasoning
Incomplete information; Partial information; Plan-based; Re-planning; Trade off
04 Pubblicazione in atti di convegno::04b Atto di convegno in volume
Reasoning about plan robustness versus plan cost for partially informed agents / Keren, S.; Bernardini, S.; Kwapong, K.; Parkes, D. C.. - 2:(2020), pp. 549-558. (Intervento presentato al convegno International Conference on the Principles of Knowledge Representation and Reasoning tenutosi a Rhodes, Greece) [10.24963/kr.2020/55].
File allegati a questo prodotto
File Dimensione Formato  
Keren_Reasoning_2020.pdf

accesso aperto

Note: https://proceedings.kr.org/2020/55/kr2020-0055-keren-et-al.pdf
Tipologia: Versione editoriale (versione pubblicata con il layout dell'editore)
Licenza: Creative commons
Dimensione 517.66 kB
Formato Adobe PDF
517.66 kB Adobe PDF

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11573/1708682
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 1
  • ???jsp.display-item.citation.isi??? 0
social impact