TY - GEN
T1 - Signaling friends and head-faking enemies simultaneously
T2 - 19th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2020
AU - Kulkarni, Anagha
AU - Srivastava, Siddharth
AU - Kambhampati, Subbarao
N1 - Funding Information:
Acknowledgements. This work is supported in part by ONR grants N00014-16-1-2892, N00014-18-1-2442, N00014-18-1-2840, N00014-19-1-2119, AFOSR grant FA9550-18-1-0067, DARPA SAIL-ON grant W911NF-19-2-0006, NSF grants 1936997 (C-ACCEL), 1844325, NASA grant NNX17AD06G, and a JP Morgan AI Faculty Research grant.
Publisher Copyright:
© 2020 International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS). All rights reserved.
PY - 2020
Y1 - 2020
N2 - In order to be useful in the real world, an AI agent needs to plan and act in the presence of other agents, who may be helpful or disruptive. In this paper, we consider the problem where an autonomous agent needs to act in a manner that clarifies its objectives to cooperative agents while simultaneously preventing adversarial agents from inferring those objectives. We call it Mixed-Observer Controlled Observability Planning Problem (mo-copp). We develop two new solution approaches: one provides an optimal solution to the problem given a fixed time horizon by using an integer programming solver, the other provides a satisficing solution using heuristic-guided forward search to achieve prespecified amount of obfuscation and legibility for adversarial and cooperative agents respectively.
AB - In order to be useful in the real world, an AI agent needs to plan and act in the presence of other agents, who may be helpful or disruptive. In this paper, we consider the problem where an autonomous agent needs to act in a manner that clarifies its objectives to cooperative agents while simultaneously preventing adversarial agents from inferring those objectives. We call it Mixed-Observer Controlled Observability Planning Problem (mo-copp). We develop two new solution approaches: one provides an optimal solution to the problem given a fixed time horizon by using an integer programming solver, the other provides a satisficing solution using heuristic-guided forward search to achieve prespecified amount of obfuscation and legibility for adversarial and cooperative agents respectively.
KW - Integer program
KW - Legibility
KW - Obfuscation
KW - Planning
UR - http://www.scopus.com/inward/record.url?scp=85096634442&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85096634442&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:85096634442
T3 - Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS
SP - 1889
EP - 1891
BT - Proceedings of the 19th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2020
A2 - An, Bo
A2 - El Fallah Seghrouchni, Amal
A2 - Sukthankar, Gita
PB - International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS)
Y2 - 19 May 2020
ER -