Group planning with time constraints

Embedding planning systems in real-world domains has led to the necessity of Distributed Continual Planning (DCP) systems where planning activities are distributed across multiple agents and plan generation may occur concurrently with plan execution. A key challenge in DCP systems is how to coordinate activities for a group of planning agents. This problem is compounded when these agents are situated in a real-world dynamic domain where the agents often encounter differing, incomplete, and possibly inconsistent views of their environment. To date, DCP systems have only focused on cases where agents’ behavior is designed to optimize a global plan. In contrast, this paper presents a temporal reasoning mechanism for self-interested planning agents. To do so, we model agents’ behavior based on the Belief-Desire-Intention (BDI) theoretical model of cooperation, while modeling dynamic joint plans with group time constraints through creating hierarchical abstraction plans integrated with temporal constraints network. The contribution of this paper is threefold: (i) the BDI model specifies a behavior for self interested agents working in a group, permitting an individual agent to schedule its activities in an autonomous fashion, while taking into consideration temporal constraints of its group members; (ii) abstract plans allow the group to plan a joint action without explicitly describing all possible states in advance, making it possible to reduce the number of states which need to be considered in a BDI-based approach; and (iii) a temporal constraints network enables each agent to reason by itself about the best time for scheduling activities, making it possible to reduce coordination messages among a group. The mechanism ensures temporal consistency of a cooperative plan, enables the interleaving of planning and execution at both individual and group levels. We report on how the mechanism was implemented within a commercial training and simulation application, and present empirical evidence of its effectiveness in real-life scenarios and in reducing communication to coordinate group members’ activities.

[1]  David J. Musliner,et al.  CIRCA: a cooperative intelligent real-time control architecture , 1993, IEEE Trans. Syst. Man Cybern..

[2]  Héctor Muñoz-Avila,et al.  SHOP and M-SHOP: Planning with Ordered Task Decomposition , 2000 .

[3]  Austin Tate,et al.  O-Plan: The open Planning Architecture , 1991, Artif. Intell..

[4]  Henry A. Kautz,et al.  Constraint Propagation Algorithms for Temporal Reasoning , 1986, AAAI.

[5]  Yixin Chen,et al.  Temporal Planning using Subgoal Partitioning and Resolution in SGPlan , 2006, J. Artif. Intell. Res..

[6]  Sarit Kraus,et al.  A Mechanism for Temporal Reasoning by Collaborative Agents , 2001, CIA.

[7]  Guillermo Ricardo Simari,et al.  Multiagent systems: a modern approach to distributed artificial intelligence , 2000 .

[8]  Makoto Yokoo,et al.  Distributed Constraint Satisfaction: Foundations of Cooperation in Multi-agent Systems , 2000 .

[9]  David Sarne,et al.  Coordinated Exploration with a Shared Goal in Costly Environments , 2012, ECAI.

[10]  Makoto Yokoo,et al.  Distributed Constraint Satisfaction , 2000, Springer Series on Agent Technology.

[11]  Dana S. Nau,et al.  SHOP2: An HTN Planning System , 2003, J. Artif. Intell. Res..

[12]  Erann Gat,et al.  Exploiting known topologies to navigate with low-computation sensing , 1991, Other Conferences.

[13]  Drew McDermott,et al.  Planning and Acting , 1978, Cogn. Sci..

[14]  Makoto Yokoo,et al.  An approach to over-constrained distributed constraint satisfaction problems: distributed hierarchical constraint satisfaction , 2000, Proceedings Fourth International Conference on MultiAgent Systems.

[15]  Edmund H. Durfee,et al.  Distributed Problem Solving and Planning , 2001, EASSS.

[16]  Brian C. Williams,et al.  ROBUST DISTRIBUTED COORDINATION OF HETEROGENEOUS ROBOTS THROUGH TEMPORAL PLAN NETWORKS , 2005 .

[17]  Rajiv T. Maheswaran,et al.  Centralized, Distributed or Something Else? Making Timely Decisions in Multi-Agent Systems , 2007, AAAI.

[18]  Nicholas R. Jennings,et al.  Controlling Cooperative Problem Solving in Industrial Multi-Agent Systems Using Joint Intentions , 1995, Artif. Intell..

[19]  James F. Allen Towards a General Theory of Action and Time , 1984, Artif. Intell..

[20]  Drew McDermott,et al.  Temporal Data Base Management , 1987, Artif. Intell..

[21]  Alexander Nareyek A Planning Model for Agents in Dynamic and Uncertain Real-Time Environments* , 1998 .

[22]  Ya'akov Gal,et al.  Incorporating helpful behavior into collaborative planning , 2009, AAMAS.

[23]  Edmund H. Durfee,et al.  Evaluating hybrid constraint tightening for scheduling agents , 2009, AAMAS.

[24]  Nikos I. Karacapilidis,et al.  Planning Under Uncertainty: A Qualitative Approach , 1995, EPIA.

[25]  Edmund H. Durfee,et al.  A Survey of Research in Distributed, Continual Planning , 1999, AI Mag..

[26]  Sarit Kraus,et al.  The Evolution of Sharedplans , 1999 .

[27]  Robert T. Effinger,et al.  Enabling Fast Flexible Planning through Incremental Temporal Reasoning with Conflict Extraction , 2005, ICAPS.

[28]  Steve A. Chien,et al.  Automating Planning and Scheduling of Shuttle Payload Operations , 1999, Artificial Intelligence.

[29]  Berthe Y. Choueiry,et al.  Improving Backtrack Search for Solving the TCSP , 2003, CP.

[30]  Makoto Yokoo,et al.  Distributed Partial Constraint Satisfaction Problem , 1997, CP.

[31]  David J. Musliner,et al.  World Modeling for the Dynamic Construction of Real-Time Control Plans , 1995, Artif. Intell..

[32]  Daniel S. Weld,et al.  Temporal Planning with Continuous Change , 1994, AAAI.

[33]  Gil Tidhar,et al.  Planned Team Activity , 1992, MAAMAW.

[34]  Makoto Yokoo,et al.  Adopt: asynchronous distributed constraint optimization with quality guarantees , 2005, Artif. Intell..

[35]  Mathijs de Weerdt,et al.  P3C: A New Algorithm for the Simple Temporal Problem , 2008, ICAPS.

[36]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[37]  C HendersonThomas,et al.  Arc and path consistence revisited , 1986 .

[38]  Terry L. Zimmerman,et al.  Distributed coordination of mobile agent teams: the advantage of planning ahead , 2010, AAMAS.

[39]  Xin-She Yang,et al.  Introduction to Algorithms , 2021, Nature-Inspired Optimization Algorithms.

[40]  Amy L. Lansky,et al.  Scope and Abstraction: Two Criteria for Localized Planning , 1995, IJCAI.

[41]  Victor R. Lesser,et al.  Effective Variants of the Max-Sum Algorithm for Radar Coordination and Scheduling , 2011, 2011 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology.

[42]  Nicola Muscettola,et al.  Dynamic Control Of Plans With Temporal Uncertainty , 2001, IJCAI.

[43]  Michael R. M. Jenkin,et al.  A taxonomy for multi-agent robotics , 1996, Auton. Robots.

[44]  Evan Sultanik,et al.  On Modeling Multiagent Task Scheduling as a Distributed Constraint Optimization Problem , 2007, IJCAI.

[45]  Victor R. Lesser,et al.  Using cooperative mediation to solve distributed constraint satisfaction problems , 2004, Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems, 2004. AAMAS 2004..

[46]  James F. Allen Maintaining knowledge about temporal intervals , 1983, CACM.

[47]  Thomas C. Henderson,et al.  Arc and Path Consistency Revisited , 1986, Artif. Intell..

[48]  Julie A. Shah,et al.  Fast Distributed Multi-agent Plan Execution with Dynamic Task Assignment and Scheduling , 2009, ICAPS.

[49]  Hiroaki Kitano,et al.  RoboCup Rescue: a grand challenge for multi-agent systems , 2000, Proceedings Fourth International Conference on MultiAgent Systems.

[50]  Manolis Koubarakis,et al.  Backtracking algorithms for disjunctions of temporal constraints , 1998, Artif. Intell..

[51]  Rajiv T. Maheswaran,et al.  Criticality Metrics for Distributed Plan and Schedule Management , 2008, ICAPS.

[52]  A. El-Kholy,et al.  Temporal and Resource Reasoning in Planning: the parcPLAN approach , 1996, ECAI.

[53]  Edmund H. Durfee,et al.  Distributed algorithms for solving the multiagent temporal decoupling problem , 2011, AAMAS.

[54]  Ya'akov Gal,et al.  Temporal Reasoning for a Collaborative Planning Agent in a Dynamic Environment , 2003, Annals of Mathematics and Artificial Intelligence.

[55]  Marie desJardins,et al.  Controlling Communication in Distributed Planning Using Irrelevance Reasoning , 1998, AAAI/IAAI.

[56]  Milind Tambe,et al.  Towards Flexible Teamwork , 1997, J. Artif. Intell. Res..

[57]  Edmund H. Durfee,et al.  A Distributed Approach to Summarizing Spaces of Multiagent Schedules , 2012, AAAI.

[58]  Peter van Beek,et al.  Reasoning About Qualitative Temporal Information , 1990, Artif. Intell..

[59]  Sarit Kraus,et al.  Collaborative Plans for Complex Group Action , 1996, Artif. Intell..

[60]  Victor R. Lesser,et al.  Evolution of the GPGP/TÆMS Domain-Independent Coordination Framework , 2002, AAMAS '02.

[61]  Malik Ghallab,et al.  Dealing with Uncertain Durations In Temporal Constraint Networks dedicated to Planning , 1996, ECAI.

[62]  John D. Lowrance,et al.  Planning and reacting in uncertain and dynamic environments , 1995, J. Exp. Theor. Artif. Intell..

[63]  Katia P. Sycara,et al.  Exploiting Problem Structure for Distributed Constraint Optimization , 1995, ICMAS.

[64]  David E. Smith,et al.  Extending Graphplan to handle uncertainty and sensing actions , 1998, AAAI 1998.

[65]  Paolo Traverso,et al.  Automated Planning: Theory & Practice , 2004 .

[66]  Luke Hunsberger,et al.  Distributing the control of a temporal network among multiple agents , 2003, AAMAS '03.

[67]  Nicholas R. Jennings,et al.  Resource-aware junction trees for efficient multi-agent coordination , 2011, AAMAS.

[68]  Bradley J. Clement,et al.  Continual coordination through shared activities , 2003, AAMAS '03.

[69]  Ugo Montanari,et al.  Networks of constraints: Fundamental properties and applications to picture processing , 1974, Inf. Sci..

[70]  Sarit Kraus,et al.  Exchanging and Combining Temporal Information in a Cooperative Environment , 2002, CIA.

[71]  Mathijs de Weerdt,et al.  Incrementally Solving STNs by Enforcing Partial Path Consistency , 2010, ICAPS.

[72]  Gal A. Kaminka,et al.  Integration of Coordination Mechanisms in the BITE Multi-Robot Architecture , 2007, Proceedings 2007 IEEE International Conference on Robotics and Automation.

[73]  Thierry Vidal,et al.  Handling contingency in temporal constraint networks: from consistency to controllabilities , 1999, J. Exp. Theor. Artif. Intell..

[74]  Robert C. Kohout The DARPA COORDINATORS program: A retrospective , 2011, 2011 International Conference on Collaboration Technologies and Systems (CTS).

[75]  Edmund H. Durfee,et al.  Partial global planning: a coordination framework for distributed hypothesis formation , 1991, IEEE Trans. Syst. Man Cybern..

[76]  Gerhard Weiss,et al.  Multiagent systems: a modern approach to distributed artificial intelligence , 1999 .

[77]  Rajiv T. Maheswaran,et al.  Multi-agent systems for the real world , 2009, AAMAS.

[78]  Avi Rosenfeld,et al.  ADAPT: Abstraction Hierarchies to Better Simulate Teamwork under Dynamics , 2011, AEGS.

[79]  David Sarne,et al.  Determining the value of information for collaborative multi-agent planning , 2012, Autonomous Agents and Multi-Agent Systems.

[80]  Terry L. Zimmerman,et al.  Distributed management of flexible times schedules , 2007, AAMAS '07.

[81]  Daniel D. Corkill,et al.  Hierarchical Planning in a Distributed Environment , 1979, IJCAI.

[82]  Matthias Klusch,et al.  Intelligent Information Agents , 1999, Springer Berlin Heidelberg.

[83]  Rina Dechter,et al.  Temporal Constraint Networks , 1989, Artif. Intell..

[84]  Sarit Kraus,et al.  Planning and Acting Together , 1999, AI Mag..

[85]  Victor R. Lesser,et al.  Solving distributed constraint optimization problems using cooperative mediation , 2004, Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems, 2004. AAMAS 2004..

[86]  Bernard Muschielok,et al.  The 4MOST instrument concept overview , 2014, Astronomical Telescopes and Instrumentation.

[87]  Giuseppe F. Italiano,et al.  Experimental analysis of dynamic all pairs shortest path algorithms , 2004, SODA '04.

[88]  Sarit Kraus,et al.  SharedPlans in Electronic Commerce , 1999 .

[89]  Julie A. Shah,et al.  Fast Dynamic Scheduling of Disjunctive Temporal Constraint Networks through Incremental Compilation , 2008, ICAPS.

[90]  Milind Tambe,et al.  The Communicative Multiagent Team Decision Problem: Analyzing Teamwork Theories and Models , 2011, J. Artif. Intell. Res..

[91]  James A. Hendler,et al.  HTN Planning: Complexity and Expressivity , 1994, AAAI.

[92]  Barry Richards,et al.  parcPlan: A Planning Architecture with Parallel Actions, Resources and Constraints , 1994, ISMIS.

[93]  Alexander Nareyek,et al.  Open World Planning as SCSP , 2000 .

[94]  Rémi Monasson,et al.  Determining computational complexity from characteristic ‘phase transitions’ , 1999, Nature.