Additional Projects on Heuristic Search
(scroll down for publications)

We also study heuristic search methods other than fast replanning methods, agent-centered search (real-time search) methods, distributed constraint optimization methods and any-angle path planning methods.

Representative Publications

• D. Atzmon, J. Li, A. Felner, E. Nachmani, S. Shperberg, N. Sturtevant and S. Koenig. Multi-Directional Heuristic Search. In International Joint Conference on Artificial Intelligence (IJCAI), 4062-4068, 2020. [downloadable]
  

• J. Han, T. Uras and S. Koenig. Toward a String-Pulling Approach to Path Smoothing on Grid Graphs. In Symposium on Combinatorial Search (SoCS), 106-110, 2020. [downloadable]
  

• L. Cohen, M. Greco, H. Ma, C. Hernandez, A. Felner, S. Kumar and S. Koenig. Anytime Focal Search with Applications. In International Joint Conference on Artificial Intelligence (IJCAI), 1434-1441, 2018. [downloadable]
  

• Z. Wang, L. Cohen, S. Koenig and S. Kumar. The Factored Shortest Path Problem and Its Applications in Robotics [Short Paper]. In International Conference on Automated Planning and Scheduling (ICAPS), 527-531, 2018. [downloadable]
  

• N. Sturtevant, J. Traish, J. Tulip, T. Uras, S. Koenig, B. Strasser, A. Botea, D. Harabor and S. Rabin. The Grid-Based Path Planning Competition: 2014 Entries and Results. In Symposium on Combinatorial Search (SoCS), 241ff, 2015. [downloadable]
  

• T. Uras and S. Koenig. Identifying Hierarchies for Fast Optimal Search. In AAAI Conference on Artificial Intelligence (AAAI), 2014. [downloadable]
  

• M. Phillips, M. Likhachev and S. Koenig. PA*SR: Parallel A* for Slow Expansions. In International Conference on Automated Planning and Scheduling (ICAPS), 2014. [downloadable]
  

• T. Uras, S. Koenig and C. Hernandez. Subgoal Graphs for Optimal Pathfinding in Eight-Neighbor Grids. In International Conference on Automated Planning and Scheduling (ICAPS), 2013. [downloadable]
  

• X. Sun, W. Yeoh, P. Chen and S. Koenig. Simple Optimization Techniques for A*-Based Search. In International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS), 931-936, 2009. [downloadable]
  

• P. Haslum, A. Botea, M. Helmert, B. Bonet and S. Koenig. Domain-Independent Construction of Pattern Database Heuristics for Cost-Optimal Planning. In AAAI Conference on Artificial Intelligence (AAAI), 1007-1012, 2007. [downloadable]
  

• D. Furcy and S. Koenig. Limited Discrepancy Beam Search. In International Joint Conference on Artificial Intelligence (IJCAI), 125-131, 2005. [downloadable]
  

• D. Furcy and S. Koenig. Scaling up WA* with Commitment and Diversity [Short Paper]. In International Joint Conference on Artificial Intelligence (IJCAI), 1521-1522, 2005. [downloadable]
  

• S. Koenig and Y. Liu. Sensor Planning with Non-Linear Utility Functions. In European Conference on Planning (ECP), 265-277, Springer, 1999. [downloadable]
  

Dissertation

• D. Furcy. Speeding up the Convergence of Online Heuristic Search and Scaling up Offline Heuristic Search. PhD thesis, College of Computing, Georgia Institute of Technology, Atlanta (Georgia), 2004. [downloadable]
  

Many publishers do not want authors to make their papers available electronically after the papers have been published. Please use the electronic versions provided here only if hardcopies are not yet available. If you have comments on any of these papers, please send me an email! Also, please send me your papers if we have common interests.

This page was automatically created by a bibliography maintenance system that was developed as part of an undergraduate research project, advised by Sven Koenig.

Home Page of Sven Koenig