ICAPS A*

51 papers

YearTitle / Authors
2011A Complete Algorithm for Generating Landmarks.
Blai Bonet, Julio Castillo
2011A Path Planning Algorithm for an AUV Guided with Homotopy Classes.
Emili Hernández, Marc Carreras, Pere Ridao
2011A Polynomial All Outcome Determinization for Probabilistic Planning.
Thomas Keller, Patrick Eyerich
2011Abstraction Heuristics Extended with Counting Abstractions.
Blai Bonet
2011An Effective Approach to Realizing Planning Programs.
Alfonso Gerevini, Fabio Patrizi, Alessandro Saetti
2011Automatic Construction of Efficient Multiple Battery Usage Policies.
Maria Fox, Derek Long, Daniele Magazzeni
2011Automatic Polytime Reductions of NP Problems into a Fragment of STRIPS.
Aldo Porco, Alejandro Machado, Blai Bonet
2011Closing the Gap: Improved Bounds on Optimal POMDP Solutions.
Pascal Poupart, Kee-Eung Kim, Dongho Kim
2011Computing All-Pairs Shortest Paths by Leveraging Low Treewidth.
Léon Planken, Mathijs de Weerdt, Roman van der Krogt
2011Contingent Planning as AND/OR Forward Search with Disjunctive Representation.
Son Thanh To, Tran Cao Son, Enrico Pontelli
2011Cost-Sensitive Concurrent Planning Under Duration Uncertainty for Service-Level Agreements.
Andrew Coles, Amanda Jane Coles, Allan Clark, Stephen Gilmore
2011Cross-Domain Action-Model Acquisition for Planning via Web Search.
Hankz Hankui Zhuo, Qiang Yang, Rong Pan, Lei Li
2011Directed Search for Generalized Plans Using Classical Planners.
Siddharth Srivastava, Neil Immerman, Shlomo Zilberstein, Tianjiao Zhang
2011Distributed Control of Situated Assistance in Large Domains with Many Tasks.
Jesse Hoey, Marek Grzes
2011Dynamic State-Space Partitioning in External-Memory Graph Search.
Rong Zhou, Eric A. Hansen
2011Effective Heuristics and Belief Tracking for Planning with Incomplete Information.
Alexandre Albore, Miquel Ramírez, Hector Geffner
2011Efficient Policy Construction for MDPs Represented in Probabilistic PDDL.
Boris Lesner, Bruno Zanuttini
2011Ensemble Monte-Carlo Planning: An Empirical Study.
Alan Fern, Paul Lewis
2011Exploiting the Computational Power of the Graphics Card: Optimal State Space Planning on the GPU.
Damian Sulewski, Stefan Edelkamp, Peter Kissmann
2011Fast Subgoaling for Pathfinding via Real-Time Search.
Carlos Hernández, Jorge A. Baier
2011Generalised Domain Model Acquisition from Action Traces.
Stephen Cresswell, Peter Gregory
2011Heuristic Search for Generalized Stochastic Shortest Path MDPs.
Andrey Kolobov, Mausam, Daniel S. Weld, Hector Geffner
2011Heuristics for Planning with SAT and Expressive Action Definitions.
Jussi Rintanen
2011LPRPG-P: Relaxed Plan Heuristics for Planning with Preferences.
Amanda Jane Coles, Andrew Coles
2011Learning Inadmissible Heuristics During Search.
Jordan Tyler Thayer, Austin J. Dionne, Wheeler Ruml
2011Limits for Compact Representation of Plans.
Christer Bäckström, Peter Jonsson
2011Markov Decision Processes with Ordinal Rewards: Reference Point-Based Preferences.
Paul Weng
2011Online Planning for a Material Control System for Liquid Crystal Display Manufacturing.
Minh Binh Do, Kazumichi Okajima, Serdar Uckun, Fumio Hasegawa, Yukihiro Kawano, Koji Tanaka, Lara S. Crawford, Ying Zhang, Aki Ohashi
2011Organizing Committee.
2011Partial-Order Support-Link Scheduling.
Debdeep Banerjee, Patrik Haslum
2011Planning Multi-Modal Transportation Problems.
José E. Flórez, Álvaro Torralba Arias de Reyna, Javier García, Carlos Linares López, Angel García Olaya, Daniel Borrajo
2011Planning Problems for Social Robots.
Gian Diego Tipaldi, Kai Oliver Arras
2011Planning and Acting in Incomplete Domains.
Christopher Weber, Daniel Bryce
2011Planning for Loosely Coupled Agents Using Partial Order Forward-Chaining.
Jonas Kvarnström
2011Planning to Perceive: Exploiting Mobility for Robust Object Detection.
Javier Vélez, Garrett Hemann, Albert S. Huang, Ingmar Posner, Nicholas Roy
2011Potential Search: A Bounded-Cost Search Algorithm.
Roni Tzvi Stern, Rami Puzis, Ariel Felner
2011Preface.
2011Proceedings of the 21st International Conference on Automated Planning and Scheduling, ICAPS 2011, Freiburg, Germany June 11-16, 2011
Fahiem Bacchus, Carmel Domshlak, Stefan Edelkamp, Malte Helmert
2011Program Committee.
2011Sample-Based Planning for Continuous Action Markov Decision Processes.
Christopher R. Mansley, Ari Weinstein, Michael L. Littman
2011Scalable Scheduling for Hardware-Accelerated Functional Verification.
Michael D. Moffitt, Gernot E. Günther
2011Scaling Up Multiagent Planning: A Best-Response Approach.
Anders Jonsson, Michael Rovatsos
2011Scheduling an Aircraft Repair Shop.
Maliheh Aramon Bajestani, J. Christopher Beck
2011Searching for Plans with Carefully Designed Probes.
Nir Lipovetzky, Hector Geffner
2011The Minimal Seed Set Problem.
Avitan Gefen, Ronen I. Brafman
2011The Multi-Round Balanced Traveling Tournament Problem.
Richard Hoshino, Ken-ichi Kawarabayashi
2011Theoretical Aspects of Scheduling Coupled-Tasks in the Presence of Compatibility Graph.
Gilles Simonin, Rodolphe Giroudeau, Jean-Claude König, Benoît Darties
2011Trade-Offs in Sampling-Based Adversarial Planning.
Raghuram Ramanujan, Bart Selman
2011Visual Programming of Plan Dynamics Using Constraints and Landmarks.
Julie Porteous, Jonathan Teutenberg, David Pizzi, Marc Cavazza
2011When Optimal Is Just Not Good Enough: Learning Fast Informative Action Cost Partitionings.
Erez Karpas, Michael Katz, Shaul Markovitch
2011Where Ignoring Delete Lists Works, Part II: Causal Graphs.
Jörg Hoffmann