When is Temporal Planning Really Temporal?
暂无分享,去创建一个
[1] Subbarao Kambhampati,et al. Evaluating Temporal Planning Domains , 2007, ICAPS.
[2] Blai Bonet,et al. A Robust and Fast Action Selection Mechanism for Planning , 1997, AAAI/IAAI.
[3] David Chapman,et al. Planning for Conjunctive Goals , 1987, Artif. Intell..
[4] Mausam,et al. Challenges for Temporal Planning with Uncertain Durations , 2006, ICAPS.
[5] Willard Van Orman Quine,et al. New Foundations for Mathematical Logic , 1937 .
[6] Richard Fikes,et al. STRIPS: A New Approach to the Application of Theorem Proving to Problem Solving , 1971, IJCAI.
[7] Malik Ghallab,et al. Representation and Control in IxTeT, a Temporal Planner , 1994, AIPS.
[8] Nicola Muscettola,et al. Challenges and Methods in Testing the Remote Agent Planner , 2000, AIPS.
[9] Malte Helmert,et al. Decidability and Undecidability Results for Planning with Numerical State Variables , 2002, PuK.
[10] Craig A. Knoblock,et al. Combining the Expressivity of UCPOP with the Efficiency of Graphplan , 1997, ECP.
[11] Patrick J. Hayes,et al. Moments and points in an interval‐based temporal logic , 1989, Comput. Intell..
[12] Nicola Muscettola,et al. Planning in Interplanetary Space: Theory and Practice , 2000, AIPS.
[13] David E. Wilkins,et al. Domain-Independent Planning: Representation and Plan Generation , 1984, Artif. Intell..
[14] Peter Lynds,et al. Zeno's Paradoxes: A Timely Solution , 2003 .
[15] Ivan Serina,et al. Local Search Techniques for Temporal Planning in LPG , 2003, ICAPS.
[16] Maria Fox,et al. VAL: automatic plan validation, continuous effects and mixed initiative planning using PDDL , 2004, 16th IEEE International Conference on Tools with Artificial Intelligence.
[17] Nils J. Nilsson,et al. A Formal Basis for the Heuristic Determination of Minimum Cost Paths , 1968, IEEE Trans. Syst. Sci. Cybern..
[18] Maria Fox,et al. Utilizing Automatically Inferred Invariants in Graph Construction and Search , 2000, AIPS.
[19] Blai Bonet,et al. The AIPS-98 Planning Competition , 2000, AI Mag..
[20] Malte Helmert,et al. The Fast Downward Planning System , 2006, J. Artif. Intell. Res..
[21] Murray Shanahan,et al. The Event Calculus Explained , 1999, Artificial Intelligence Today.
[22] David E. Smith. The Case for Durative Actions: A Commentary on PDDL2.1 , 2003, J. Artif. Intell. Res..
[23] Ivan Serina,et al. An Approach to Temporal Planning and Scheduling in Domains with Predictable Exogenous Events , 2011, J. Artif. Intell. Res..
[24] Dana S. Nau,et al. SHOP2: An HTN Planning System , 2003, J. Artif. Intell. Res..
[25] Rina Dechter,et al. Temporal Constraint Networks , 1989, Artif. Intell..
[26] David E. Smith,et al. Temporal Planning with Mutual Exclusion Reasoning , 1999, IJCAI.
[27] Jörg Hoffmann,et al. On the Instantiation of ADL Operators Involving Arbitrary First-Order Formulas , 2000, PuK.
[28] Maria Fox,et al. Multiple Relaxations in Temporal Planning , 2004, ECAI.
[29] Jörg Hoffmann. Local Search Topology in Planning Benchmarks: A Theoretical Analysis , 2002, PuK.
[30] Jörg Hoffmann,et al. The Metric-FF Planning System: Translating ''Ignoring Delete Lists'' to Numeric State Variables , 2003, J. Artif. Intell. Res..
[31] Thomas A. Henzinger,et al. It's About Time: Real-Time Logics Reviewed , 1998, CONCUR.
[32] Alonzo Church,et al. A formulation of the simple theory of types , 1940, Journal of Symbolic Logic.
[33] Subbarao Kambhampati,et al. Planning graph as the basis for deriving heuristics for plan synthesis by state space and CSP search , 2002, Artif. Intell..
[34] Stefan Edelkamp,et al. Taming Numbers and Durations in the Model Checking Integrated Planning System , 2003, PuK.
[35] Alfredo Gabaldon,et al. Compiling Control Knowledge into Preconditions for Planning in the Situation Calculus , 2003, IJCAI.
[36] Malte Helmert,et al. MIPS: The Model-Checking Integrated Planning System , 2001, AI Mag..
[37] Pravin Varaiya,et al. What's decidable about hybrid automata? , 1995, STOC '95.
[38] Jorge A. Baier,et al. ConGolog, Sin Trans: Compiling ConGolog into Basic Action Theories for Planning and Beyond , 2008, KR.
[39] Brian C. Williams,et al. Generative Planning for Hybrid Systems Based on Flow Tubes , 2008, ICAPS.
[40] A. El-Kholy,et al. Temporal and Resource Reasoning in Planning: the parcPLAN approach , 1996, ECAI.
[41] Patrik Haslum,et al. Extending TALplanner with Concurrency and Resources , 2000, ECAI.
[42] Subbarao Kambhampati,et al. Planning as Refinement Search: A Unified Framework for Evaluating Design Tradeoffs in Partial-Order Planning , 1995, Artif. Intell..
[43] James F. Allen. Maintaining knowledge about temporal intervals , 1983, CACM.
[44] Hector Geffner. Functional strips: a more flexible language for planning and problem solving , 2000 .
[45] Bart Selman,et al. Unifying SAT-based and Graph-based Planning , 1999, IJCAI.
[46] John Levine,et al. O-Plan: A Web-Based AI Planning Agent , 2000, AAAI/IAAI.
[47] Malte Helmert,et al. A Planning Heuristic Based on Causal Graph Analysis , 2004, ICAPS.
[48] Patrik Haslum,et al. Flexible Abstraction Heuristics for Optimal Sequential Planning , 2007, ICAPS.
[49] Austin Tate,et al. The Use of Optimistic and Pessimistic Resource Profiles to Inform Search in an Activity Based Planner , 1994, AIPS.
[50] Malte Helmert,et al. How Good is Almost Perfect? , 2008, AAAI.
[51] Ivan Serina,et al. LPG: A Planner Based on Local Search for Planning Graphs with Action Costs , 2002, AIPS.
[52] Fahiem Bacchus,et al. Planning with Resources and Concurrency: A Forward Chaining Approach , 2001, IJCAI.
[53] Andrew Coles,et al. Planning with Problems Requiring Temporal Coordination , 2008, AAAI.
[54] Mausam,et al. Planning with Durative Actions in Stochastic Domains , 2008, J. Artif. Intell. Res..
[55] Frederic Maris,et al. TLP-GP: New Results on Temporally-Expressive Planning Benchmarks , 2008, 2008 20th IEEE International Conference on Tools with Artificial Intelligence.
[56] Bernhard Nebel,et al. COMPLEXITY RESULTS FOR SAS+ PLANNING , 1995, Comput. Intell..
[57] Andrew Coles,et al. Managing concurrency in temporal planning using planner-scheduler interaction , 2009, Artif. Intell..
[58] Edwin P. D. Pednault,et al. ADL and the State-Transition Model of Action , 1994, J. Log. Comput..
[59] Avrim Blum,et al. Fast Planning Through Planning Graph Analysis , 1995, IJCAI.
[60] Robert P. Goldman,et al. The Evolution of CIRCA, a Theory-Based AI Architecture with Real-Time Performance Guarantees , 2008, AAAI Spring Symposium: Emotion, Personality, and Social Behavior.
[61] Ioannis P. Vlahavas,et al. The GRT Planning System: Backward Heuristic Construction in Forward State-Space Planning , 2001, J. Artif. Intell. Res..
[62] Blai Bonet,et al. Heuristic Search Planner 2.0 , 2001, AI Mag..
[63] Ji-Ae Shin,et al. Processes and continuous change in a SAT-based planner , 2005, Artif. Intell..
[64] Thomas A. Henzinger,et al. A Comparison of Control Problems for Timed and Hybrid Systems , 2002, HSCC.
[65] Jana Koehler,et al. Planning under Resource Constraints , 1998, ECAI.
[66] Amedeo Cesta,et al. A Time and Resource Problem for Planning Architectures , 1997, ECP.
[67] Subbarao Kambhampati,et al. Solving Planning-Graph by Compiling It into CSP , 2000, AIPS.
[68] Tom Bylander,et al. The Computational Complexity of Propositional STRIPS Planning , 1994, Artif. Intell..
[69] L. Kaelbling,et al. Learning with Deictic Representation , 2002 .
[70] Gerald J. Sussman,et al. A Computational Model of Skill Acquisition , 1973 .
[71] Pierre Wolper,et al. Simple on-the-fly automatic verification of linear temporal logic , 1995, PSTV.
[72] Subbarao Kambhampati,et al. Scaling up Planning by Teasing out Resource Scheduling , 1999, ECP.
[73] Qiang Yang,et al. Formalizing planning knowledge for hierarchical planning , 1990, Comput. Intell..
[74] Jussi Rintanen,et al. Planning via Petri Net Unfolding , 2007, IJCAI.
[75] James F. Allen. Planning as Temporal Reasoning , 1991, KR.
[76] Jussi Rintanen. Complexity of Concurrent Temporal Planning , 2007, ICAPS.
[77] Frederick P. Brooks. The Mythical Man-Month: After 20 years , 1995 .
[78] Ioannis P. Vlahavas,et al. Heuristic Planning with Resources , 2000, ECAI.
[79] Bernhard Nebel,et al. On the Compilability and Expressive Power of Propositional Planning Formalisms , 1998, J. Artif. Intell. Res..
[80] Daniel S. Weld,et al. UCPOP: A Sound, Complete, Partial Order Planner for ADL , 1992, KR.
[81] Maria Fox,et al. Exploiting a Graphplan Framework in Temporal Planning , 2003, ICAPS.
[82] Sylvie Thiébaux,et al. Concurrent Probabilistic Planning in the Graphplan Framework , 2006, ICAPS.
[83] Maria Fox,et al. An Investigation into the Expressive Power of PDDL2.1 , 2004, ECAI.
[84] Subbarao Kambhampati,et al. Improving Temporal Flexibility of Position Constrained Metric Temporal Plans , 2003, ICAPS.
[85] Jeremy Frank,et al. Constraint-Based Attribute and Interval Planning , 2003, Constraints.
[86] Gregory J. Chaitin,et al. On the Simplicity and Speed of Programs for Computing Infinite Sets of Natural Numbers , 1969, J. ACM.
[87] Subbarao Kambhampati,et al. Planning Graph as a (Dynamic) CSP: Exploiting EBL, DDB and other CSP Search Techniques in Graphplan , 2000, J. Artif. Intell. Res..
[88] Bart Selman,et al. Stochastic Search and Phase Transitions: AI Meets Physics , 1995, IJCAI.
[89] Steven Minton,et al. Total-Order and Partial-Order Planning: A Comparative Analysis , 1994, J. Artif. Intell. Res..
[90] A. Church. An Unsolvable Problem of Elementary Number Theory , 1936 .
[91] Raymond Reiter,et al. Natural Actions, Concurrency and Continuous Time in the Situation Calculus , 1996, KR.
[92] Subbarao Kambhampati,et al. Sapa: A Multi-objective Metric Temporal Planner , 2003, J. Artif. Intell. Res..
[93] Bernhard Nebel. Compilation Schemes: A Theoretical Tool for Assessing the Expressive Power of Planning Formalisms , 1999, KI.
[94] Drew McDermott. Reasoning about Autonomous Processes in an Estimated-Regression Planner , 2003, ICAPS.
[95] David H. Wolpert,et al. No free lunch theorems for optimization , 1997, IEEE Trans. Evol. Comput..
[96] Rob Sherwood,et al. ASPEN-Automated Planning and Scheduling for Space Mission Operation , 2000 .
[97] Rina Dechter,et al. The Optimality of A* Revisited , 1983, AAAI.
[98] Ari K. Jónsson,et al. MAPGEN: Mixed-Initiative Planning and Scheduling for the Mars Exploration Rover Mission , 2004, IEEE Intell. Syst..
[99] Maria Fox,et al. PDDL2.1: An Extension to PDDL for Expressing Temporal Planning Domains , 2003, J. Artif. Intell. Res..
[100] Hector Geffner,et al. Heuristic Planning with Time and Resources , 2014 .
[101] Hector Geffner. PDDL 2.1: Representation vs. Computation , 2003, J. Artif. Intell. Res..
[102] Maria Fox,et al. CRIKEY - a temporal planner looking at the integration of scheduling and planning , 2004 .
[103] Terry L. Zimmerman,et al. Learning-Assisted Automated Planning: Looking Back, Taking Stock, Going Forward , 2003, AI Mag..
[104] Austin Tate,et al. O-Plan: The open Planning Architecture , 1991, Artif. Intell..
[105] Yixin Chen,et al. Temporal Planning using Subgoal Partitioning and Resolution in SGPlan , 2006, J. Artif. Intell. Res..
[106] Thomas A. Henzinger,et al. Beyond HYTECH: Hybrid Systems Analysis Using Interval Numerical Methods , 2000, HSCC.
[107] Mark S. Boddy,et al. Course of Action Generation for Cyber Security Using Classical Planning , 2005, ICAPS.
[108] Steven A. Vere,et al. Planning in Time: Windows and Durations for Activities and Goals , 1983, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[109] Daniel S. Weld,et al. Temporal Planning with Continuous Change , 1994, AAAI.
[110] Craig A. Knoblock. Automatically Generating Abstractions for Planning , 1994, Artif. Intell..
[111] Patrik Haslum,et al. New Admissible Heuristics for Domain-Independent Planning , 2005, AAAI.
[112] Daniel S. Weld,et al. The LPSAT Engine & Its Application to Resource Planning , 1999, IJCAI.
[113] Patrik Haslum,et al. Deterministic planning in the fifth international planning competition: PDDL3 and experimental evaluation of the planners , 2009, Artif. Intell..
[114] James A. Hendler,et al. Complexity results for HTN planning , 1994, Annals of Mathematics and Artificial Intelligence.
[115] Bernhard Nebel,et al. The FF Planning System: Fast Plan Generation Through Heuristic Search , 2011, J. Artif. Intell. Res..
[116] Christer Bäckström. Computational Aspects of Reordering Plans , 1998, J. Artif. Intell. Res..
[117] Hector Geffner,et al. Unifying the Causal Graph and Additive Heuristics , 2008, ICAPS.
[118] Vladimir Lifschitz,et al. ON THE SEMANTICS OF STRIPS , 1987 .
[119] Gerald J. Sussman,et al. Scheme: A Interpreter for Extended Lambda Calculus , 1998, High. Order Symb. Comput..
[120] Håkan L. S. Younes,et al. VHPOP: Versatile Heuristic Partial Order Planner , 2003, J. Artif. Intell. Res..
[121] Patrik Haslum. Improving Heuristics Through Relaxed Search - An Analysis of TP4 and HSP*a in the 2004 Planning Competition , 2006, J. Artif. Intell. Res..
[122] Subbarao Kambhampati,et al. Reviving Partial Order Planning , 2001, IJCAI.
[123] Mausam,et al. Probabilistic Temporal Planning with Uncertain Durations , 2006, AAAI.
[124] David A. McAllester,et al. Systematic Nonlinear Planning , 1991, AAAI.
[125] Edsger W. Dijkstra,et al. On the teaching of programming, i. e. on the teaching of thinking , 1975, Language Hierarchies and Interfaces.
[126] Edsger W. Dijkstra,et al. A note on two problems in connexion with graphs , 1959, Numerische Mathematik.
[127] Hector Geffner,et al. Branching and pruning: An optimal temporal POCL planner based on constraint programming , 2004, Artif. Intell..
[128] S. Kambhampati,et al. Optiplan: Unifying IP-based and Graph-based Planning , 2005, J. Artif. Intell. Res..
[129] Jorge A. Baier,et al. Exploiting Procedural Domain Control Knowledge in State-of-the-Art Planners , 2007, ICAPS.
[130] Richard M. Karp,et al. Combinatorics, complexity, and randomness , 1986, CACM.
[131] A. Robinson. Non-standard analysis , 1966 .
[132] David P. Miller,et al. Hierarchical planning involving deadlines, travel time, and resources , 1988, Comput. Intell..
[133] Paul Graham. On LISP: Advanced Techniques for Common LISP , 1993 .