Freiburg, Germany
June 11-16, 2011

21st International Conference on Automated Planning and Scheduling

Freiburg

Detailed Schedule

The program leaflet is online available as pdf. A hardcopy will be included in the conference material. The main conference program is also available as separate pdf.

Sat, June 11 2011 (Doctoral Consortium)
Sun, June 12 2011 (Tutorials & Workshops)
Mon, June 13 2011 (Tutorials & Workshops)
Tue, June 14 2011 (Main Conference)
Wed, June 15 2011 (Main Conference)
Thu, June 16 2011 (Main Conference)

Sat, June 11 2011

	Event
AM	Doctoral Consortium
	Lunch Break
PM	Doctoral Consortium
Evening	Doctoral Consortium Dinner

Sun, June 12 2011

	Workshops				Tutorials
AM 1	HDIP	KEPS	MCTS	GAPRec	A Survey of Suboptimal Search Algorithms (Jordan Thayer and Wheeler Ruml)
AM 2	HDIP	KEPS	MCTS	GAPRec	Using Solution Length Estimates In Heuristic Search (Jordan Thayer and Wheeler Ruml)
	Lunch Break
PM 1	HDIP	KEPS	MCTS		Decision Diagrams in Automated Planning and Scheduling (Scott Sanner)
PM 2	HDIP	KEPS	MCTS		Problem Solving with Model Checking Techniques (Michael Weber and Jaco van de Pol)

Mon, June 13 2011

	Workshops				Tutorials
AM 1	PAL	SPARK	COPLAS	VVPS	Translation-based approaches to conformant and contingent planning (Héctor Palacios and Alexandre Albore)
AM 2	PAL	SPARK	COPLAS	VVPS	Petri nets and their relation to planning (Blai Bonet and Patrik Haslum)
	Lunch Break
PM 1	PAL	SPARK	COPLAS	VVPS	Open Source Solutions for Motion Planning (Sachin Chitta)
PM 2	PAL	SPARK	COPLAS	VVPS	Introduction to Planning Domain Modeling in RDDL (Scott Sanner)
19:30	Opening Reception

Tue, June 14 2011

08:00-20:00	Registration
08:45-09:00	Opening Remarks
09:00-10:00	Invited Talk: Jason Williams
10:00-10:30	Coffee Break
10:30-12:10	Session Ia: Heuristics for Planning Jörg Hoffmann Where Ignoring Delete Lists Works, Part II: Causal Graphs Erez Karpas, Michael Katz and Shaul Markovitch When Optimal is Just Not Good Enough: Learning Fast Informative Action Cost Partitionings Jussi Rintanen Heuristics for Planning with SAT and Expressive Action Definitions Amanda Coles and Andrew Coles LPRPG-P: Relaxed Plan Heuristics for Planning with Preferences	Session Ib: Markov Decision Processes Andrey Kolobov, Mausam, Daniel S. Weld and Hector Geffner Heuristic Search for Generalized Stochastic Shortest Path MDPs Boris Lesner and Bruno Zanuttini Efficient Policy Construction for MDPs Represented in Probabilistic PDDL Pascal Poupart, Kee-Eung Kim and Dongho Kim Closing the Gap: Improved Bounds on Optimal POMDP Solutions Paul Weng Markov Decision Processes with Ordinal Rewards: Reference Point-Based Preferences
12:10-14:00	Lunch Break
14:00-15:35	Session IIa: Plan Search Engineering Rong Zhou and Eric A. Hansen Dynamic State-Space Partitioning in External-Memory Graph Search Damian Sulewski, Stefan Edelkamp and Peter Kissmann Exploiting the Computational Power of the Graphics Card: Optimal State Space Planning on the GPU Jesse Hoey and Marek Grzes Distributed Control of Situated Assistance in Large Domains with Many Tasks Blai Bonet Abstraction Heuristics Extended with Counting Abstractions (short paper)	Session IIb: Generalized Planning Anders Jonsson and Michael Rovatsos Scaling Up Multiagent Planning: A Best-Response Approach Jonas Kvarnström Planning for Loosely Coupled Agents using Partial Order Forward-Chaining Siddharth Srivastava, Neil Immerman, Shlomo Zilberstein and Tianjiao Zhang Directed Search for Generalized Plans Using Classical Planners Alfonso E. Gerevini, Fabio Patrizi and Alessandro Saetti An Effective Approach to Realizing Planning Programs (short paper)
15:35-16:05	Coffee Break
16:05-17:30	Results IPC Uncertainty Competition Scott Sanner and Sungwook Yoon Deterministic Competition Ángel García Olaya, Carlos Linares López and Sergio Jiménez Celorrio Learning Competition Sergio Jiménez Celorrio, Amanda Coles and Andrew Coles
17:30-20:00 (open end)	DC Posters & System Demos

Wed, June 15 2011

08:30-18:00	Registration
09:00-10:00	Invited Talk: Pascal Van Hentenryck
10:00-10:30	Coffee Break
10:30-12:10	Session IIIa: Applications I Amanda Coles, Andrew Coles, Allan Clark and Stephen Gilmore Cost-Sensitive Concurrent Planning under Duration Uncertainty for Service-Level Agreements Minh Do, Kazumichi Okajima, Serdar Uckun, Fumio Hasegawa, Yukihiro Kawano, Koji Tanaka, Lara Crawford, Ying Zhang and Aki Ohashi Online Planning for a Material Control System for Liquid Crystal Display Manufacturing José E. Flórez, Álvaro Torralba Arias de Reyna, Javier García, Carlos Linares López, Ángel García-Olaya and Daniel Borrajo Planning Multi-Modal Transportation Problems Emili Hernandez, Marc Carreras and Pere Ridao A Path Planning Algorithm for an AUV Guided with Homotopy Classes	Session IIIb: Frontiers in Planning Jordan T. Thayer, Austin Dionne and Wheeler Ruml Learning Inadmissible Heuristics during Search Alan Fern and Paul Lewis Ensemble Monte-Carlo Planning: An Empirical Study Alexandre Albore, Miquel Ramirez and Hector Geffner Effective Heuristics and Belief Tracking for Planning with Incomplete Information Nir Lipovetzky and Hector Geffner Searching for Plans with Carefully Designed Probes
12:10-14:00	Lunch Break
14:00-15:40	Session IV: Best Papers Maria Fox, Derek Long and Daniele Magazzeni Automatic Construction of Efficient Multiple Battery Usage Policies (best paper) Léon Planken, Mathijs de Weerdt and Roman van der Krogt Computing All-Pairs Shortest Paths by Leveraging Low Treewidth (honorable mention for best student paper) Raghuram Ramanujan and Bart Selman Trade-Offs in Sampling-Based Adversarial Planning (honorable mention for best student paper) Javier Velez, Garrett Hemann, Albert S. Huang, Ingmar Posner and Nicholas Roy Planning to Perceive: Exploiting Mobility For Robust Object Detection (best student paper)
15:40-16:10	Coffee Break
16:10-18:10	Community Meeting (includes Best Dissertation Talk)
20:00	Banquet

Thu, June 16 2011

08:30-16:45	Registration
09:00-10:00	Invited Talk: Michael P. Wellman
10:00-10:30	Coffee Break
10:30-12:15	Session Va: Applications II Hankz Hankui Zhuo, Qiang Yang, Rong Pan and Lei Li Cross-Domain Action-Model Acquisition for Planning Via Web Search Roni Stern, Rami Puzis and Ariel Felner Potential Search: A Bounded-Cost Search Algorithm Julie Porteous, Jonathan Teutenberg, David Pizzi and Marc Cavazza Visual Programming of Plan Dynamics Using Constraints and Landmarks Richard Hoshino and Ken-ichi Kawarabayashi The Multi-Round Balanced Traveling Tournament Problem	Session Vb: Limits and Possibilities Christer Bäckström and Peter Jonsson Limits for Compact Representations of Plans Aldo Porco, Alejandro Machado and Blai Bonet Automatic Polytime Reductions of NP Problems into a Fragment of STRIPS Blai Bonet and Julio Castillo A Complete Algorithm for Generating Landmarks (short paper) Thomas Keller and Patrick Eyerich A Polynomial All Outcome Determinization for Probabilistic Planning (short paper) Chris Mansley, Ari Weinstein and Michael L. Littman Sample-Based Planning for Continuous Action Markov Decision Processes (short paper)
12:15-14:00	Lunch Break
14:00-15:15	Session VIa: Automated Scheduling Maliheh Aramon Bajestani and J. Christopher Beck Scheduling an Aircraft Repair Shop Michael D. Moffitt and Gernot E. Günther Scalable Scheduling for Hardware-Accelerated Functional Verification Gilles Simonin, Rodolphe Giroudeau, Jean-Claude König and Benoit Darties Theoretical Aspects of Scheduling Coupled-Tasks in the Presence of Compatibility Graph	Session VIb: Incomplete Information Christopher Weber and Daniel Bryce Planning and Acting in Incomplete Domains Son Thanh To, Tran Cao Son and Enrico Pontelli Contingent Planning as AND/OR Forward Search with Disjunctive Representation Stephen Cresswell and Peter Gregory Generalised Domain Model Acquisition from Action Traces
15:15-15:45	Coffee Break
15:45-16:25	Session VIIa: Real-Time Planning Debdeep Banerjee and Patrik Haslum Partial-Order Support-Link Scheduling (short paper) Carlos Hernández and Jorge A. Baier Fast Subgoaling for Pathfinding Via Real-Time Search (short paper)	Session VIIb: Applications III Avitan Gefen and Ronen I. Brafman The Minimal Seed Set Problem (short paper) Gian Diego Tipaldi and Kai O. Arras Planning Problems for Social Robots (short paper)
16:25-16:30	Closing Remarks