All Stories

  1. Multi-agent path finding on real robots
  2. LOUGA: Learning Planning Operators Using Genetic Algorithms
  3. Modeling and solving planning problems in tabled logic programming: Experience from the Cave Diving domain
  4. An Experimental Study of Influence of Modeling and Solving Techniques on Performance of Planning
  5. Multiple-Origin-Multiple-Destination Path Finding with Minimal Arc Usage: Complexity and Models
  6. Introduction to the special issue on constraint satisfaction for planning and scheduling
  7. Using Attribute Grammars to Model Nested Workflows with Extra Constraints
  8. Using Constraint Logic Programming to Schedule Solar Array Operations on the International Space Station
  9. The Benefit of Control Knowledge and Heuristics During Search in Planning
  10. REINFORCED ENCODING FOR PLANNING AS SAT
  11. X-COPTER STUDIO
  12. To Plan or to Simply React? An Experimental Study of Action Planning in a Game Environment
  13. The effect of domain modeling on efficiency of planning: Lessons from the Nomystery domain
  14. Any Object Tracking and Following by a Flying Drone
  15. On modeling planning problems in tabled logic programming
  16. Planning as tabled logic programming
  17. Yet more planning efficiency: Finite-domain state-variable reformulation
  18. Short-Term Motion Tracking Using Inexpensive Sensors
  19. Machine Breakdown Recovery in Production Scheduling with Simple Temporal Constraints
  20. Planning and Acting with Temporal and Hierarchical Decomposition Models
  21. Using Tabled Logic Programming to Solve the Petrobras Planning Problem
  22. Planning and Scheduling
  23. A controller for autonomous landing of AR.Drone
  24. An Introduction to Constraint-Based Temporal Reasoning
  25. On verification of nested workflows with extra constraints: From theory to practice
  26. A Constraint-Based Planner for Mars Express Orbiter
  27. On Modeling Formalisms for Automated Planning
  28. Editorial
  29. Preface to special issue on Knowledge Engineering for Planning and Scheduling
  30. Formulating the template ILP consistency problem as a constraint satisfaction problem
  31. Verifying Nested Workflows with Extra Constraints
  32. On Modeling Planning Problems: Experience from the Petrobras Challenge
  33. Using Monte Carlo Tree Search to Solve Planning Problems in Transportation Domains
  34. Shortening Plans by Local Re-planning
  35. Three Approaches to Solve the Petrobras Challenge: Exploiting Planning Techniques for Solving Real-Life Logistics Problems
  36. One click dataset transfer: toward efficient coupling of distributed storage resources and CPUs
  37. Decomposition, Merging, and Refinement Approach to Boost Inductive Logic Programming Algorithms
  38. MAK€– A System for Modelling, Optimising, and Analyzing Production in Small and Medium Enterprises
  39. Boosting Inductive Logic Programming via Decomposition, Merging, and Refinement
  40. Workflow Optimization with FlowOpt: On Modelling, Optimizing, Visualizing, and Analysing Production Workflows
  41. Constraint satisfaction for planning and scheduling problems
  42. History of Constraint Programming
  43. On Generating Templates for Hypothesis in Inductive Logic Programming
  44. Integrating Time and Resources into Planning
  45. Preface to special issue on planning and scheduling
  46. New trends in constraint satisfaction, planning, and scheduling: a survey
  47. Special issue on applications and methodologies for planning and scheduling: editorial
  48. Efficient multi-site data movement using constraint programming for data hungry science
  49. Incremental propagation rules for a precedence graph with optional activities and time windows
  50. Optimizing Alternatives in Precedence Networks
  51. Constraint Models for Reasoning on Unification in Inductive Logic Programming
  52. Logic programming for combinatorial problems
  53. Using Constraint Programming to Plan Efficient Data Movement on the Grid
  54. Efficient multi-site data movement in distributed environment
  55. Tutorial CISCHED-T constraint-based scheduling
  56. Revisiting Constraint Models for Planning Problems
  57. Constraint Models for Sequential Planning
  58. Discovering implied constraints in precedence graphs with alternatives
  59. Constraint satisfaction techniques in planning and scheduling
  60. From enterprise models to scheduling models: bridging the gap
  61. Introduction: Special issue on constraint satisfaction techniques for planning and scheduling problems
  62. INCREMENTAL FILTERING ALGORITHMS FOR PRECEDENCE AND DEPENDENCY CONSTRAINTS
  63. Nested temporal networks with alternatives
  64. Temporal Reasoning in Nested Temporal Networks with Alternatives
  65. Introduction to the Special Issue on Knowledge Engineering Tools and Techniques for Automated Planning and Scheduling Systems
  66. Modelling Alternatives in Temporal Networks
  67. Introduction to the Special Issue on the Integration of AI and OR Techniques in CP for Combinatorial Optimization (CPAIOR 2005)
  68. Incremental Filtering Algorithms for Precedence and Dependency Constraints
  69. On Generators of Random Quasigroup Problems
  70. Book review
  71. Extension of O(n log n) Filtering Algorithms for the Unary Resource Constraint to Optional Activities
  72. Limited assignments
  73. Effective Modeling with Constraints
  74. Minimal Perturbation Problem in Course Timetabling
  75. Automated Search for Heuristic Functions
  76. Encoding HTN Planning as a Dynamic CSP
  77. Full Arc Consistency in WCSP and in Constraint Hierarchies with Finite Domains
  78. Implementing Propagators for Tabular Constraints
  79. A New Approach to Modeling and Solving Minimal Perturbation Problems
  80. A New Algorithm for Maintaining Arc Consistency After Constraint Retraction
  81. Unary Resource Constraint with Optional Activities
  82. Visopt ShopFloor: Going Beyond Traditional Scheduling
  83. Visopt ShopFloor: On the Edge of Planning and Scheduling
  84. Modelling Resource Transitions in Constraint-Based Scheduling
  85. Conceptual Models for Combined Planning and Scheduling
  86. Dynamic Constraint Models for Planning and Scheduling Problems
  87. Constraint Processing
  88. Constraint Processing
  89. Constraint Satisfaction for Planning and Scheduling
  90. Principles of Constraint Processing
  91. Constraint Satisfaction for Planning and Scheduling
  92. Principles of Constraint Processing
  93. Generating Implied Boolean Constraints Via Singleton Consistency
  94. Nested Precedence Networks with Alternatives: Recognition, Tractability, and Models
  95. A Constraint Model for State Transitions in Disjunctive Resources