Hybrid planning & scheduling

2 abstract1

[1]  Bart Selman,et al.  Planning as Satisfiability , 1992, ECAI.

[2]  Andrea Omicini,et al.  An Object-oriented Approach to Planning -extended Abstract , 2007 .

[3]  Jeroen Groenendijk,et al.  Dynamic predicate logic , 1991 .

[4]  David E. Wilkins,et al.  A Call for Knowledge-Based Planning , 2001, AI Mag..

[5]  John McCarthy,et al.  SOME PHILOSOPHICAL PROBLEMS FROM THE STANDPOINT OF ARTI CIAL INTELLIGENCE , 1987 .

[6]  Manuela M. Veloso,et al.  FLECS: Planning with a Flexible Commitment Strategy , 1995, J. Artif. Intell. Res..

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

[8]  Qiang Yang,et al.  ON THE IMPLEMENTATION AND EVALUATION OF AbTweak , 1996, Comput. Intell..

[9]  Edwin P. D. Pednault,et al.  ADL: Exploring the Middle Ground Between STRIPS and the Situation Calculus , 1989, KR.

[10]  Ronen I. Brafman,et al.  Partial-Order Planning with Concurrent Interacting Actions , 2011, J. Artif. Intell. Res..

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

[12]  D. McDermott.  PDDL2.1 - The Art of the Possible? Commentary on Fox and Long , 2003, J. Artif. Intell. Res..

[13]  Hector J. Levesque,et al.  Reasoning about Concurrent Execution Prioritized Interrupts, and Exogenous Actions in the Situation Calculus , 1997, IJCAI.

[14]  Subbarao Kambhampati,et al.  Planning as Refinement Search: A Unified Framework for Evaluating Design Tradeoffs in Partial-Order Planning , 1995, Artif. Intell..

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

[16]  Mark S. Boddy.  Imperfect Match: PDDL 2.1 and Real Applications , 2003, J. Artif. Intell. Res..

[17]  Amedeo Cesta,et al.  Gaining efficiency and flexibility in the simple temporal problem , 1996, Proceedings Third International Workshop on Temporal Representation and Reasoning (TIME '96).

[18]  Malik Ghallab,et al.  IxTeT: an integrated approach for plan generation and scheduling , 1995, Proceedings 1995 INRIA/IEEE Symposium on Emerging Technologies and Factory Automation. ETFA'95.

[19]  Eva Onaindia,et al.  A Temporal Planning System for Time-Optimal Planning , 2001, EPIA.

[20]  David Chapman,et al.  Planning for Conjunctive Goals , 1987, Artif. Intell..

[21]  Neil Yorke-Smith,et al.  Exploiting the Structure of Hierarchical Plans in Temporal Constraint Propagation , 2005, AAAI.

[22]  Drew McDermott,et al.  A Temporal Logic for Reasoning About Processes and Plans , 1982, Cogn. Sci..

[23]  Lenhart K. Schubert,et al.  Accelerating Partial-Order Planners: Some Techniques for Effective Search Control and Pruning , 1996, J. Artif. Intell. Res..

[24]  Dana S. Nau,et al.  Computer Bridge - A Big Win for AI Planning , 1998, AI Mag..

[25]  Derek Long,et al.  Plan Constraints and Preferences in PDDL3 , 2006 .

[26]  Steven Minton,et al.  Total-Order and Partial-Order Planning: A Comparative Analysis , 1994, J. Artif. Intell. Res..

[27]  Witold Lukaszewicz,et al.  Reasoning about Plans , 1997, IJCAI.

[28]  Fausto Giunchiglia,et al.  A Theory of Abstraction , 1992, Artif. Intell..

[29]  David E. Smith,et al.  The Perils of Discrete Resource Models , 2007 .

[30]  Francesco Ricci,et al.  Interactive Case-Based Planning for Forest Fire Management , 2000, Applied Intelligence.

[31]  Nils J. Nilsson,et al.  A Formal Basis for the Heuristic Determination of Minimum Cost Paths , 1968, IEEE Trans. Syst. Sci. Cybern..

[32]  Penny Nii.  The blackboard model of problem solving , 1986 .

[33]  S. Edelkamp,et al.  Engineering Benchmarks for Planning: the Domains Used in the Deterministic Part of IPC-4 , 2006, J. Artif. Intell. Res..

[34]  David W. Aha,et al.  HICAP: An Interactive Case-Based Planning Architecture and its Application to Noncombatant Evacuation Operations , 1999, AAAI/IAAI.

[35]  Raymond Reiter,et al.  Natural Actions, Concurrency and Continuous Time in the Situation Calculus , 1996, KR.

[36]  Subbarao Kambhampati,et al.  Sapa: A Multi-objective Metric Temporal Planner , 2003, J. Artif. Intell. Res..

[37]  Nicholas R. Jennings,et al.  Pitfalls of agent-oriented development , 1998, AGENTS '98.

[38]  James F. McKenzie.  Planning, Scheduling and Constraint Satisfaction: From Theory to Practice , 2005 .

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

[40]  Kutluhan Erol,et al.  Hierarchical task network planning: formalization, analysis, and implementation , 1996 .

[41]  Fausto Giunchiglia,et al.  Intelligent Planning: A Decomposition and Abstraction Based Approach to Classical Planning , 1999, Artif. Intell..

[42]  Diego Calvanese,et al.  Structured Objects: Modeling and Reasoning , 1995, DOOD.

[43]  Richard Fikes,et al.  Design and Implementation of the CALO Query Manager , 2006, AAAI.

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

[45]  Brian Drabble,et al.  Associating AI Planner Entities with an Underlying Time Point Network , 1991, EWSP.

[46]  Austin Tate,et al.  Open planning, scheduling and constraint management architectures , 1995 .

[47]  Steve Chien,et al.  Hierarchical task network and operator-based planning: two complementary approaches to real-world planning , 2001 .

[48]  Jeff Orkin,et al.  Three States and a Plan: The A.I. of F.E.A.R. , 2006 .

[49]  James A. Hendler,et al.  UM Translog: a planning domain for the development and benchmarking of planning systems , 1995 .

[50]  Alex Fukunaga,et al.  ASPEN: A Framework for Automated Planning and Scheduling of Spacecraft Control and Operations , 1997 .

[51]  Éric Jacopin.  A Theoretical Analysis of the “ Uselessness ” of White Knights , 1992 .

[52]  Dawn E. Wilkins.  Using the SIPE-2 Planning System: A Manual for SIPE-2 , 1999 .

[53]  Subbarao Kambhampati,et al.  Replanning: a New Perspective , 2005 .

[54]  Manuela M. Veloso,et al.  Lazy Incremental Learning of Control Knowledge for Efficiently Obtaining Quality Plans , 1997, Artificial Intelligence Review.

[55]  J. Köbler,et al.  The Graph Isomorphism Problem: Its Structural Complexity , 1993 .

[56]  Ralph Johnson,et al.  design patterns elements of reusable object oriented software , 2019 .

[57]  C. A. R. HOARE,et al.  An axiomatic basis for computer programming , 1969, CACM.

[58]  Subbarao Kambhampati,et al.  A comparative analysis of partial order planning and task reduction planning , 1995, SGAR.

[59]  Leslie Lamport,et al.  The temporal logic of actions , 1994, TOPL.

[60]  Subbarao Kambhampati,et al.  When is Temporal Planning Really Temporal? , 2007, IJCAI.

[61]  Fausto Giunchiglia,et al.  Using Abstrips Abstractions -- Where do We Stand? , 1999, Artificial Intelligence Review.

[62]  Jörg Hoffmann,et al.  FF: The Fast-Forward Planning System , 2001, AI Mag..

[63]  C. Cordell Green,et al.  Application of Theorem Proving to Problem Solving , 1969, IJCAI.

[64]  Wolfgang Emmerich,et al.  Engineering Distributed Objects , 2000, Lecture Notes in Computer Science.

[65]  Richard E. Korf,et al.  Artificial Intelligence Search Algorithms , 1999, Algorithms and Theory of Computation Handbook.

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

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

[68]  Austin Tate,et al.  O-Plan: a Common Lisp Planning Web Service , 2003 .

[69]  Miguel A. Salido,et al.  Scheduling in a Planning Environment , 2000, PuK.

[70]  Derek Long,et al.  A Temporal Planning System for Durative Actions of PDDL2.1 , 2002, ECAI.

[71]  Qiang Yang,et al.  Formalizing planning knowledge for hierarchical planning , 1990, Comput. Intell..

[72]  Peter Brucker,et al.  Scheduling Algorithms , 1995 .

[73]  Cristina Sernadas,et al.  Object Specification Logic , 1995, J. Log. Comput..

[74]  Lluís Vila,et al.  A Survey on Temporal Reasoning in Artificial Intelligence , 1994, AI Communications.

[75]  Peter Norvig,et al.  A modern, agent-oriented approach to introductory artificial intelligence , 1995, SGAR.

[76]  Craig A. Knoblock.  Automatically Generating Abstractions for Planning , 1994, Artif. Intell..

[77]  S. Biundo,et al.  Semantic Web Technology as a Basis for Planning and Scheduling Systems , 2006 .

[78]  Richard Fikes,et al.  Learning and Executing Generalized Robot Plans , 1993, Artif. Intell..

[79]  Craig A. Knoblock,et al.  Composing, optimizing, and executing plans for bioinformatics web services , 2005, The VLDB Journal.

[80]  Bernd Schattenberg,et al.  Dealing with Continuous Resources in AI Planning , 2004 .

[81]  Maria Fox,et al.  An Investigation into the Expressive Power of PDDL2.1 , 2004, ECAI.

[82]  Kristian J. Hammond,et al.  Case-based planning: A framework for planning from experience ☆ , 1990 .

[83]  T. L. McCluskey.  PDDL: A language with a purpose? , 2003 .

[84]  Jörg Hoffmann,et al.  On Reasonable and Forced Goal Orderings and their Use in an Agenda-Driven Planning Algorithm , 2000, J. Artif. Intell. Res..

[85]  Volker Haarslev,et al.  Description of the RACER System and its Applications , 2001, Description Logics.

[86]  Dana S. Nau,et al.  Current Trends in Automated Planning , 2007, AI Mag..

[87]  Gerald J. Sussman,et al.  A Computational Model of Skill Acquisition , 1973 .

[88]  Thorsten Liebig,et al.  Combining FIPA ACL With DAML + OIL – A Case Study Agent Communication with CIA , FIPA ACL and Techniques of the Semantic Web , 2002 .

[89]  Ivan Serina,et al.  An Approach to Temporal Planning and Scheduling in Domains with Predictable Exogenous Events , 2011, J. Artif. Intell. Res..

[90]  S. Edelkamp,et al.  The Deterministic Part of IPC-4: An Overview , 2005, J. Artif. Intell. Res..

[91]  Craig A. Knoblock,et al.  PDDL-the planning domain definition language , 1998 .

[92]  Håkan L. S. Younes,et al.  VHPOP: Versatile Heuristic Partial Order Planner , 2003, J. Artif. Intell. Res..

[93]  Rachid Alami,et al.  Multi-robot cooperation in the MARTHA project , 1998, IEEE Robotics Autom. Mag..

[94]  Bernhard Nebel,et al.  Reasoning about temporal relations: a maximal tractable subclass of Allen's interval algebra , 1994, JACM.

[95]  Susanne Biundo-Stephan,et al.  On the Construction and Evaluation of Flexible Plan-Refinement Strategies , 2007, KI.

[96]  Michael Georgeff,et al.  Reasoning about actions and plans , 1986 .

[97]  Anthony Barrett,et al.  Partial-Order Planning: Evaluating Possible Efficiency Gains , 1994, Artificial Intelligence.

[98]  Lenhart K. Schubert,et al.  Accelerating partial order planners by improving plan and goal choices , 1995, Proceedings of 7th IEEE International Conference on Tools with Artificial Intelligence.

[99]  M. Fox,et al.  The 3rd International Planning Competition: Results and Analysis , 2003, J. Artif. Intell. Res..

[100]  Dan Wu,et al.  UM-Translog-2: A Planning Domain Designed for AIPS-2002 , 2002 .

[101]  Susanne Biundo,et al.  Present-Day Deductive Planning , 1994 .

[102]  Sheila A. McIlraith,et al.  Simulation, verification and automated composition of web services , 2002, WWW.

[103]  Edmund H. Durfee,et al.  Theory for Coordinating Concurrent Hierarchical Planning Agents Using Summary Information , 1999, AAAI/IAAI.

[104]  Mark S. Fox,et al.  Intelligent Scheduling , 1998 .

[105]  Susanne Biundo-Stephan,et al.  Plan Repair in Hybrid Planning , 2008, KI.

[106]  Philip W. L. Fong,et al.  Design Patterns for Planning Systems , 1998 .

[107]  Henry A. Kautz,et al.  Reasoning about plans , 1991, Morgan Kaufmann series in representation and reasoning.

[108]  Randall W. Hill,et al.  Automated generation of tracking plans for a network of communications antennas , 1997, 1997 IEEE Aerospace Conference.

[109]  Patrik Haslum.  Quality of solutions to IPC5 benchmark problems: Preliminary results , 2007 .

[110]  Subbarao Kambhampati,et al.  On the Nature and Role of Modal Truth Criteria in Planning , 1996, Artif. Intell..

[111]  Malte Helmert,et al.  Understanding Planning Tasks: Domain Complexity and Heuristic Decomposition , 2008, Lecture Notes in Computer Science.

[112]  Gerhard Lakemeyer,et al.  A Situation-Calculus Semantics for an Expressive Fragment of PDDL , 2007, AAAI.

[113]  Earl D. Sacerdott.  Planning in a hierarchy of abstraction spaces , 1973, IJCAI 1973.

[114]  P. Pandurang Nayak,et al.  Remote Agent: To Boldly Go Where No AI System Has Gone Before , 1998, Artif. Intell..

[115]  Blai Bonet,et al.  Planning as heuristic search , 2001, Artif. Intell..

[116]  Andreas Weigl,et al.  Hybrid Planning Using Flexible Strategies , 2005, KI.

[117]  Howard W. Beck.  The Management of Job-Shop Scheduling Constraints in TOSCA , 1993 .

[118]  A. R. Lingard,et al.  Planning Parallel Actions , 1998, Artif. Intell..

[119]  David E. Wilkins,et al.  Can AI planners solve practical problems? , 1990, Comput. Intell..

[120]  Amedeo Cesta,et al.  Recent Advances in AI Planning , 1997, Lecture Notes in Computer Science.

[121]  Juan Fdez-Olivares,et al.  A flexible temporal planner ? , 2002 .

[122]  T. L. McCluskey,et al.  Object-centred planning: lifting classical planning from the literal level to the object level , 1996, Proceedings Eighth IEEE International Conference on Tools with Artificial Intelligence.

[123]  Susanne Biundo-Stephan,et al.  A Unifying Framework for Hybrid Planning and Scheduling , 2006, KI.

[124]  Stephen F. Smith,et al.  A Constraint-Based Method for Project Scheduling with Time Windows , 2002, J. Heuristics.

[125]  Nils J. Nilsson,et al.  Principles of Artificial Intelligence , 1980, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[126]  Joachim Hertzberg,et al.  Advances in Plan-Based Control of Robotic Agents , 2003, Lecture Notes in Computer Science.

[127]  Lenhart K. Schubert,et al.  Efficient Algorithms for Qualitative Reasoning about Time , 1995, Artif. Intell..

[128]  Mark A. Peot,et al.  Threat-Removal Strategies for Partial-Order Planning , 1993, AAAI.

[129]  Chitta Baral,et al.  Reasoning About Effects of Concurrent Actions , 1997, J. Log. Program..

[130]  Philippe Laborie,et al.  Algorithms for propagating resource constraints in AI planning and scheduling: Existing approaches and new results , 2003, Artif. Intell..

[131]  Antonio González Muñoz,et al.  A hybrid hierarchical operator-based planning approach for the design of control programs , 2000, PuK.

[132]  Diego Calvanese,et al.  The Description Logic Handbook: Theory, Implementation, and Applications , 2003, Description Logic Handbook.

[133]  Richard Fikes,et al.  STRIPS: A New Approach to the Application of Theorem Proving to Problem Solving , 1971, IJCAI.

[134]  Peter van Beek,et al.  Exact and approximate reasoning about temporal relations 1 , 1990, Comput. Intell..

[135]  Alfonso Gerevini,et al.  Combining Domain-Independent Planning and HTN Planning: The Duet Planner , 2008, ECAI.

[136]  Dana Nau,et al.  Integrating electrical and mechanical design and process planning , 1997 .

[137]  Paolo Traverso,et al.  Automated planning - theory and practice , 2004 .

[138]  Austin Tate,et al.  INTERPLAN: a Plan Generation System Which Can Deal With Interactions Between Goals , 1974 .

[139]  David Leake,et al.  Integrating CBR components within a Case-Based Planner , 1998 .

[140]  Daniel S. Weld.  An Introduction to Least Commitment Planning , 1994, AI Mag..

[141]  T. L. McCluskey,et al.  A tool-supported approach to engineering HTN planning models , 1998, Proceedings Tenth IEEE International Conference on Tools with Artificial Intelligence (Cat. No.98CH36294).

[142]  Michael Pinedo,et al.  Scheduling: Theory, Algorithms, and Systems , 1994 .

[143]  Mark S. Boddy,et al.  Temporal Reasoning for Planning and Scheduling in Complex Domains: Lessons Learned , 1996 .

[144]  Amedeo Cesta,et al.  A Constraint-Based Architecture for Flexible Support to Activity Scheduling , 2001, AI*IA.

[145]  Jana Koehler,et al.  Planning under Resource Constraints , 1998, ECAI.

[146]  Subbarao Kambhampati,et al.  Refinement Planning as a Unifying Framework for Plan Synthesis , 1997, AI Mag..

[147]  Martha E. Pollack,et al.  Flaw Selection Strategies for Partial-Order Planning , 1997, J. Artif. Intell. Res..

[148]  Richard E. Korf,et al.  Depth-First Iterative-Deepening: An Optimal Admissible Tree Search , 1985, Artif. Intell..

[149]  Albert Jones,et al.  Survey of Job Shop Scheduling Techniques , 1999 .

[150]  Austin Tate,et al.  O-Plan: a Knowledge-Based Planner and its Application to Logistics , 1996 .

[151]  Austin Tate,et al.  Spacecraft Command and control Using AI Planning Techniques. The O-Plan2 Project. , 1992 .

[152]  Hans W. Guesgen,et al.  Spatial and Temporal Reasoning , 2003, AI Commun..

[153]  Fahiem Bacchus,et al.  Using temporal logics to express search control knowledge for planning , 2000, Artif. Intell..

[154]  Rob Sherwood,et al.  ASPEN-Automated Planning and Scheduling for Space Mission Operation , 2000 .

[155]  Maria Fox,et al.  PDDL2.1: An Extension to PDDL for Expressing Temporal Planning Domains , 2003, J. Artif. Intell. Res..