Abstract is missing.
- Using Backwards Generated Goals for Heuristic PlanningVidal Alcázar, Daniel Borrajo, Carlos Linares López. 2-9 [doi]
- Planning for Concurrent Action Executions Under Action Duration Uncertainty Using Dynamically Generated Bayesian NetworksEric Beaudry, Froduald Kabanza, François Michaud. 10-17 [doi]
- An Evolutionary Metaheuristic Based on State Decomposition for Domain-Independent Satisficing PlanningJacques Bibai, Pierre Savéant, Marc Schoenauer, Vincent Vidal. 18-25 [doi]
- A Comparison of Algorithms for Solving the Multiagent Simple Temporal ProblemJames C. Boerkoel Jr., Edmund H. Durfee. 26-33 [doi]
- Timeline-Based Space Operations Scheduling with External ConstraintsSteve A. Chien, Daniel Tran, Gregg Rabideau, Steve R. Schaffer, Dan Mandl, Stuart Frye. 34-41 [doi]
- Forward-Chaining Partial-Order PlanningAmanda Jane Coles, Andrew Coles, Maria Fox, Derek Long. 42-49 [doi]
- When Abstractions Met LandmarksCarmel Domshlak, Michael Katz, Sagi Lefler. 50-56 [doi]
- Perfect Hashing for State Space Exploration on the GPUStefan Edelkamp, Damian Sulewski, Cengizhan Yücel. 57-64 [doi]
- Cost-Optimal Factored Planning: Promises and PitfallsEric Fabre, Loig Jezequel, Patrik Haslum, Sylvie Thiébaux. 65-72 [doi]
- Towards Finding Robust Execution Strategies for RCPSP/max with Durational UncertaintyNa Fu, Pradeep Varakantham, Hoong Chuin Lau. 73-80 [doi]
- Coming Up With Good Excuses: What to do When no Plan Can be FoundMoritz Göbelbecker, Thomas Keller, Patrick Eyerich, Michael Brenner, Bernhard Nebel. 81-88 [doi]
- Self-Taught Decision Theoretic Planning with First Order Decision DiagramsSaket Joshi, Kristian Kersting, Roni Khardon. 89-96 [doi]
- Classical Planning in MDP Heuristics: with a Little Help from GeneralizationAndrey Kolobov, Mausam, Daniel S. Weld. 97-104 [doi]
- Pattern Database Heuristics for Fully Observable Nondeterministic PlanningRobert Mattmüller, Manuela Ortlieb, Malte Helmert, Pascal Bercher. 105-112 [doi]
- Partially Informed Depth-First Search for the Job Shop ProblemCarlos Mencía, María R. Sierra, Ramiro Varela. 113-120 [doi]
- Action Elimination and Plan Neighborhood Graph Search: Two Algorithms for Plan ImprovementHootan Nakhost, Martin Müller 0003. 121-128 [doi]
- Incrementally Solving STNs by Enforcing Partial Path ConsistencyLéon Planken, Mathijs de Weerdt, Neil Yorke-Smith. 129-136 [doi]
- The Joy of Forgetting: Faster Anytime Search via RestartingSilvia Richter, Jordan Tyler Thayer, Wheeler Ruml. 137-144 [doi]
- Handling Goal Utility Dependencies in a Satisfiability FrameworkRichard Anthony Russell, Sean Holden. 145-152 [doi]
- Constraint Propagation in Propositional PlanningAndreas Sideris, Yannis Dimopoulos. 153-160 [doi]
- Computing Applicability Conditions for Plans with LoopsSiddharth Srivastava, Neil Immerman, Shlomo Zilberstein. 161-168 [doi]
- A New Approach to Conformant Planning Using CNF*Son Thanh To, Tran Cao Son, Enrico Pontelli. 169-176 [doi]
- Simultaneously Searching with Multiple Settings: An Alternative to Parameter Tuning for Suboptimal Single-Agent Search AlgorithmsRichard Anthony Valenzano, Nathan R. Sturtevant, Jonathan Schaeffer, Karen Buro, Akihiro Kishimoto. 177-184 [doi]
- Influence-Based Policy Abstraction for Weakly-Coupled Dec-POMDPsStefan J. Witwicki, Edmund H. Durfee. 185-192 [doi]
- Choosing Path Replanning Strategies for Unmanned Aircraft SystemsMariusz Wzorek, Jonas Kvarnström, Patrick Doherty. 193-200 [doi]
- Iterative Learning of Weighted Rule Sets for Greedy SearchYuehua Xu, Alan Fern, Sung Wook Yoon. 201-208 [doi]
- Improving Determinization in Hindsight for On-line Probabilistic PlanningSung Wook Yoon, Wheeler Ruml, J. Benton, Minh Binh Do. 209-217 [doi]
- When Policies Can Be Trusted: Analyzing a Criteria to Identify Optimal Policies in MDPs with Unknown Model ParametersEmma Brunskill. 218-221 [doi]
- A PDDL+ Benchmark Problem: The Batch Chemical PlantGiuseppe Della Penna, Benedetto Intrigila, Daniele Magazzeni, Fabio Mercorio. 222-225 [doi]
- Temporal Planning with Problems Requiring Concurrency through Action Graphs and Local SearchAlfonso Gerevini, Alessandro Saetti, Ivan Serina. 226-229 [doi]
- Shopper: A System for Executing and Simulating Expressive PlansRobert P. Goldman, John Maraist. 230-233 [doi]
- The Scanalyzer Domain: Greenhouse Logistics as a Planning ProblemMalte Helmert, Hauke Lasinger. 234-237 [doi]
- Waking Up a Sleeping Rabbit: On Natural-Language Sentence Generation with FFAlexander Koller, Joerg Hoffmann. 238-241 [doi]
- On Adversarial Search Spaces and Sampling-Based PlanningRaghuram Ramanujan, Ashish Sabharwal, Bart Selman. 242-245 [doi]
- The More, the Merrier: Combining Heuristic Estimators for Satisficing PlanningGabriele Röger, Malte Helmert. 246-249 [doi]
- Genome Rearrangement and Planning: RevisitedTansel Uras, Esra Erdem. 250-253 [doi]
- Combined Task and Motion Planning for Mobile ManipulationJason Wolfe, Bhaskara Marthi, Stuart J. Russell. 254-258 [doi]
- G-Value Plateaus: A Challenge for PlanningJ. Benton, Kartik Talamadupula, Patrick Eyerich, Robert Mattmüller, Subbarao Kambhampati. 259-262 [doi]
- Construction Management Applications: Challenges in Developing Execution Control PlansNilufer Onder, Amlan Mukherjee, Pei Tang. 263-267 [doi]
- Computer-Aided Algorithm Design: Automated Tuning, Configuration, Selection, and BeyondHolger H. Hoos. 268-269 [doi]
- Robotic Agents for Disaster Response RoboticsDaniele Nardi. 270 [doi]
- From Automated Verification to Automated DesignMoshe Y. Vardi. 271 [doi]