Abstract is missing.
- The Compression Power of Symbolic Pattern DatabasesMarcel Ball, Robert C. Holte. 2-11
- A Probabilistic Planner for the Combat Power Management ProblemAbder Rezak Benaskeur, Froduald Kabanza, Eric Beaudry, Mathieu Beaudoin. 12-19
- Exact Dynamic Programming for Decentralized POMDPs with Lossless Policy CompressionAbdeslam Boularias, Brahim Chaib-draa. 20-27
- From One to Many: Planning for Loosely Coupled Multi-Agent SystemsRonen I. Brafman, Carmel Domshlak. 28-35
- Causal Graphs and Structurally Restricted PlanningHubie Chen, Omer Giménez. 36-43
- Additive-Disjunctive Heuristics for Optimal PlanningAndrew Coles, Maria Fox, Derek Long, Amanda Smith. 44-51
- A Hybrid Relaxed Planning Graph—LP Heuristic for Numeric Planning DomainsAndrew Coles, Maria Fox, Derek Long, Amanda Smith. 52-59
- Learning Relational Decision Trees for Guiding Heuristic PlanningTomás de la Rosa, Sergio Jiménez, Daniel Borrajo. 60-67
- Planning for Modular Printers: Beyond ProductivityMinh Binh Do, Wheeler Ruml, Rong Zhou. 68-75
- Scheduling Meetings at Trade Events with Complex PreferencesAndreas Ernst, Gaurav Singh, René Weiskircher. 76-82
- Generating Robust Schedules Subject to Resource and Duration UncertaintiesNa Fu, Hoong Chuin Lau, Fei Xiao. 83-90
- A New Probabilistic Plan Recognition Algorithm Based on String RewritingChristopher W. Geib, John Maraist, Robert P. Goldman. 91-98
- In Search of the Tractability Boundary of Planning ProblemsOmer Giménez, Anders Jonsson. 99-106
- Multi-Objective Evolutionary Algorithms for Scheduling the James Webb Space TelescopeMark E. Giuliano, Mark D. Johnston. 107-115
- A New Hybrid Genetic Algorithm for the Job Shop Scheduling Problem with Setup TimesMiguel A. González, Camino R. Vela, Ramiro Varela. 116-123
- A New Local Search for the Job Shop Problem with Uncertain DurationsInés González Rodríguez, Camino R. Vela, Jorge Puente, Ramiro Varela. 124-131
- A New Approach to Tractable PlanningPatrik Haslum. 132-139
- Unifying the Causal Graph and Additive HeuristicsMalte Helmert, Hector Geffner. 140-147
- Rank-Dependent Probability Weighting in Sequential Decision Problems under UncertaintyGildas Jeantet, Olivier Spanjaard. 148-155
- Stochastic Planning with First Order Decision DiagramsSaket Joshi, Roni Khardon. 156-163
- Planning 3D Task Demonstrations of a Teleoperated Space Robot ArmFroduald Kabanza, Khaled Belghith, Philipe Bellefeuille, Benjamin Auder, Leo Hartman. 164-173
- Optimal Additive Composition of Abstraction-based Admissible HeuristicsMichael Katz, Carmel Domshlak. 174-181
- Structural Patterns Heuristics via Fork DecompositionMichael Katz, Carmel Domshlak. 182-189
- Using Classical Planners to Solve Nondeterministic Planning ProblemsUgur Kuter, Dana S. Nau, Elnatan Reisner, Robert P. Goldman. 190-197
- A Temporal Logic-Based Planning and Execution Monitoring SystemJonas Kvarnström, Fredrik Heintz, Patrick Doherty. 198-205
- Generative Planning for Hybrid Systems Based on Flow TubesHui X. Li, Brian C. Williams. 206-213
- Criticality Metrics for Distributed Plan and Schedule ManagementRajiv T. Maheswaran, Pedro A. Szekely. 214-221
- Angelic Hierarchical Planning: Optimal and Online AlgorithmsBhaskara Marthi, Stuart J. Russell, Jason Wolfe. 222-231
- CircuitTSAT: A Solver for Large Instances of the Disjunctive Temporal ProblemBlaine Nelson, T. K. Satish Kumar. 232-239
- Bounded-Parameter Partially Observable Markov Decision ProcessesYaodong Ni, Zhi-Qiang Liu. 240-247
- Learning Heuristic Functions through Approximate Linear ProgrammingMarek Petrik, Shlomo Zilberstein. 248-255
- P3C: A New Algorithm for the Simple Temporal ProblemLéon Planken, Mathijs de Weerdt, Roman van der Krogt. 256-263
- Filtering for a Continuous Multi-Resources cumulative Constraint with Resource Consumption and ProductionEmmanuel Poder, Nicolas Beldiceanu. 264-271
- Using Constraint Networks on Timelines to Model and Solve Planning and Scheduling ProblemsCédric Pralet, Gérard Verfaillie. 272-279
- The Complexity of Optimal Planning and a More Efficient Method for Finding SolutionsKatrina Ray, Matthew L. Ginsberg. 280-287
- What Makes Planners Predictable?Mark Roberts, Adele E. Howe, Brandon Wilson, Marie desJardins. 288-295
- A Compact and Efficient SAT Encoding for PlanningNathan Robinson, Charles Gretton, Duc Nghia Pham, Abdul Sattar. 296-303
- Realizing Multiple Autonomous Agents through Scheduling of Shared DevicesSebastian Sardiña, Giuseppe De Giacomo. 304-312
- Effective Information Value Calculation for Interruption Management in Multi-Agent SchedulingDavid Sarne, Barbara J. Grosz, Peter Owotoki. 313-321
- Fast Dynamic Scheduling of Disjunctive Temporal Constraint Networks through Incremental CompilationJulie A. Shah, Brian C. Williams. 322-329
- Efficient ADD Operations for Point-Based AlgorithmsGuy Shani, Pascal Poupart, Ronen I. Brafman, Solomon Eyal Shimony. 330-337
- Multiagent Planning Under Uncertainty with Stochastic Communication DelaysMatthijs T. J. Spaan, Frans A. Oliehoek, Nikos A. Vlassis. 338-345
- HiPPo: Hierarchical POMDPs for Planning Information Processing and Sensing Actions on a RobotMohan Sridharan, Jeremy Wyatt, Richard Dearden. 346-354
- Faster than Weighted A*: An Optimistic Approach to Bounded Suboptimal SearchJordan T. Thayer, Wheeler Ruml. 355-362
- Linear Relaxation Techniques for Task Management in Uncertain SettingsPradeep Varakantham, Stephen F. Smith. 363-371
- Decentralized Online Scheduling of Combination-Appointments in HospitalsIvan Vermeulen, Sander M. Bohte, Sylvia G. Elkhuizen, Piet J. M. Bakker, Han La Poutré. 372-379
- Fast and Memory-Efficient Multi-Agent PathfindingKo-Hsin Cindy Wang, Adi Botea. 380-387
- Useless Actions Are UsefulMartin Wehrle, Sebastian Kupferschmid, Andreas Podelski. 388-395
- Stochastic Enforced Hill-ClimbingJia-Hong Wu, Rajesh Kalyanam, Robert Givan. 396-403
- An Online Learning Method for Improving Over-Subscription PlanningSung Wook Yoon, J. Benton, Subbarao Kambhampati. 404-411
- Fast Planning for Dynamic PreferencesBrian Ziebart, Anind K. Dey, J. Andrew Bagnell. 412-419