Efficient bdd-based planning for non-deterministic, fault-tolerant, and adversarial domains
暂无分享,去创建一个
[1] Blai Bonet,et al. Planning as Heuristic Search: New Results , 1999, ECP.
[2] Jeffrey S. Rosenschein,et al. Incomplete Information and Deception in Multi-Agent Negotiation , 1991, IJCAI.
[3] Peter Norvig,et al. Artificial Intelligence: A Modern Approach , 1995 .
[4] Paolo Traverso,et al. Strong Planning in Non-Deterministic Domains Via Model Checking , 1998, AIPS.
[5] Tsuneo Nakata,et al. Forward model checking techniques oriented to buggy designs , 1997, 1997 Proceedings of IEEE International Conference on Computer Aided Design (ICCAD).
[6] Malte Helmert,et al. Exhibiting Knowledge in Planning Problems to Minimize State Encoding Length , 1999, ECP.
[7] Malte Helmert,et al. On the Implementation of MIPS , 2000 .
[8] David E. Wilkins,et al. Practical planning - extending the classical AI planning paradigm , 1989, Morgan Kaufmann series in representation and reasoning.
[9] Blai Bonet,et al. A Robust and Fast Action Selection Mechanism for Planning , 1997, AAAI/IAAI.
[10] Alan S. Willsky,et al. Output stabilizability of discrete-event dynamic systems , 1991 .
[11] Ingo Wegener,et al. Branching Programs and Binary Decision Diagrams , 1987 .
[12] Nicholas Kushmerick,et al. An Algorithm for Probabilistic Planning , 1995, Artif. Intell..
[13] Marco Pistore,et al. Weak, strong, and strong cyclic planning via symbolic model checking , 2003, Artif. Intell..
[14] Jaime G. Carbonell,et al. Counterplanning: A Strategy-Based Model of Adversary Planning in Real-World Situations , 1981, Artif. Intell..
[15] Earl D. Sacerdoti,et al. The Nonlinear Nature of Plans , 1975, IJCAI.
[16] Paolo Traverso,et al. Automatic OBDD-Based Generation of Universal Plans in Non-Deterministic Domains , 1998, AAAI/IAAI.
[17] Richard Fikes,et al. STRIPS: A New Approach to the Application of Theorem Proving to Problem Solving , 1971, IJCAI.
[18] Frank Reffel,et al. OBDDs in Heuristic Search , 1998, KI.
[19] David Wilkins,et al. Using Patterns and Plans in Chess , 1980, Artif. Intell..
[20] Blai Bonet,et al. The AIPS-98 Planning Competition , 2000, AI Mag..
[21] Peter Haddawy,et al. Decision-theoretic Refinement Planning Using Inheritance Abstraction , 1994, AIPS.
[22] Michel Barbeau,et al. Planning Control Rules for Reactive Agents , 1997, Artif. Intell..
[23] Allen Newell,et al. Report on a general problem-solving program , 1959, IFIP Congress.
[24] Manuela M. Veloso,et al. A Formalization of Equilibria for Multiagent Planning , 2003, IJCAI.
[25] Reid G. Simmons,et al. From Livingstone to SMV , 2000, FAABS.
[26] Bernhard Nebel,et al. The FF Planning System: Fast Plan Generation Through Heuristic Search , 2011, J. Artif. Intell. Res..
[27] David E. Smith,et al. Extending Graphplan to handle uncertainty and sensing actions , 1998, AAAI 1998.
[28] Gerard J. Holzmann,et al. The Model Checker SPIN , 1997, IEEE Trans. Software Eng..
[29] Stéphane Lafortune,et al. Active diagnosis of discrete event systems , 1997, Proceedings of the 36th IEEE Conference on Decision and Control.
[30] Piergiorgio Bertoli,et al. Solving Power Supply Restoration Problems with Planning via Symbolic Model Checking , 2002, ECAI.
[31] S. Edelkamp,et al. Deterministic State Space Planning with BDDs , 1999 .
[32] Enrico Giunchiglia,et al. Representing Action: Indeterminacy and Ramifications , 1997, Artif. Intell..
[33] F. Somenzi,et al. To split or to conjoin: the question in image computation , 2000, Proceedings 37th Design Automation Conference.
[34] Manuela M. Veloso,et al. SetA*: an efficient BDD-based heuristic search algorithm , 2002, AAAI/IAAI.
[35] Steffen Hölldobler,et al. Solving the Entailment Problem in the Fluent Calculus Using Binary Decision Diagrams , 2000, Computational Logic.
[36] R. Rudell. Dynamic variable ordering for ordered binary decision diagrams , 1993, Proceedings of 1993 International Conference on Computer Aided Design (ICCAD).
[37] Brian C. Williams,et al. Diagnosing Multiple Faults , 1987, Artif. Intell..
[38] Randal E. Bryant,et al. Efficient implementation of a BDD package , 1991, DAC '90.
[39] Manuela M. Veloso,et al. Planning and Learning by Analogical Reasoning , 1994, Lecture Notes in Computer Science.
[40] Piergiorgio Bertoli,et al. Planning in Nondeterministic Domains under Partial Observability via Symbolic Model Checking , 2001, IJCAI.
[41] Zhengzhu Feng,et al. Symbolic Heuristic Search Using Decision Diagrams , 2002, SARA.
[42] Edwin P. D. Pednault,et al. ADL: Exploring the Middle Ground Between STRIPS and the Situation Calculus , 1989, KR.
[43] Rolf Drechsler,et al. Exact channel routing using symbolic representation , 1999, ISCAS'99. Proceedings of the 1999 IEEE International Symposium on Circuits and Systems VLSI (Cat. No.99CH36349).
[44] David L. Dill,et al. Validation with guided search of the state space , 1998, Proceedings 1998 Design and Automation Conference. 35th DAC. (Cat. No.98CH36175).
[45] Jörg Hoffmann,et al. Local Search Topology in Planning Benchmarks: An Empirical Analysis , 2001, IJCAI.
[46] Jørn Lind-Nielsen,et al. BuDDy : A binary decision diagram package. , 1999 .
[47] PlanningFrameworkRune M. Jensen,et al. OBDD-based Deterministic Planning using the UMOP , 2000 .
[48] Eugene Fink,et al. Integrating planning and learning: the PRODIGY architecture , 1995, J. Exp. Theor. Artif. Intell..
[49] Howard Wong-Toi,et al. Symbolic Synthesis of Supervisory Controllers , 1992, 1992 American Control Conference.
[50] Christoph Meinel,et al. A new partitioning scheme for improvement of image computation , 2001, Proceedings of the ASP-DAC 2001. Asia and South Pacific Design Automation Conference 2001 (Cat. No.01EX455).
[51] Fausto Giunchiglia,et al. Planning via Model Checking: A Decision Procedure for AR , 1997, ECP.
[52] Fausto Giunchiglia,et al. Planning with Failure , 1994, AIPS.
[53] Karen Zita Haigh,et al. Planning, Execution and Learning in a Robotic Agent , 1998, AIPS.
[54] Zhengzhu Feng,et al. Symbolic LAO* Search for Factored Markov Decision Processes , 2002, AAAI 2002.
[55] Wolfgang Kunz,et al. An exact algorithm for solving difficult detailed routing problems , 2001, ISPD '01.
[56] Avrim Blum,et al. Fast Planning Through Planning Graph Analysis , 1995, IJCAI.
[57] Richard S. Sutton,et al. Reinforcement Learning: An Introduction , 1998, IEEE Trans. Neural Networks.
[58] Jayaram Bhasker,et al. A VHDL primer , 1995 .
[59] Wang Yi,et al. UPPAAL - a Tool Suite for Automatic Verification of Real-Time Systems , 1996, Hybrid Systems.
[60] James L. Peterson,et al. Petri Nets , 1977, CSUR.
[61] Gordon I. McCalla,et al. Error Detection and Recovery in a Dynamic Planning Environment , 1982, AAAI.
[62] Stephan Merz,et al. Model Checking , 2000 .
[63] Jussi Rintanen,et al. Constructing Conditional Plans by a Theorem-Prover , 1999, J. Artif. Intell. Res..
[64] Mark A. Peot,et al. Conditional nonlinear planning , 1992 .
[65] Fahiem Bacchus,et al. AIPS 2000 Planning Competition: The Fifth International Conference on Artificial Intelligence Planning and Scheduling Systems , 2001 .
[66] Jayaram Bhasker. A Verilog HDL Primer , 1997 .
[67] Jesse Hoey,et al. SPUDD: Stochastic Planning using Decision Diagrams , 1999, UAI.
[68] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .
[69] Frank Reffel,et al. Error Detection with Directed Symbolic Model Checking , 1999, World Congress on Formal Methods.
[70] J. Bhasker. A Verilog HDL Primer, Second Edition , 1999 .
[71] Ansgar Fehnker,et al. Scheduling a steel plant with timed automata , 1999, Proceedings Sixth International Conference on Real-Time Computing Systems and Applications. RTCSA'99 (Cat. No.PR00306).
[72] Reid G. Simmons,et al. Real-Time Search in Non-Deterministic Domains , 1995, IJCAI.
[73] Jesfis Peral,et al. Heuristics -- intelligent search strategies for computer problem solving , 1984 .
[74] A. Michel,et al. Lyapunov Stability of a Class of Discrete Event Systems , 1991 .
[75] T. S. Perraju,et al. Specifying fault tolerance in mission critical systems , 1996, Proceedings. IEEE High-Assurance Systems Engineering Workshop (Cat. No.96TB100076).
[76] Prof. Dr. Christoph Meinel,et al. Algorithms and Data Structures in VLSI Design , 1998, Springer Berlin Heidelberg.
[77] Ivar Jacobson,et al. The Unified Modeling Language User Guide , 1998, J. Database Manag..
[78] Daniel S. Weld,et al. UCPOP: A Sound, Complete, Partial Order Planner for ADL , 1992, KR.
[79] Robin Milner,et al. Handbook of Theoretical Computer Science (Vol. B) , 1990 .
[80] Paolo Traverso,et al. Strong Cyclic Planning Revisited , 1999, ECP.
[81] David H. D. Warren,et al. Generating Conditional Plans and Programs , 1976, AISB.
[82] Matthew L. Ginsberg,et al. Universal Planning: An (Almost) Universally Bad Idea , 1989, AI Mag..
[83] Michael P. Georgeff,et al. Communication and interaction in multi-agent planning , 1983, AAAI 1983.
[84] Olivier Coudert,et al. A Performance Study of BDD-Based Model Checking , 1998, FMCAD.
[85] Ariel Rubinstein,et al. A Course in Game Theory , 1995 .
[86] Andrew W. Moore,et al. Generalization in Reinforcement Learning: Safely Approximating the Value Function , 1994, NIPS.
[87] Edmund M. Clarke,et al. Symbolic Model Checking with Partitioned Transistion Relations , 1991, VLSI.
[88] Raja Sengupta,et al. Diagnosability of discrete-event systems , 1995, IEEE Trans. Autom. Control..
[89] Richard E. Korf,et al. Real-Time Heuristic Search: First Results , 1987, AAAI.
[90] Henry A. Kautz,et al. State-space Planning by Integer Optimization , 1999, AAAI/IAAI.
[91] Stefan Edelkamp,et al. Directed explicit model checking with HSF-SPIN , 2001, SPIN '01.
[92] Herbert Wehlan,et al. Systematic Design Of A Protective Controller In Process Industries By Means Of The Boolean Different , 1996 .
[93] Kristian J. Hammond,et al. Case-Based Planning: Viewing Planning as a Memory Task , 1989 .
[94] Klaus Havelund,et al. Model checking programs , 2000, Proceedings ASE 2000. Fifteenth IEEE International Conference on Automated Software Engineering.
[95] Manuela M. Veloso,et al. Guided Symbolic Universal Planning , 2003, ICAPS.
[96] Kenneth L. McMillan,et al. Symbolic model checking , 1992 .
[97] R. Senjen,et al. Hybrid expert systems for monitoring and fault diagnosis , 1993, Proceedings of 9th IEEE Conference on Artificial Intelligence for Applications.
[98] P. Pandurang Nayak,et al. A Model-Based Approach to Reactive Self-Configuring Systems , 1996, AAAI/IAAI, Vol. 2.
[99] John D. Lowrance,et al. Planning and reacting in uncertain and dynamic environments , 1995, J. Exp. Theor. Artif. Intell..
[100] Brian C. Williams,et al. Model-based programming of intelligent embedded systems and robotic space explorers , 2003, Proc. IEEE.
[101] Rina Dechter,et al. Generalized best-first search strategies and the optimality of A* , 1985, JACM.
[102] Kristian J. Hammond,et al. Explaining and Repairing Plans that Fail , 1987, IJCAI.
[103] Jong-Tae Lim,et al. Synthesis of fault-tolerant supervisor for automated manufacturing systems: a case study on photolithographic process , 1998, IEEE Trans. Robotics Autom..
[104] Fred Kröger,et al. Temporal Logic of Programs , 1987, EATCS Monographs on Theoretical Computer Science.
[105] M. Fourman. Propositional Planning , 2000 .
[106] Stefan Edelkamp,et al. Directed Symbolic Exploration in AI-Planning , 2001 .
[107] Thomas A. Henzinger,et al. Trading Probability for Fairness , 2002, CSL.
[108] Stéphane Lafortune,et al. Failure diagnosis using discrete event models , 1994, Proceedings of 1994 33rd IEEE Conference on Decision and Control.
[109] Subbarao Kambhampati,et al. Extracting Effective and Admissible State Space Heuristics from the Planning Graph , 2000, AAAI/IAAI.
[110] M. Veloso,et al. OBDD-Based Optimistic and Strong Cyclic Adversarial Planning , 2014 .
[111] Bernhard Nebel,et al. Extending Planning Graphs to an ADL Subset , 1997, ECP.
[112] Earl D. Sacerdott. Planning in a hierarchy of abstraction spaces , 1973, IJCAI 1973.
[113] P. Pandurang Nayak,et al. Remote Agent: To Boldly Go Where No AI System Has Gone Before , 1998, Artif. Intell..
[114] Richard E. Korf,et al. Depth-First Iterative-Deepening: An Optimal Admissible Tree Search , 1985, Artif. Intell..
[115] Bart Selman,et al. Pushing the Envelope: Planning, Propositional Logic and Stochastic Search , 1996, AAAI/IAAI, Vol. 2.
[116] Kavita Ravi,et al. Symbolic guided search for CTL model checking , 2000, Proceedings 37th Design Automation Conference.
[117] Thomas A. Henzinger,et al. Concurrent omega-regular games , 2000, Proceedings Fifteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.99CB36332).
[118] S. Edelkamp. Symbolic Exploration in Two-Player Games: Preliminary Results , 2002 .
[119] Manuela M. Veloso,et al. Linkability: Examining Causal Link Commitments in Partial-order Planning , 1994, AIPS.
[120] W. M. Wonham,et al. Decentralized fault diagnosis for discrete-event systems , 2000 .
[121] Randal E. Bryant,et al. Synthesis of Fault Tolerant Plans for Non-Deterministic Domains , 2003 .
[122] Mario Dal Cin,et al. Verifying fault-tolerant behavior of state machines , 1997, Proceedings 1997 High-Assurance Engineering Workshop.
[123] Reid G. Simmons,et al. Optimizing Symbolic Model Checking for Constraint-Rich Models , 1999, CAV.
[124] Mordechai Ben-Ari,et al. The temporal logic of branching time , 1981, POPL '81.
[125] Anthony Barrett,et al. Partial-Order Planning: Evaluating Possible Efficiency Gains , 1994, Artificial Intelligence.
[126] Luciano Lavagno,et al. Disjunctive partitioning and partial iterative squaring: an effective approach for symbolic traversal of large circuits , 1997, DAC.
[127] P. Ramadge,et al. Supervisory control of a class of discrete event processes , 1987 .
[128] M.P. Georgeff,et al. Procedural knowledge , 1986, Proceedings of the IEEE.
[129] Bart Selman,et al. Unifying SAT-based and Graph-based Planning , 1999, IJCAI.
[130] 강문설. [서평]「The Unified Modeling Language User Guide」 , 1999 .
[131] Olivier Coudert,et al. Verification of Synchronous Sequential Machines Based on Symbolic Execution , 1989, Automatic Verification Methods for Finite State Systems.
[132] Randal E. Bryant,et al. An Efficient BDD-Based A* Algorithm , 2002 .
[133] Jai Srinivasan,et al. Branching time temporal logic , 1988, REX Workshop.
[134] Thomas G. Dietterich. What is machine learning? , 2020, Archives of Disease in Childhood.
[135] Craig A. Knoblock,et al. PDDL-the planning domain definition language , 1998 .
[136] Alexander Bockmayr,et al. Mixed Integer Programming Models for Planning Problems , 1998 .
[137] Allen Newell,et al. Chess-Playing Programs and the Problem of Complexity , 1958, IBM J. Res. Dev..
[138] Amir Pnueli,et al. Symbolic Controller Synthesis for Discrete and Timed Systems , 1994, Hybrid Systems.
[139] R. I. Bahar,et al. Algebraic decision diagrams and their applications , 1993, Proceedings of 1993 International Conference on Computer Aided Design (ICCAD).
[140] Lenhart K. Schubert,et al. Inferring State Constraints for Domain-Independent Planning , 1998, AAAI/IAAI.
[141] Daniel S. Weld,et al. Probabilistic Planning with Information Gathering and Contingent Execution , 1994, AIPS.
[142] R. M. Jensen. Eecient Bdd-based Search for Planning Thesis Proposal , 2007 .
[143] Fahiem Bacchus,et al. Using temporal logic to control search in a forward chaining planner , 1996 .
[144] Jian Shen,et al. On Combining Formal and Informal Verification , 1997, CAV.
[145] Manuela M. Veloso,et al. OBDD-based Universal Planning for Synchronized Agents in Non-Deterministic Domains , 2000, J. Artif. Intell. Res..
[146] Nicholas R. Jennings,et al. Controlling Cooperative Problem Solving in Industrial Multi-Agent Systems Using Joint Intentions , 1995, Artif. Intell..
[147] Randal E. Bryant,et al. Graph-Based Algorithms for Boolean Function Manipulation , 1986, IEEE Transactions on Computers.
[148] Edmund H. Durfee,et al. Coordination of distributed problem solvers , 1988 .
[149] Robert P. Goldman,et al. Expressive Planning and Explicit Knowledge , 1996, AIPS.
[150] Marcel Schoppers,et al. Universal Plans for Reactive Robots in Unpredictable Environments , 1987, IJCAI.
[151] Dana S. Nau,et al. Total-Order Multi-Agent Task-Network Planning for Contract Bridge , 1996, AAAI/IAAI, Vol. 1.
[152] Alex Groce,et al. Heuristic Model Checking for Java Programs , 2002, SPIN.
[153] S. Balemi,et al. Supervisory control of a rapid thermal multiprocessor , 1993, IEEE Trans. Autom. Control..
[154] L. Shapley,et al. Stochastic Games* , 1953, Proceedings of the National Academy of Sciences.
[155] Marco Roveri,et al. Conformant Planning via Symbolic Model Checking , 2000, J. Artif. Intell. Res..
[156] David A. McAllester,et al. Systematic Nonlinear Planning , 1991, AAAI.
[157] Jie Chen,et al. Robust Model-Based Fault Diagnosis for Dynamic Systems , 1998, The International Series on Asian Studies in Computer and Information Science.
[158] Richard J. Doyle,et al. Determining the Loci of Anomalies Using Minimal Causal Models , 1995, IJCAI.
[159] E. Clarke,et al. Symbolic Model Checking : IO * ’ States and Beyond * , 1992 .
[160] Tom Bylander,et al. Complexity Results for Serial Decomposability , 1992, AAAI.