Accepted Papers

Individual papers from the ICAPS'14 proceedings are available at the AAAI Digital Library.

Talk videos are gradually uploaded to ICAPS's YouTube channel.

Main Track

Full Technical Papers

• On the Feasibility of Planning Graph Style Heuristics for HTN Planning.
  Ron Alford, Vikas Shivashankar, Ugur Kuter and Dana Nau.
• Optimizing Planning Domains by Action Schema Splitting.
  Carlos Areces, Facundo Bustos, Martin Dominguez, and Joerg Hoffmann.
• Fully Automated Cyclic Planning for Large-Scale Manufacturing Domains.
  Masataro Asai and Alex Fukunaga.
• Thompson Sampling based Monte-Carlo Planning in POMDPs.
  Aijun Bai, Feng Wu, Zongzhang Zhang and Xiaoping Chen.
• Overcoming the Utility Problem in Heuristic Generation: Why Time Matters.
  Michael Barley, Santiago Franco and Patricia Riddle.
• Flow-based Heuristics for Optimal Planning: Landmarks and Merges.
  Blai Bonet and Menkes van den Briel.
• Landmark-Based Plan Distance Measures for Diverse Planning.
  Daniel Bryce.
• MUM: A Technique for Maximising the Utility of Macro-operators by Constrained Generation and Use.
  Lukas Chrpa, Mauro Vallati and Thomas Leo McCluskey.
• Reasoning with Events and Linear Processes in Forward Chaining Planning.
  Amanda Coles and Andrew Coles.
• Fragment-Based Planning Using Column Generation.
  Toby O. Davies, Adrian R. Pearce, Peter J. Stuckey and Harald Søndergaard.
• Symbolic and Explicit Search Hybrid through Perfect Hash Functions – A Case Study in Connect Four.
  Stefan Edelkamp, Peter Kissmann and Martha Rohte.
• On MABs and Separation of Concerns in Monte-Carlo Planning for MDPs.
  Zohar Feldman and Carmel Domshlak.
• Revisiting Risk-Sensitive MDPs: New Algorithms and Results.
  Ping Hou, William Yeoh and Pradeep Varakantham.
• Goal Recognition Design. ( Honorable Mention for the Outstanding Paper Award)
  Sarah Keren, Erez Karpas and Avigdor Gal.
• Improving Jump Point Search.
  Daniel Harabor and Alban Grastien.
• Optimal Planning with Global Numerical State Constraints. (Outstanding Student Paper Award)
  Franc Ivankovic, Patrik Haslum, Sylvie Thiebaux, Vikas Shivashankar and Dana Nau.
• Optimization Model and Heuristic Approach for Blocks Retrieval Processes in Warehouses.
  Christopher Expósito Izquierdo, Belen Melian and Marcos Moreno.
• On the use of temporal landmarks for planning with deadlines.
  Eliseo Marzal, Laura Sebastia and Eva Onaindia.
• A Novel Priority Rule Heuristic: Learning from Justification. (Honorable Mention for the Outstanding Paper Award)
  Frits de Nijs and Tomas Klos.
• Bootstrapping Simulation-based Algorithms with a Suboptimal Policy.
  Truong-Huy Nguyen, Tomi Silander, Wee-Sun Lee and Tze-Yun Leong.
• An Heuristic Approach to Planning with Incomplete STRIPS Action Models.
  Tuan Nguyen and Subbarao Kambhampati.
• EfficientIDC: A Faster Incremental Dynamic Controllability Algorithm.
  Mikael Nilsson, Jonas Kvarnström and Patrick Doherty.
• Parallel A* for Planning with Time-consuming State Expansions.
  Mike Phillips, Sven Koenig and Maxim Likhachev.
• Planning under Uncertainty Using Reduced Models: Revisiting Determinization.
  Luis Pineda and Shlomo Zilberstein.
• LP-based Heuristics for Cost-optimal Planning. (Outstanding Paper Award)
  Florian Pommerening, Gabriele Röger, Malte Helmert and Blai Bonet.
• Directed Fixed-Point Regression-based Planning for Non-Deterministic Domains
  Miquel Ramírez and Sebastian Sardina.
• Heuristic Evaluation based on Lifted Relaxed Planning Graphs.
  Bram Ridder, Maria Fox and Derek Long.
• Evaluating Diversity for Classical Planning.
  Mark Roberts, Adele Howe and Indrajit Ray.
• Bounded Approximations for Linear Multi-Objective Planning under Uncertainty.
  Diederik Roijers, Joris Scharpff, Matthijs Spaan, Frans Oliehoek, Mathijs De Weerdt and Shimon Whiteson.
• Chance-Constrained Consistency for Probabilistic Temporal Plan Networks
  Pedro Santana and Brian Williams.
• Plan Repair for resource constrained tasks via numeric macro actions.
  Enrico Scala.
• Diverse and Additive Cartesian Abstraction Heuristics.
  Jendrik Seipp and Malte Helmert.
• Partially Observable Online Contingent Planning Using Landmark Heuristics.
  Guy Shani, Erez Karpas, Ronen Brafman and Shlomi Maliah.
• Relaxation Heuristics for Multiagent Planning.
  Michal Štolba and Antonín Komenda.
• The Complexity of Partial-Order Plan Viability Problems.
  Xing Tan and Michael Gruninger.
• Computing Solutions in Infinite-Horizon Discounted Adversarial Patrolling Games
  Yevgeniy Vorobeychik, Bo An, Milind Tambe and Satinder Singh.
• Efficient Stubborn Sets: Generalized Algorithms and Selection Strategies.
  Martin Wehrle and Malte Helmert.
• Spatially Distributed Multiagent Path Planning.
  Christopher Wilt and Adi Botea.
• Resolving Uncontrollable Conditional Temporal Problems using Continuous Relaxations. (Honorable Mention for the Outstanding Paper Award)
  Peng Yu, Cheng Fang and Brian Williams.

Short Papers

• Analyzing the Impact of Partial States on Duplicate Detection and Collision of Frontiers.
  Vidal Alcázar, Susana Fernandez and Daniel Borrajo.
• Improved Features for Runtime Prediction of Domain-Independent Planners.
  Chris Fawcett, Mauro Vallati, Frank Hutter, Jörg Hoffmann, Holger H. Hoos and Kevin Leyton-Brown.
• Plan and Activity Recognition from a Topic Modeling Perspective.
  Richard Freedman, Hee-Tae Jung and Shlomo Zilberstein.
• Under-Approximation Refinement for Classical Planning.
  Manuel Heusner, Martin Wehrle, Florian Pommerening and Malte Helmert.
• Non-Deterministic Planning With Conditional Effects.
  Christian Muise, Sheila Mcilraith and Vaishak Belle.
• A Comparison of Knowledge-Based GBFS Enhancements and Knowledge-Free Exploration.
  Richard Valenzano, Nathan Sturtevant, Jonathan Schaeffer and Fan Xie.
• Discriminatively Reranking Abductive Proofs for Plan Recognition.
  Sam Wiseman and Stuart Shieber.

Novel Applications Track

Full Technical Papers

• Plan, Repair, Execute, Explain - How Planning Helps to Assemble your Home Theater.
  Pascal Bercher, Susanne Biundo, Thomas Geier, Thilo Hoernle, Florian Nothdurft, Felix Richter and Bernd Schattenberg.
• Near-Optimal Nonmyopic Contact Center Planning Using Dual Decomposition. (Outstanding Application Paper Award)
  Akshat Kumar, Sudhanshu Singh, Pranav Gupta and Gyana Parija.
• Planning for Mining Operations with Time and Resource Constraints
  Nir Lipovetzky, Christina Burt, Adrian Pearce and Peter Stuckey.
• The Route Not Taken: Driver-Centric Estimation of Electric Vehicle Range
  Peter Ondruska and Ingmar Posner.
• Automated Planning for Multi-Objective Machine Tool Calibration: Optimising Makespan and Measurement Uncertainty
  Simon Parkinson, Peter Gregory, Andrew Longstaff and Andrew Crampton.
• Satellite Data Download Management with Uncertainty about the Generated Volumes
  Cédric Pralet, Gérard Verfaillie, Adrien Maillard, Emmanuel Hébrard, Nicolas Jozefowiez, Marie-Josée Huguet, Thierry Desmousceaux, Pierre Blanc-Paques and Jean Jaubert.

Short Papers

• Planning meets Data Cleansing.
  Roberto Boselli, Mirko Cesarini, Fabio Mercorio and Mario Mezzanzanica.

Robotics Track

Full Technical Papers

• Integrated Motion Planning and Coordination for Industrial Vehicles.
  Marcello Cirillo, Federico Pecora, Henrik Andreasson, Tansel Uras, and Sven Koenig.
• Planning the Behaviour of Low-Cost Quadcopters for Surveillance Missions.
  Sara Bernardini, Maria Fox and Derek Long.
• A Robotic Execution Framework for Online Probabilistic (Re)Planning
  Caroline Ponzoni Carvalho Chanel, Charles Lesire and Florent Teichteil-Königsbuch.
• Concurrent Plan Recognition and Execution for Human-Robot Teams.
  Steven Levine and Brian Williams.
• A Tree-Based Algorithm for Construction Robots.
  T. K. Satish Kumar, Sangmook Jung and Sven Koenig.
• Planning in Action Language BC while Learning Action Costs for Mobile Robots.
  Fangkai Yang, Piyush Khandelwal, Matteo Leonetti, Vladimir Lifschitz and Peter Stone.

Short Papers

• Finding Ways to Get the Job Done: An Affordance-based Approach.
  Iman Awaad, Gerhard K. Kraetzschmar and Joachim Hertzberg.
• Path planning for dexterous mobility.
  Dirk Ruiken, Michael W. Lanighan and Roderic A. Grupen.
• Making A* Run Faster than D*-Lite in Path-Planning in Partially Known Terrain.
  Carlos Hernández Ulloa, Jorge Baier and Roberto Asín.

Journal Presentation Track

• Decentralized Multi-Robot Cooperation with Auctioned POMDPs.
  J. Capitan, M. Spaan, L. Merino, and A. Ollero.
• Single and Dual-Arm Motion Planning with Heuristic Search.
  Benjamin Cohen, Sachin Chitta, and Maxim Likhachev.
• Building Virtual Behaviors from Partially Controllable Available Behaviors in Nondeterministic Environments.
  Giuseppe De Giacomo, Fabio Patrizi, and Sebastian Sardina.
• The Complexity of Optimal Monotonic Planning: The Bad, The Good, and The Causal Graph.
  Carmel Domshlak and Anton Nazarenko.
• TEXPLORE: Real-Time Sample-Efficient Reinforcement Learning for Robots
  Todd Hester and Peter Stone.
• Integrated Task and Motion Planning in Belief Space.
  Leslie Pack Kaelbling and Tomas Lozano-Perez.
• Towards Robust Task Execution for Domestic Service Robots.
  A. Kuestenmacher, N. Akhtar, P. Plöger and G. Lakemeyer.
• C-FOREST: Parallel Shortest-Path Planning with Super Linear Speedup
  Michael W. Otte and Nikolaus Correll.
• Time-dependent Simple Temporal Networks: Properties and Algorithms.
  Cedric Pralet and Gerard Verfaillie.
• Property Directed Reachability for Automated Planning.
  Martin Suda.