Symposium on Combinatorial Search - 2012

该奖项支持美国研究生研究人员参加将于2012年7月19日至21日在加拿大尼亚加拉瀑布举行的2012年组合搜索研讨会（SoCS 2012），就在7月22日至26日在多伦多举行的第26届人工智能会议（AAAI-12）之前。这笔资金将用于支付13名研究生和两名受邀演讲嘉宾的旅费、住宿费和注册费。SoCS 2012将汇集启发式搜索和组合优化的各个方面的研究人员，以及它在人工智能广泛领域的应用，包括鲁棒智能的核心主题，如机器人、规划、约束规划，以及生物信息学等其他领域。作为人工智能研究中最古老的子领域之一，搜索仍在继续增长。它的进步包括实时搜索、并行搜索、使用外部存储器的搜索、使用不一致启发式的方法等。今天，它是解决各种领域问题的核心，如DNA序列的最佳排列和实时导航。SoCS 2012的一个特别焦点是路径规划，这在机器人和计算生物学中很重要。SoCS 2012将包括一个新的基于网格的路径规划竞赛。

This award supports participation of US-based graduate student researchers in the 2012 Symposium on Combinatorial Search (SoCS 2012) to be held July 19-21, 2012 in Niagara Falls, Canada, just prior to the Twenty-Sixth Conference on Artificial Intelligence (AAAI-12) to be held July 22-26 in Toronto. The funds will help defray the travel, lodging, and registration costs for 13 graduate students as well as two invited speakers. SoCS 2012 will bring together researchers in all aspects of heuristic search and combinatorial optimization and its use in a broad range of areas in AI including core topics of Robust Intelligence like robotics, planning, constraint programming, and in other areas of interest across IIS like bioinformatics. One of the oldest subareas of research in AI, search continues to grow. Its advances include real-time search, parallel search, search using external memory, methods for using inconsistent heuristics, etc. Today it is central to solving problems in areas as diverse as optimal alignment of DNA sequences and real-time navigation. A special focus of SoCS 2012 is path-planning, which is important in robotics and computational biology. SoCS 2012 will include a new grid-based path planning competition.