Preface

Daniel Borrajo, Ariel Felner, Richard E. Korf, Maxim Likhachev, Carlos Linares López, Wheeler Ruml, Nathan SturtevantProceedings of the International Symposium on Combinatorial Search 2021 · DOI

Introduction

The Fifth International Symposium on Combinatorial Search (SoCS 2012), held in Niagara Falls, Canada, served as a pivotal gathering for researchers dedicated to the theory and practice of search algorithms. As a specialized venue, SoCS has historically aimed to foster "cross-fertilization" between various sub-disciplines, including pathfinding, planning, and optimization. The 2012 proceedings reflect a field in transition, balancing established heuristic search techniques with emerging trends in Monte-Carlo methods and standardized benchmarking.

The Curation and Review Process

To maintain the high academic standards of the symposium, the 2012 organizers implemented a rigorous peer-review framework. Each of the 55 submissions was evaluated by at least three anonymous experts from a Program Committee of 38 members, supplemented by 11 additional reviewers.

A notable aspect of the 2012 process was the management of potential conflicts of interest. Papers submitted by the conference chairs were only eligible for acceptance if the primary research was student-led. To ensure impartiality, these specific submissions were handled independently by an external coordinator, Rong Zhou. This process resulted in a highly selective program: only 18 papers were chosen for oral presentation (an approximately 32% acceptance rate), alongside 12 poster presentations.

Program Highlights and Cross-Fertilization

The symposium's structure was designed to bridge the gap between niche search research and the broader AI community. This was achieved through several key initiatives:

  • Cross-Fertilization Posters: The program included nine posters representing high-quality work previously accepted at other top-tier AI venues, allowing for the dissemination of ideas across traditional disciplinary boundaries.
  • The Grid-based Path Planning Competition (GPPC): Addressing the community's need for standardized evaluation, the GPPC provided a structured environment to compare algorithmic efficiency and optimality. The competition resulted in seven dedicated papers describing diverse approaches to grid-based navigation.
  • Journal Integration: To accelerate the archival of conference-level insights, the symposium established a "fast-track" pipeline for selected papers to be published in the AI Communications journal.

Intellectual Frontiers: Invited Talks

Two invited talks highlighted the theoretical and practical frontiers of the field in 2012:

  1. Single-Agent Monte-Carlo Tree Search (MCTS): Tristan Cazenave explored the expansion of MCTS beyond its famous applications in game-playing (such as Go) into more general combinatorial search problems. This signaled the rising importance of simulation-based search in the early 2010s.
  2. Heuristics vs. Blind Search: Stefan Edelkamp addressed the fundamental trade-offs between informed (heuristic) and uninformed (blind) search. This talk revisited the philosophical and technical core of the community, questioning when and why specific search paradigms outperform others.

Fostering the Next Generation

The 2012 symposium placed a significant emphasis on student development. Through NSF-funded scholarships, the organizers supported the attendance of the next generation of researchers. Recognition was also formalized through "Best Paper" and "Best Student Paper" awards. Notably, the winner of the Best Paper award was invited to present their work at AAAI-12, further integrating the specialized SoCS community with the wider artificial intelligence landscape.

Conclusion

The SoCS 2012 proceedings document a period of rigorous growth and community building. By combining competitive benchmarking through the GPPC with high-level theoretical discourse, the symposium reinforced its role as a vital hub for the search community. The emphasis on student leadership and cross-venue collaboration ensured that the insights shared in Niagara Falls would have a lasting impact on the trajectory of combinatorial search research.

Summary updated

Abstract

Preface to the Proceedings of the Fifth Annual Symposium on Combinatorial Search held in Niagara Falls, Canada, July 2012.
BibTeX
@inproceedings{borrajo2021preface,
  author = {Daniel Borrajo and Ariel Felner and Richard E. Korf and Maxim Likhachev and Carlos Linares López and Wheeler Ruml and Nathan Sturtevant},
  title = {{Preface}},
  booktitle = {Proceedings of the International Symposium on Combinatorial Search},
  year = {2021},
  doi = {10.1609/socs.v3i1.18231},
}
Figure