A Unified Framework for Planning in Adversarial and Cooperative Environments

Users of AI systems may rely upon them to produce plans for achieving desired objectives. Such AI systems should be able to compute obfuscated plans whose execution in adversarial situations protects privacy, as well as legible plans which are easy for team members to understand in cooperative situations. We develop a unified framework that addresses these dual problems by computing plans with a desired level of comprehensibility from the point of view of a partially informed observer. For adversarial settings, our approach produces obfuscated plans with observations that are consistent with at least k goals from a set of decoy goals. By slightly varying our framework, we present an approach for producing legible plans in cooperative settings such that the observation sequence projected by the plan is consistent with at most j goals from a set of confounding goals. In addition, we show how the observability of the observer can be controlled to either obfuscate or convey the actions in a plan when the goal is known to the observer. We present theoretical results on the complexity analysis of our approach. We also present an empirical evaluation to show the feasibility and usefulness of our approaches using IPC domains.

[1]  Walter J. Savitch,et al.  Relationships Between Nondeterministic and Deterministic Tape Complexities , 1970, J. Comput. Syst. Sci..

[2]  Avrim Blum,et al.  Fast Planning Through Planning Graph Analysis , 1995, IJCAI.

[3]  Patrik Haslum,et al.  Some Results on the Complexity of Planning with Incomplete Information , 1999, ECP.

[4]  Dawn Xiaodong Song,et al.  Timing Analysis of Keystrokes and Timing Attacks on SSH , 2001, USENIX Security Symposium.

[5]  Latanya Sweeney,et al.  k-Anonymity: A Model for Protecting Privacy , 2002, Int. J. Uncertain. Fuzziness Knowl. Based Syst..

[6]  Subbarao Kambhampati,et al.  Planning graph as the basis for deriving heuristics for plan synthesis by state space and CSP search , 2002, Artif. Intell..

[7]  Jussi Rintanen,et al.  Complexity of Planning with Partial Observability , 2004, ICAPS.

[8]  ASHWIN MACHANAVAJJHALA,et al.  L-diversity: privacy beyond k-anonymity , 2006, 22nd International Conference on Data Engineering (ICDE'06).

[9]  Subbarao Kambhampati,et al.  Domain Independent Approaches for Finding Diverse Plans , 2007, IJCAI.

[10]  Hector Geffner,et al.  Heuristics for Planning with Action Costs Revisited , 2008, ECAI.

[11]  Hector Geffner,et al.  Plan Recognition as Planning , 2009, IJCAI.

[12]  Hector Geffner,et al.  Probabilistic Plan Recognition Using Off-the-Shelf Classical Planners , 2010, AAAI.

[13]  Subbarao Kambhampati,et al.  Generating diverse plans to handle unknown and partially known user preferences , 2012, Artif. Intell..

[14]  Hector Geffner,et al.  Width and Serialization of Classical Planning Problems , 2012, ECAI.

[15]  Siddhartha S. Srinivasa,et al.  Generating Legible Motion , 2013, Robotics: Science and Systems.

[16]  Blai Bonet,et al.  A Concise Introduction to Models and Methods for Automated Planning , 2013, A Concise Introduction to Models and Methods for Automated Planning.

[17]  Daniel Borrajo Multi-agent planning by plan reuse , 2013, AAMAS.

[18]  Blai Bonet,et al.  Belief Tracking for Planning with Sensing: Width, Complexity and Approximations , 2014, J. Artif. Intell. Res..

[19]  Ivan Serina,et al.  A Privacy-preserving Model for the Multi-agent Propositional Planning Problem , 2014, ECAI.

[20]  Erez Karpas,et al.  Goal Recognition Design , 2014, ICAPS.

[21]  Ronen I. Brafman,et al.  A Privacy Preserving Algorithm for Multi-Agent Planning and Search , 2015, IJCAI.

[22]  이화영 X , 1960, Chinese Plants Names Index 2000-2009.

[23]  Erez Karpas,et al.  Goal Recognition Design for Non-Optimal Agents , 2015, AAAI.

[24]  David E. Smith,et al.  A Fast Goal Recognition Technique Based on Interaction Estimates , 2015, IJCAI.

[25]  Erez Karpas,et al.  Privacy Preserving Plans in Partially Observable Environments , 2016, IJCAI.

[26]  Shirin Sohrabi,et al.  Plan Recognition as Planning Revisited , 2016, IJCAI.

[27]  Ping Hou,et al.  Goal Recognition Design with Stochastic Agent Action Outcomes , 2016, IJCAI.

[28]  Erez Karpas,et al.  Goal Recognition Design with Non-Observable Actions , 2016, AAAI.

[29]  Shlomi Maliah,et al.  Stronger Privacy Preserving Projections for Multi-Agent Planning , 2016, ICAPS.

[30]  Yu Zhang,et al.  Explicable Robot Planning as Minimizing Distance from Expected Behavior , 2016, ArXiv.

[31]  Yu Zhang,et al.  Plan explicability and predictability for robot task planning , 2015, 2017 IEEE International Conference on Robotics and Automation (ICRA).

[32]  Yu Zhang,et al.  Plan Explanations as Model Reconciliation: Moving Beyond Explanation as Soliloquy , 2017, IJCAI.

[33]  Ping Hou,et al.  New Metrics and Algorithms for Stochastic Goal Recognition Design Problems , 2017, IJCAI.

[34]  Sebastian Sardiña,et al.  Deceptive Path-Planning , 2017, IJCAI.

[35]  Ross A. Knepper,et al.  Implicit Communication in a Joint Action , 2017, 2017 12th ACM/IEEE International Conference on Human-Robot Interaction (HRI.

[36]  Subbarao Kambhampati,et al.  Explicability versus Explanations in Human-Aware Planning , 2018, AAMAS.

[37]  Daniel Borrajo,et al.  Plan merging by reuse for multi-agent planning , 2019, Applied Intelligence.

[38]  Tsuyoshi Murata,et al.  {m , 1934, ACML.

[39]  Danna Zhou,et al.  d. , 1840, Microbial pathogenesis.