TY - CHAP
T1 - Towards the disruption of plans
AU - Voinitchi, Andrada
AU - Black, Elizabeth
AU - Luck, Michael
PY - 2015/11/7
Y1 - 2015/11/7
N2 - In order for an agent or a group of agents (such as a team) to achieve a goal, a sequence of actions have to be performed. These actions bring about state transitions that constitute a plan. Multiple ways of achieving the goal may exist. In some situations, one may want to prevent or delay an agent or group of agents from achieving a goal. We argue that plans can be disrupted by preventing particular state transitions from happening. We propose four algorithms to identify which state transitions should be thwarted such that the achievement of the goal is prevented (total disruption) or delayed (partial disruption). In order to evaluate the performance of our algorithms we define disruption (partial and total) and also provide metrics for its measurement. We do acknowledge that the disruptor may not always have an accurate representation of the disruptee’s plans. Thus, we perform an experimental analysis to examine the performance of the algorithms when some of the state transitions available to the disruptee are unknown to the disruptor.
AB - In order for an agent or a group of agents (such as a team) to achieve a goal, a sequence of actions have to be performed. These actions bring about state transitions that constitute a plan. Multiple ways of achieving the goal may exist. In some situations, one may want to prevent or delay an agent or group of agents from achieving a goal. We argue that plans can be disrupted by preventing particular state transitions from happening. We propose four algorithms to identify which state transitions should be thwarted such that the achievement of the goal is prevented (total disruption) or delayed (partial disruption). In order to evaluate the performance of our algorithms we define disruption (partial and total) and also provide metrics for its measurement. We do acknowledge that the disruptor may not always have an accurate representation of the disruptee’s plans. Thus, we perform an experimental analysis to examine the performance of the algorithms when some of the state transitions available to the disruptee are unknown to the disruptor.
UR - http://www.scopus.com/inward/record.url?scp=84951042624&partnerID=8YFLogxK
U2 - 10.1007/978-3-319-25420-3_15
DO - 10.1007/978-3-319-25420-3_15
M3 - Chapter
AN - SCOPUS:84951042624
SN - 9783319254197
VL - LNAI 9372
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 233
EP - 250
BT - Coordination, Organizations, Institutions, and Norms in Agent Systems X
PB - Springer-Verlag Berlin Heidelberg
T2 - 10th International Conference on Coordination, Organizations, Institutions and Norms in Agent Systems, COIN 2014
Y2 - 6 May 2016 through 6 May 2016
ER -