Abstract is missing.
- Planning Robust Temporal Plans: A Comparison Between CBTP and TGA ApproachesYasmina Abdeddaïm, Eugene Asarin, Matthieu Gallien, Félix Ingrand, Charles Lesire, Mihaela Sighireanu. 2-9
- Concurrent Probabilistic Temporal Planning with Policy-GradientsDouglas Aberdeen, Olivier Buffet. 10-17
- Mixed Integer Linear Programming for Exact Finite-Horizon Planning in Decentralized PomdpsRaghav Aras, Alain Dutech, François Charpillet. 18-25
- Exploiting Procedural Domain Control Knowledge in State-of-the-Art PlannersJorge A. Baier, Christian Fritz, Sheila A. McIlraith. 26-33
- A Hybrid Linear Programming and Relaxed Plan Heuristic for Partial Satisfaction Planning ProblemsJ. Benton, Menkes van den Briel, Subbarao Kambhampati. 34-41
- FF + FPG: Guiding a Policy-Gradient PlannerOlivier Buffet, Douglas Aberdeen. 42-48
- Dynamic Control in Path-Planning with Real-Time Heuristic SearchVadim Bulitko, Yngvi Björnsson, Mitja Lustrek, Jonathan Schaeffer, Sverrir Sigmundarson. 49-56
- An Innovative Product for Space Mission Planning: An A Posteriori EvaluationAmedeo Cesta, Gabriella Cortellessa, Simone Fratini, Angelo Oddi, Nicola Policella. 57-64
- Online Planning for Resource Production in Real-Time Strategy GamesHei Chan, Alan Fern, Soumya Ray, Nick Wilson, Chris Ventura. 65-72
- Act Local, Think Global: Width Notions for Tractable PlanningHubie Chen, Omer Giménez. 73-80
- Planning with Respect to an Existing Schedule of EventsAndrew Coles, Maria Fox, Derek Long, Amanda Smith. 81-88
- A New Local-Search Algorithm for Forward-Chaining PlanningAndrew Coles, Maria Fox, Amanda Smith. 89-96
- Online Identification of Useful Macro-Actions for PlanningAndrew Coles, Maria Fox, Amanda Smith. 97-104
- Evaluating Temporal Planning DomainsWilliam Cushing, Daniel S. Weld, Subbarao Kambhampati, Mausam, Kartik Talamadupula. 105-112
- Prioritizing Bellman Backups without a Priority QueuePeng Dai, Eric A. Hansen. 113-119
- The Manpower Allocation Problem with Time Windows and Job-Teaming ConstraintsAnders Dohn, Esben Kolind, Jens Clausen. 120-127
- External Memory Value IterationStefan Edelkamp, Shahid Jabbar, Blai Bonet. 128-135
- Bounding the Resource Availability of Activities with Linear Resource ImpactJeremy Frank, Paul H. Morris. 136-143
- Monitoring Plan Optimality During ExecutionChristian Fritz, Sheila A. McIlraith. 144-151
- On the Hardness of Planning Problems with Simple Causal GraphsOmer Giménez, Anders Jonsson. 152-159
- Towards a Heuristic for Scheduling the James Webb Space TelescopeMark E. Giuliano, Reiko Rager, Nazma Ferdous. 160-167
- Gradient-Based Relational Reinforcement Learning of Temporally Extended PoliciesCharles Gretton. 168-175
- Flexible Abstraction Heuristics for Optimal Sequential PlanningMalte Helmert, Patrik Haslum, Jörg Hoffmann. 176-183
- Constructing Conflict-Free Schedules in Space and TimeDavid W. Hildum, Stephen F. Smith. 184-191
- Temporally-Expressive Planning as Constraint Satisfaction ProblemsYuxiao Hu. 192-199
- Structural Patterns of Tractable Sequentially-Optimal PlanningMichael Katz, Carmel Domshlak. 200-207
- Robust Local Search and Its Application to Generating Robust SchedulesHoong Chuin Lau, Thomas Ou, Fei Xiao. 208-215
- Planning with Diversified Models for Fault-Tolerant RobotsBenjamin Lussier, Matthieu Gallien, Jérémie Guiochet, Félix Ingrand, Marc-Olivier Killijian, David Powell. 216-223
- Learning to Plan Using Harmonic Analysis of Diffusion ModelsSridhar Mahadevan, Sarah Osentoski, Jeffrey Johns, Kimberly Ferguson, Chang Wang. 224-231
- Angelic Semantics for High-Level ActionsBhaskara Marthi, Stuart J. Russell, Jason Wolfe. 232-239
- Cost-Sharing Approximations for h+Vitaly Mirkis, Carmel Domshlak. 240-247
- Transformational Planning for Everyday ActivityArmin Müller, Alexandra Kirsch, Michael Beetz. 248-255
- Learning Macro-Actions for Arbitrary Planners and DomainsMuhammad Abdul Hakim Newton, John Levine, Maria Fox, Derek Long. 256-263
- From Conformant into Classical Planning: Efficient Translations that May Be Complete TooHéctor Palacios, Hector Geffner. 264-271
- Managing Personal Tasks with Time Constraints and PreferencesIoannis Refanidis. 272-279
- Complexity of Concurrent Temporal PlanningJussi Rintanen. 280-287
- Approximate Solution Techniques for Factored First-Order MDPsScott Sanner, Craig Boutilier. 288-295
- A Fast Incremental Algorithm for Maintaining Dispatchability of Partially Controllable PlansJulie Shah, John Stedl, Brian Williams, Paul Robertson. 296-303
- Generating Exponentially Smaller POMDP Models Using Conditionally Irrelevant Variable AbstractionTrey Smith, David R. Thompson, David Wettergreen. 304-311
- Using Decision Procedures Efficiently for OptimizationMatthew J. Streeter, Stephen F. Smith. 312-319
- Using Adaptive Priority Weighting to Direct Search in Probabilistic SchedulingAndrew M. Sutton, Adele E. Howe, L. Darrell Whitley. 320-327
- Context-Aware Logistic Routing and SchedulingAdriaan ter Mors, Jonne Zutt, Cees Witteveen. 328-335
- itSIMPLE 2.0: An Integrated Tool for Designing Planning DomainsTiago Stegun Vaquero, Victor Romero, Flavio Tonidandel, José Reinaldo Silva. 336-343
- Discovering Relational Domain Features for Probabilistic PlanningJia-Hong Wu, Robert Givan. 344-351
- FF-Replan: A Baseline for Probabilistic PlanningSung Wook Yoon, Alan Fern, Robert Givan. 352