Constraint-Based Agents-An Architecture for Constraint-Based Modeling and Local-Search-Based Reasoni

Using Global Constraints for Local Search.- Structural Constraint Satisfaction.- The Planning Model.- Application.- Conclusion.- Future Work.- Internet Links.- The "Send More Money" Problem.- Choice Randomization.- Ensuring the Satisfaction of Structural Constraints.

[1]  Bart Selman,et al.  Evidence for Invariants in Local Search , 1997, AAAI/IAAI.

[2]  Craig A. Knoblock,et al.  Planning by Rewriting: E ciently Generating High-Quality Plans , 1999 .

[3]  Hector Muñoz-Avila,et al.  SHOP: Simple Hierarchical Ordered Planner , 1999, IJCAI.

[4]  Antonis C. Kakas,et al.  A Simple Declarative Language for Describing Narratives With Actions , 1997, J. Log. Program..

[5]  Ulrich Junker,et al.  Preference-Based Search for Scheduling , 2000, AAAI/IAAI.

[6]  Rodney A. Brooks,et al.  A Robust Layered Control Syste For A Mobile Robot , 2022 .

[7]  Alessandro Saffiotti,et al.  Anchoring Symbols to Sensor Data: Preliminary Report , 2000, AAAI/IAAI.

[8]  Jitendra Malik,et al.  Reasoning in Time and Space , 1983, IJCAI.

[9]  Reiko Heckel,et al.  Graph Grammars with Negative Application Conditions , 1996, Fundam. Informaticae.

[10]  Alexander Nareyek,et al.  Constraint-Based Agents , 2001, Lecture Notes in Computer Science.

[11]  Austin Tate,et al.  The Use of Optimistic and Pessimistic Resource Profiles to Inform Search in an Activity Based Planner , 1994, AIPS.

[12]  Dana S. Nau,et al.  On the Use of Integer Programming Models in AI Planning , 1999, IJCAI.

[13]  Toby Walsh,et al.  Towards an Understanding of Hill-Climbing Procedures for SAT , 1993, AAAI.

[14]  Hector Muñoz-Avila,et al.  Case-Based Planning: Selected Methods and Systems , 1996, AI Commun..

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

[16]  Henry A. Kautz,et al.  State-space Planning by Integer Optimization , 1999, AAAI/IAAI.

[17]  Alexander Nareyek.  Using global constraints for local search , 1998, Constraint Programming and Large Scale Discrete Optimization.

[18]  Brian Falkenhainer,et al.  Dynamic Constraint Satisfaction Problems , 1990, AAAI.

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

[20]  Luca Maria Gambardella,et al.  Ant Algorithms for Discrete Optimization , 1999, Artificial Life.

[21]  David Warren,et al.  Warplan: a system for generating plans , 1974 .

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

[23]  Harald Meyer auf'm Hofe.  Finding Regions for Local Repair in Partial Constraint Satisfaction , 1998, KI.

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

[25]  Andrew G. Barto,et al.  Learning to Act Using Real-Time Dynamic Programming , 1995, Artif. Intell..

[26]  Wpm Wim Nuijten,et al.  Time and resource constrained scheduling : a constraint satisfaction approach , 1994 .

[27]  Christian Bessiere,et al.  Using Inference to Reduce Arc Consistency Computation , 1995, IJCAI.

[28]  Jun Gu,et al.  Efficient local search for very large-scale satisfiability problems , 1992, SGAR.

[29]  Peter van Beek,et al.  A Theoretical Evaluation of Selected Backtracking Algorithms , 1995, IJCAI.

[30]  Jorg Homann.  A Heuristic for Domain Independent Planning and Its Use in an Enforced Hill-Climbing Algorithm , 2000 .

[31]  Ronen I. Brafman,et al.  Planning with Concurrent Interacting Actions , 1997, AAAI/IAAI.

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

[33]  Peter van Beek,et al.  CPlan: A Constraint Programming Approach to Planning , 1999, AAAI/IAAI.

[34]  Ben Resner,et al.  Virtual Petz: A Hybrid Approach to Creating Autonomous, Lifelike Dogz and Catz. , 1998 .

[35]  Douglas B. Moran,et al.  The Open Agent Architecture: A Framework for Building Distributed Software Systems , 1999, Appl. Artif. Intell..

[36]  Eugene C. Freuder,et al.  Configuration as Composite Constraint Satisfaction , 1996 .

[37]  Oren Etzioni,et al.  Omnipotence Without Omniscience: Efficient Sensor Management for Planning , 1994, AAAI.

[38]  Michel Gendreau,et al.  A Constraint Programming Framework for Local Search Methods , 1999, J. Heuristics.

[39]  Kagan Tumer,et al.  Collective Intelligence and Braess' Paradox , 2000, AAAI/IAAI.

[40]  Richard Waldinger,et al.  Achieving several goals simultaneously , 1977 .

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

[42]  Jeremy Frank.  Learning Short-Term Weights for GSAT , 1997, IJCAI.

[43]  Ion Muslea,et al.  A GENERAL-PURPOSE AI PLANNING SYSTEM BASED ON THE GENETIC PROGRAMMING PARADIGM , 1997 .

[44]  Katsutoshi Hirayama,et al.  Forming Coalitions for Breaking Deadlocks , 1995, ICMAS.

[45]  Monte Zweben,et al.  Scheduling and rescheduling with iterative repair , 1993, IEEE Trans. Syst. Man Cybern..

[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]  Steve A. Chien,et al.  Using Iterative Repair to Automate Planning and Scheduling of Shuttle Payload Operations , 1999, AAAI/IAAI.

[49]  Ralph Gasser,et al.  SOLVING NINE MEN'S MORRIS , 1996, Comput. Intell..

[50]  Alexander Nareyek.  AI Planning in a Constraint Programming Framework , 2000 .

[51]  Patrick Prosser,et al.  HYBRID ALGORITHMS FOR THE CONSTRAINT SATISFACTION PROBLEM , 1993, Comput. Intell..

[52]  V. S. Subrahmanian,et al.  Complexity, Decidability and Undecidability Results for Domain-Independent Planning , 1995, Artif. Intell..

[53]  Richard E. Korf,et al.  Recent Progress in the Design and Analysis of Admissible Heuristic Functions , 2000, AAAI/IAAI.

[54]  Norman M. Sadeh,et al.  Variable and Value Ordering Heuristics for the Job Shop Scheduling Constraint Satisfaction Problem , 1996, Artif. Intell..

[55]  Henry A. Kautz,et al.  BLACKBOX: A New Approach to the Application of Theorem Proving to Problem Solving , 1998 .

[56]  Bart Selman,et al.  Boosting Combinatorial Search Through Randomization , 1998, AAAI/IAAI.

[57]  Nicholas R. Jennings,et al.  Intelligent agents: theory and practice , 1995, The Knowledge Engineering Review.

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

[59]  Alex Fukunaga,et al.  Iterative Repair Planning for Spacecraft Operations Using the Aspen System , 2000 .

[60]  Sam Steel,et al.  Integrating Planning, Execution and Monitoring , 1988, AAAI.

[61]  Alexander Bockmayr,et al.  Mixed Integer Programming Models for Planning Problems , 1998 .

[62]  Eugene C. Freuder,et al.  Dispatchable Execution of Schedules Involving Consumable Resources , 2000, AIPS.

[63]  Alexander Nareyek,et al.  Structural Constraint Satisfaction , 1999 .

[64]  Dale Schuurmans,et al.  Local search characteristics of incomplete SAT procedures , 2000, Artif. Intell..

[65]  Craig A. Knoblock.  Planning, Executing, Sensing, and Replanning for Information Gathering , 1995, IJCAI.

[66]  Hilary Putnam,et al.  A Computing Procedure for Quantification Theory , 1960, JACM.

[67]  John L. Bresina,et al.  Heuristic-Biased Stochastic Sampling , 1996, AAAI/IAAI, Vol. 1.

[68]  James F. Allen,et al.  Actions and Events in Interval Temporal Logic , 1994 .

[69]  Blai Bonet,et al.  A Robust and Fast Action Selection Mechanism for Planning , 1997, AAAI/IAAI.

[70]  Philippe Baptiste,et al.  A Theoretical and Experimental Comparison of Constraint Propagation Techniques for Disjunctive Scheduling , 1995, IJCAI.

[71]  Craig Boutilier,et al.  Decision-Theoretic Planning: Structural Assumptions and Computational Leverage , 1999, J. Artif. Intell. Res..

[72]  Nicholas Kushmerick,et al.  An Algorithm for Probabilistic Planning , 1995, Artif. Intell..

[73]  Daniel S. Weld,et al.  The LPSAT Engine & Its Application to Resource Planning , 1999, IJCAI.

[74]  Subbarao Kambhampati,et al.  Scaling up Planning by Teasing out Resource Scheduling , 1999, ECP.

[75]  Martha E. Pollack,et al.  Passive and active decision postponement in plan generation , 1996 .

[76]  Brian Drabble,et al.  EXCALIBUR: A Program for Planning and Reasoning with Processes , 1993, Artif. Intell..

[77]  Toby Walsh,et al.  The Scaling of Search Cost , 1997, AAAI/IAAI.

[78]  Jean-Charles Régin.  Minimization of the number of breaks in sports scheduling problems using constraint programming , 1998, Constraint Programming and Large Scale Discrete Optimization.

[79]  Oren Etzioni,et al.  An Approach to Planning with Incomplete Information , 1992, KR.

[80]  Erann Gat,et al.  Remote agent prototype for spacecraft autonomy , 1996, Optics & Photonics.

[81]  Eithan Ephrati,et al.  A Cost-Directed Planner: Preliminary Report , 1996, AAAI/IAAI, Vol. 2.

[82]  Earl D. Sacerdoti,et al.  The Nonlinear Nature of Plans , 1975, IJCAI.

[83]  Steve Hanks,et al.  Optimal Planning with a Goal-directed Utility Model , 1994, AIPS.

[84]  Shlomo Zilberstein,et al.  Using Anytime Algorithms in Intelligent Systems , 1996, AI Mag..

[85]  David Joslin,et al.  "Squeaky Wheel" Optimization , 1998, AAAI/IAAI.

[86]  Onn Shehory,et al.  A Planning Component for RETSINA Agents , 1999, ATAL.

[87]  Reiko Heckel,et al.  Ensuring consistency of conditional graph rewriting - a constructive approach , 1995, SEGRAGRA.

[88]  Eric Jacopin,et al.  On the Path from Classical Planning to Arithmetic Constraint Satisfaction , 2003 .

[89]  Alexander Nareyek.  Applying Local Search to Structural Constraint Satisfaction , 1999 .

[90]  John W. Lloyd.  Beyond the Glass Box: Constraints as Objects , 1995 .

[91]  John Funge,et al.  Cognitive modeling: knowledge, reasoning and planning for intelligent characters , 1999, SIGGRAPH.

[92]  Bart Selman,et al.  Pushing the Envelope: Planning, Propositional Logic and Stochastic Search , 1996, AAAI/IAAI, Vol. 2.

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

[94]  Michael Gelfond,et al.  Representing Actions in Extended Logic Programming , 1992, JICSLP.

[95]  Thomas Schiex,et al.  Solution Reuse in Dynamic Constraint Satisfaction Problems , 1994, AAAI.

[96]  Jussi Rintanen,et al.  Numeric State Variables in Constraint-Based Planning , 1999, ECP.

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

[98]  今野 浩,et al.  名著に学ぶ 「Linear Programming and Extensions」George B. Dantzig著 , 1998 .

[99]  Rob Sherwood,et al.  Using Iterative Repair to Improve the Responsiveness of Planning and Scheduling , 2000, AIPS.

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

[101]  Robert P. Goldman,et al.  MACBeth: A Multi-Agent Constraint-Based Planner , 2000 .

[102]  Joseph Weizenbaum,et al.  and Machine , 1977 .

[103]  Eric Pinson,et al.  A Practical Use of Jackson''s Preemptive Schedule for Solving the Job-Shop Problem. Annals of Opera , 1991 .

[104]  Laurence A. Wolsey,et al.  Integer and Combinatorial Optimization , 1988 .

[105]  Chia-Hoang Lee,et al.  Comments on Mohr and Henderson's Path Consistency Algorithm , 1988, Artif. Intell..

[106]  Bart Selman,et al.  Local search strategies for satisfiability testing , 1993, Cliques, Coloring, and Satisfiability.

[107]  Nicola Muscettola,et al.  HSTS: Integrating Planning and Scheduling , 1993 .

[108]  Karen L. Myers.  CPEF: A Continuous Planning and Execution Framework , 1999, AI Mag..

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

[110]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[111]  Joachim P. Walser.  Solving Linear Pseudo-Boolean Constraint Problems with Local Search , 1997, AAAI/IAAI.

[112]  Craig A. Knoblock,et al.  Learning Plan Rewriting Rules , 2000, AIPS.

[113]  S. Chien,et al.  An Empirical Analysis of Local Search on Stochastic Optimization for Planner Strategy Selection , 2000 .

[114]  Gregg Collins,et al.  Planning for Contingencies: A Decision-based Approach , 1996, J. Artif. Intell. Res..

[115]  Austin Tate,et al.  Generating Project Networks , 1977, IJCAI.

[116]  Eugene C. Freuder,et al.  Partial Constraint Satisfaction , 1989, IJCAI.

[117]  Matthew L. Ginsberg,et al.  Limited Discrepancy Search , 1995, IJCAI.

[118]  Grzegorz Rozenberg,et al.  Handbook of Graph Grammars and Computing by Graph Transformations, Volume 1: Foundations , 1997 .

[119]  Ronen I. Brafman,et al.  To Encode or Not to Encode - Linear Planning , 1999, IJCAI.

[120]  Amy L. Lansky,et al.  Reactive Reasoning and Planning , 1987, AAAI.

[121]  Fred W. Glover,et al.  Tabu Search - Part I , 1989, INFORMS J. Comput..

[122]  Amedeo Napoli,et al.  Using Classification in Case-Based Planning , 1996, ECAI.

[123]  Hartmut Ehrig,et al.  Graph-Grammars: An Algebraic Approach , 1973, SWAT.

[124]  Daniel S. Weld,et al.  Planning to Gather Information , 1996, AAAI/IAAI, Vol. 1.

[125]  Stephen F. Smith,et al.  Stochastic Procedures for Generating Feasible Schedules , 1997, AAAI/IAAI.

[126]  Erann Gat,et al.  Experiences with an architecture for intelligent, reactive agents , 1997, J. Exp. Theor. Artif. Intell..

[127]  Dave Cliff,et al.  Creatures: artificial life autonomous software agents for home entertainment , 1997, AGENTS '97.

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

[129]  Daniel S. Weld,et al.  UCPOP: A Sound, Complete, Partial Order Planner for ADL , 1992, KR.

[130]  Rina Dechter,et al.  Enhancement Schemes for Constraint Processing: Backjumping, Learning, and Cutset Decomposition , 1990, Artif. Intell..

[131]  David H. D. Warren,et al.  Generating Conditional Plans and Programs , 1976, AISB.

[132]  Robert P. Goldman,et al.  Conditional Linear Planning , 1994, AIPS.

[133]  Jan Karel Lenstra,et al.  Job Shop Scheduling by Local Search , 1996, INFORMS J. Comput..

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

[135]  Ralph Gasser,et al.  All the Needles in a Haystack: Can Exhaustive Search Overcome Combinatorial Chaos? , 1995, Computer Science Today.

[136]  Alexander Bockmayr,et al.  Branch and Infer: A Unifying Framework for Integer and Finite Domain Constraint Programming , 1998, INFORMS J. Comput..

[137]  Narendra Karmarkar,et al.  A new polynomial-time algorithm for linear programming , 1984, STOC '84.

[138]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[139]  Mark A. Peot,et al.  Conditional nonlinear planning , 1992 .

[140]  Leslie Pack Kaelbling,et al.  Planning under Time Constraints in Stochastic Domains , 1993, Artif. Intell..

[141]  Pascal Van Hentenryck.  Improved CLP Scheduling with Task Intervals , 1994 .

[142]  H. Jaap van den Herik,et al.  GO‐MOKU SOLVED BY NEW SEARCH TECHNIQUES , 1996, Comput. Intell..

[143]  Claude Le Pape,et al.  Implementation of resource constraints in ILOG SCHEDULE: a library for the development of constraint-based scheduling systems , 1994 .

[144]  Austin Tate,et al.  Repairing Plans On-the-fly , 1997 .

[145]  Narendra Jussien,et al.  Local search with constraint propagation and conflict-based heuristics , 2000, Artif. Intell..

[146]  Andrew J. Davenport,et al.  GENET: A Connectionist Architecture for Solving Constraint Satisfaction Problems by Iterative Improvement , 1994, AAAI.

[147]  John E. Laird,et al.  Developing an Artificial Intelligence Engine , 1999 .

[148]  Michael Wooldridge,et al.  A Formal Specification of dMARS , 1997, ATAL.

[149]  James G. SchmolzeDept.  Psiplan: Planning with -forms over Partially Closed Worlds , 1999 .

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

[151]  Eugene C. Freuder,et al.  Anytime algorithms for constraint satisfaction and SAT problems , 1996, SGAR.

[152]  Robert Schrag,et al.  Managing Disjunction for Practical Temporal Reasoning , 1992, KR.

[153]  Malik Ghallab,et al.  Planning with Sharable Resource Constraints , 1995, IJCAI.

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

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

[156]  Hans-Joachim Goltz.  Redundante Constraints und Heuristiken zum effizienten Lösen von Problemen der Ablaufplanung mit CHIP , 1997, WLP.

[157]  Hans-Joachim Goltz,et al.  Reducing Domains for Search in CLP(FD) and Its Application to Job-Shop Scheduling , 1995, CP.

[158]  John N. Hooker,et al.  Optimization and , 2000 .

[159]  Subbarao Kambhampati,et al.  Solving Planning-Graph by Compiling It into CSP , 2000, AIPS.

[160]  John L. Bresina,et al.  Anytime Synthetic Projection: Maximizing the Probability of Goal Satisfaction , 1990, AAAI.

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

[162]  David Chapman,et al.  Pengi: An Implementation of a Theory of Activity , 1987, AAAI.

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

[164]  Michela Milano,et al.  The Benefits of Global Constraints for the Integration of Constraint Programming and Integer Programming , 2000 .

[165]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[166]  Ivan Serina,et al.  Fast Planning through Greedy Action Graphs , 1999, AAAI/IAAI.

[167]  Eugene Fink,et al.  Integrating planning and learning: the PRODIGY architecture , 1995, J. Exp. Theor. Artif. Intell..

[168]  Christian Freksa,et al.  Temporal Reasoning Based on Semi-Intervals , 1992, Artif. Intell..

[169]  Daniel S. Weld,et al.  Probabilistic Planning with Information Gathering and Contingent Execution , 1994, AIPS.

[170]  Hector J. Levesque,et al.  A New Method for Solving Hard Satisfiability Problems , 1992, AAAI.

[171]  Sven Koenig,et al.  Representations of Decision-Theoretic Planning Tasks , 2000, AIPS.