Selected papers
- Anytime search in dynamic graphs, Likhachev et al. AIJ 172 (2008).
- From One to Many: Planning for Loosely Coupled Multi-Agent Systems, Ronen I. Brafman, Carmel Domshlak. ICAPS 2008.
- Causal Graphs and Structurally Restricted Planning, Hubie Chen, Omer Giménez. ICAPS 2008.
- Additive-Disjunctive Heuristics for Optimal Planning, Andrew Coles, Maria Fox, Derek Long, Amanda Smith. ICAPS 2008.
- A Hybrid Relaxed Planning Graph-LP Heuristic for Numeric Planning Domains, Andrew Coles, Maria Fox, Derek Long, Amanda Smith. ICAPS 2008.
- Learning Relational Decision Trees for Guiding Heuristic Planning, Tomás de la Rosa, Sergio Jiménez, Daniel Borrajo. ICAPS 2008.
- In Search of the Tractability Boundary of Planning Problems, Omer Giménez, Anders Jonsson. ICAPS 2008.
- A New Approach to Tractable Planning, Patrik Haslum. ICAPS 2008.
- Unifying the Causal Graph and Additive Heuristics, Malte Helmert, Héctor Geffner. ICAPS 2008.
- Optimal Additive Composition of Abstraction-based Admissible Heuristics, Michael Katz, Carmel Domshlak. ICAPS 2008.
- Structural Patterns Heuristics via Fork Decomposition, Michael Katz, Carmel Domshlak. ICAPS 2008.
- Angelic Hierarchical Planning: Optimal and Online Algorithms, Bhaskara Marthi, Stuart Russell, Jason Wolfe. ICAPS 2008.
- Learning Heuristic Functions through Approximate Linear Programming, Marek Petrik, Shlomo Zilberstein. ICAPS 2008.
- P3C: A New Algorithm for the Simple Temporal Problem, Léon Planken, Mathijs de Weerdt, Roman van der Krogt. ICAPS 2008.
- Using Constraint Networks on Timelines to Model and Solve Planning and Scheduling Problems, Cédric Pralet, Gérard Verfaillie. ICAPS 2008.
- The Complexity of Optimal Planning and a More Efficient Method for Finding Solutions, Katrina Ray, Matthew L. Ginsberg. ICAPS 2008.
- Effective Information Value Calculation for Interruption Management in Multi-Agent Scheduling, David Sarne, Barbara J. Grosz, Peter Owotoki. ICAPS 2008.
- Fast Dynamic Scheduling of Disjunctive Temporal Constraint Networks through Incremental Compilation, Julie A. Shah, Brian C. Williams. ICAPS 2008.
- Efficient ADD Operations for Point-Based Algorithms, Guy Shani, Pascal Poupart, Ronen I. Brafman, Solomon E. Shimony. ICAPS 2008.
- Faster than Weighted A*: An Optimistic Approach to Bounded Suboptimal Search, Jordan T. Thayer, Wheeler Ruml. ICAPS 2008.
- Fast and Memory-Efficient Multi-Agent Pathfinding, Ko-Hsin Cindy Wang, Adi Botea. ICAPS 2008.
- Dynamic Control in Path-Planning with Real-Time Heuristic Search,
Vadim Bulitko, Yngvi Bjornsson, Mitja Lustrek, Jonathan Schaeffer, Sverrir Sigmundarson. ICAPS 2007.
- Online Planning for Resource Production in Real-Time Strategy Games,
Hei Chan, Alan Fern, Soumya Ray, Nick Wilson, Chris Ventura. ICAPS 2007.
- Act Local, Think Global: Width Notions for Tractable Planning,
Hubie Chen, Omer Gimenez. ICAPS 2007.
- External Memory Value Iteration,
Stefan Edelkamp, Shahid Jabbar, Blai Bonet. ICAPS 2007.
- On the Hardness of Planning Problems With Simple Causal Graphs,
Anders Jonsson, Omer Gimenez. ICAPS 2007.
- Flexible Abstraction Heuristics for Optimal Sequential Planning,
Malte Helmert, Patrik Haslum, Joerg Hoffmann. ICAPS 2007.
- Temporally-expressive Planning as Constraint Satisfaction Problems,
Yuxiao Hu. ICAPS 2007.
- Structural Patterns of Tractable Sequentially-Optimal Planning,
Michael Katz, Carmel Domshlak. ICAPS 2007.
- Angelic Semantics for High-level Actions,
Bhaskara Marthi, Jason Wolfe, Stuart Russell. ICAPS 2007.
- From Conformant into Classical Planning: Efficient Translations That May be Complete Too,
Hector Palacios, Hector Geffner. ICAPS 2007.
- Managing Personal Tasks with Time Constraints and Preferences,
Ioannis Refanidis. ICAPS 2007.
- Approximate Solution Techniques for Factored First-order MDPs,
Scott Sanner, Craig Boutilier. ICAPS 2007.
- Discovering Relational Domain Features for Probabilistic Planning,
Jia-Hong Wu, Bob Givan. ICAPS 2007.
ICAPS 2008
ICAPS 2007
Homepages of selected researchers:
ICAPS 2006
ICAPS 2005
ICAPS 2004
|