Abstract is missing.
- An Affectively Driven Planner for Synthetic CharactersRuth Aylett, João Dias, Ana Paiva. 2-10
- Bringing Users and Planning Technology Together. Experiences in SIADEXJuan Fernández-Olivares, Luis A. Castillo, Óscar García-Pérez, Francisco Palao. 11-20
- Predictive Planning for Supply Chain ManagementDavid Pardoe, Peter Stone. 21-30
- Scalable Planning for Distributed Stream Processing SystemsAnton Riabov, Zhen Liu. 31-41
- Bounded Branching and Modalities in Non-Deterministic PlanningBlai Bonet. 42-51
- New Complexity Results for Classical Planning BenchmarksMalte Helmert. 52-62
- Efficiently Handling Temporal Knowledge in an HTN PlannerLuis A. Castillo, Juan Fernández-Olivares, Óscar García-Pérez, Francisco Palao. 63-72
- Tractable Optimal Competitive SchedulingJeremy Frank, James Crawford, Lina Khatib, Ronen I. Brafman. 73-82
- On Some Tractable Cases of Logical FilteringT. K. Satish Kumar, Stuart J. Russell. 83-92
- Optimal Rectangle Packing: A Meta-CSP ApproachMichael D. Moffitt, Martha E. Pollack. 93-102
- Lemma Reusing for SAT based Planning and SchedulingHidetomo Nabeshima, Takehide Soh, Katsumi Inoue, Koji Iwanuma. 103-113
- Solving Factored MDPs with Exponential-Family Transition ModelsBranislav Kveton, Milos Hauskrecht. 114-120
- Stochastic Over-Subscription Planning Using Hierarchies of MDPsNicolas Meuleau, Ronen I. Brafman, Emmanuel Benazera. 121-130
- Optimal Route Planning under UncertaintyEvdokia Nikolova, Matthew Brand, David R. Karger. 131-141
- Learning Depth-First Search: A Unified Approach to Heuristic Search in Deterministic and Non-Deterministic Settings, and Its Application to MDPsBlai Bonet, Hector Geffner. 142-151
- Explanation-Based Acquisition of Planning OperatorsGeoffrey Levine, Gerald DeJong. 152-161
- Learning Heuristic Functions from Relaxed PlansSung Wook Yoon, Alan Fern, Robert Givan. 162-171
- Evaluating Mixed-Initiative Systems: An Experimental ApproachGabriella Cortellessa, Amedeo Cesta. 172-181
- Metatheoretic Plan Summarization and ComparisonKaren L. Myers. 182-192
- Safe LTL Assumption-Based PlanningAlexandre Albore, Piergiorgio Bertoli. 193-202
- Goal Achievement in Partially Known, Partially Observable DomainsAllen Chang, Eyal Amir. 203-211
- Plan Stability: Replanning versus Plan RepairMaria Fox, Alfonso Gerevini, Derek Long, Ivan Serina. 212-221
- Incremental Scheduling to Maximize Quality in a Dynamic EnvironmentAnthony Gallagher, Terry L. Zimmerman, Stephen F. Smith. 222-232
- Sequential Monte Carlo in Probabilistic Planning Reachability HeuristicsDaniel Bryce, Subbarao Kambhampati, David E. Smith. 233-242
- Fast Probabilistic Planning through Weighted Model CountingCarmel Domshlak, Jörg Hoffmann. 243-252
- Combining Knowledge Compilation and Search for Conformant Probabilistic PlanningJinbo Huang. 253-262
- Concurrent Probabilistic Planning in the Graphplan FrameworkIain Little, Sylvie Thiébaux. 263-273
- An Empirical Study of Multi-Point Constructive Search for Constraint-Based SchedulingJ. Christopher Beck. 274-283
- Structure and Problem Hardness: Goal Asymmetry and DPLL Proofs in SAT-Based PlanningJörg Hoffmann, Carla P. Gomes, Bart Selman. 284-293
- Friends or Foes? An AI Planning Perspective on Abstraction and SearchJörg Hoffmann, Ashish Sabharwal, Carmel Domshlak. 294-303
- Memory-Efficient Symbolic Heuristic SearchRune M. Jensen, Eric A. Hansen, Simon Richards, Rong Zhou. 304-313
- Looking for Shortcuts: Infeasible Search Analysis for Oversubscribed Scheduling ProblemsMark F. Rogers, Adele E. Howe, Darrell Whitley. 314-323
- Exploiting the Power of Local Search in a Branch and Bound Algorithm for Job Shop SchedulingMatthew J. Streeter, Stephen F. Smith. 324-333
- A Multi-Start Very Large Neighbourhood Search Approach with Local Search Methods for Examination TimetablingSalwani Abdullah, Edmund K. Burke. 334-337
- SEMAPLAN: Combining Planning with Semantic Matching to Achieve Web Service CompositionRama Akkiraju, Biplav Srivastava, Anca-Andreea Ivan, Richard Goodwin, Tanveer Fathima Syeda-Mahmood. 338-341
- Planning with Temporally Extended Goals Using Heuristic SearchJorge A. Baier, Sheila A. McIlraith. 342-345
- Run-Time Monitoring of the Execution of Plans for Web Service CompositionFabio Barbon, Paolo Traverso, Marco Pistore, Michele Trainotti. 346-349
- Incremental Maintenance of Double Precedence Graphs: A Constraint-Based ApproachRoman Barták, Ondrej Cepek. 350-353
- Towards Strong Cyclic Planning under Partial ObservabilityPiergiorgio Bertoli, Alessandro Cimatti, Marco Pistore. 354-357
- Automated Web Service Composition by On-the-Fly Belief Space SearchPiergiorgio Bertoli, Marco Pistore, Paolo Traverso. 358-361
- RRT-Plan: A Randomized Algorithm for STRIPS PlanningDaniel Burfoot, Joelle Pineau, Gregory Dudek. 362-365
- Motion Economy and PlanningÖzgen Canan, Aysenur Birtürk. 366-369
- Lessons Learned in Applying Domain-Independent Planning to High-Speed ManufacturingMinh Binh Do, Wheeler Ruml. 370-373
- On the Compilation of Plan Constraints and PreferencesStefan Edelkamp. 374-377
- Reusing and Building a Policy LibraryFernando Fernández, Manuela M. Veloso. 378-381
- Durative Planning in HTNsRobert P. Goldman. 382-385
- Robust Execution of Temporally Flexible Plans for Bipedal Walking DevicesAndreas Hofmann, Brian Williams. 386-389
- Learning to Do HTN PlanningOkhtay Ilghami, Dana S. Nau, Héctor Muñoz-Avila. 390-393
- Learning Behaviors Models for Robot Execution ControlGuillaume Infantes, Félix Ingrand, Malik Ghallab. 394-397
- Planning for PDDL3 - An OCSP Based ApproachBharat Ranjan Kavuluri, Naresh Babu Saladi, Deepak Khemani. 398-401
- A New Principle for Incremental Heuristic Search: Theoretical ResultsSven Koenig, Maxim Likhachev. 402-405
- Resource Contention Metrics for Oversubscribed Scheduling ProblemsLaurence A. Kramer, Stephen F. Smith. 406-409
- Probabilistic Planning with Nonlinear Utility FunctionsYaxin Liu, Sven Koenig. 410-413
- Challenges for Temporal Planning with Uncertain DurationsMausam, Daniel S. Weld. 414-417
- Automated Planning Using Quantum ComputationSanjeev Naguleswaran, Langford B. White, I. Fuss. 418-421
- Knowledge-based Middleware as an Architecture for Planning and Scheduling SystemsBernd Schattenberg, Steffen Balzer, Susanne Biundo. 422-425
- Combining Stochastic Task Models with Reinforcement Learning for Dynamic SchedulingMalcolm J. A. Strens. 426-429
- Spacetrack: Trading off Quality and Utilization in Oversubscribed SchedulesAndrew M. Sutton, Adele E. Howe, L. Darrell Whitley. 430-433
- On the Use of UML.P for Modeling a Real Application as a Planning ProblemTiago Stegun Vaquero, Flavio Tonidandel, Leliane Nunes de Barros, José Reinaldo Silva. 434-437
- Reconfigurable Path Planning for an Autonomous Unmanned Aerial VehicleMariusz Wzorek, Patrick Doherty. 438-441
- Optimal STRIPS Planning by Maximum Satisfiability and Accumulative LearningZhao Xing, Yixin Chen, Weixiong Zhang. 442-446