TY - GEN
T1 - On Verifying and Generating Robust Plans for Planning Tasks with Exogenous Events
AU - Chrpa, Lukáš
AU - Karpas, Erez
N1 - Publisher Copyright: © 2024 Proceedings of the International Conference on Knowledge Representation and Reasoning. All rights reserved.
PY - 2024
Y1 - 2024
N2 - Planning and acting under the presence of exogenous events brings a number of challenges as events might modify the environment without the consent of the acting agent. Consequently, the agent’s plan might get disrupted, agent’s goals might no longer be achievable, or, worse, the agent might suffer some damage (e.g. damage to the robot). Although policies, mapping states to appropriate actions to take, can describe, in theory, how the agent should act, they might be difficult to explain and understand for humans in the loop. In this paper, we describe the concept of robust plans that are sequences of actions that can be successfully executed regardless of event occurrence. Robust plans are easier to understand (than policies). We present two methods for verifying whether a sequence of actions is a robust plan, one based on compilation to classical planning, and the other based on leveraging delete-relaxation. We also present a method for generating robust plans that is derived from the “relaxation” verification method. The methods are evaluated on three domains.
AB - Planning and acting under the presence of exogenous events brings a number of challenges as events might modify the environment without the consent of the acting agent. Consequently, the agent’s plan might get disrupted, agent’s goals might no longer be achievable, or, worse, the agent might suffer some damage (e.g. damage to the robot). Although policies, mapping states to appropriate actions to take, can describe, in theory, how the agent should act, they might be difficult to explain and understand for humans in the loop. In this paper, we describe the concept of robust plans that are sequences of actions that can be successfully executed regardless of event occurrence. Robust plans are easier to understand (than policies). We present two methods for verifying whether a sequence of actions is a robust plan, one based on compilation to classical planning, and the other based on leveraging delete-relaxation. We also present a method for generating robust plans that is derived from the “relaxation” verification method. The methods are evaluated on three domains.
UR - http://www.scopus.com/inward/record.url?scp=85214683584&partnerID=8YFLogxK
M3 - منشور من مؤتمر
T3 - Proceedings of the International Conference on Knowledge Representation and Reasoning
SP - 273
EP - 283
BT - Proceedings of the 21st International Conference on Principles of Knowledge Representation and Reasoning, KR 2024
A2 - Marquis, Pierre
A2 - Ortiz, Magdalena
A2 - Pagnucco, Maurice
T2 - 21st International Conference on Principles of Knowledge Representation and Reasoning, KR 2024
Y2 - 2 November 2024 through 8 November 2024
ER -