Full Papers
| A Novel Technique for Compressing Pattern Databases in the Pancake Sorting Problems | |
| Morteza Keshtkaran, Roohollah Taghizadeh, Koorush Ziarati |
| A Polynomial-Time Algorithm for Non-Optimal Multi-Agent Pathfinding | |
| Mokhtar M. Khorshid, Robert C. Holte, Nathan R. Sturtevant |
| A Preliminary Evaluation of Machine Learning in Algorithm Selection for Search Problems | |
| Lars Kotthoff, Ian P. Gent, Ian Miguel |
| Scalable Distributed Monte-Carlo Tree Search | |
| Kazuki Yoshizoe, Akihiro Kishimoto, Tomoyuki Kaneko, Haruhiro Yoshimoto, Yutaka Ishikawa |
Abstracts
| Optimal Packing of High-Precision Rectangles | |
| Eric Huang, Richard E. Korf |
| A Novel Technique for Avoiding Plateaus of Greedy Best-First Search in Satisficing Planning | |
| Tatsuya Imai, Akihiro Kishimoto |
| Planning for Landing Site Selection in the Aerial Supply Delivery | |
| Aleksandr Kushleyev, Brian MacAllister, Maxim Likhachev |
| Graduated Fidelity Motion Planning | |
| Mihail Pivtoraiko, Alonzo Kelly |
| On Improving the Quality of Solutions in Large-Scale Cooperative Multi-Agent Pathfinding | |
| Ko-Hsin Cindy Wang, Adi Botea, Philip Kilby |