首页
文献服务
文献资源
外文期刊
外文会议
中文期刊
专业机构
智能制造
高级检索
版权声明
使用帮助
会议文集
会议名
14th International Symposium on Combinatorial Search (SoCS 2021)
中译名
《第十四届国际组合搜索专题讨论会》
机构
Association for the Advancement of Artificial Intelligence (AAAI)
会议日期
26-30 July 2021
会议地点
Gugangzhou, China
出版年
2021
馆藏号
340507
题名
作者
出版年
Exploiting Learned Policies in Focal Search
Pablo Araneda; Matias Greco; Jorge A. Baier
2021
A New Boolean Encoding for MAPF and Its Performance with ASP and MaxSAT Solvers
Roberto Asin Acha; Rodrigo Lopez; Sebastian Hagedorn; Jorge A. Baier
2021
Scaling Up Search with Partial Initial States in Optimization Crosswords
Adi Botea; Vadim Bulitko
2021
Counting Vertex-Disjoint Shortest Paths in Graphs
Adi Botea; Massimiliano Mattetti; Akihiro Kishimoto; Radu Marinescu; Elizabeth Daly
2021
Fast Bounded Suboptimal Probabilistic Planning with Clear Preferences on Missing Information
Ishani Chatterjee; Tushar Kusnur; Maxim Likhachev
2021
Generalized Conflict-directed Search for Optimal Ordering Problems
Jingkai Chen; Yuening Zhang; Cheng Fang; Brian C. Williams
2021
A Measure of Quality for IDA* Heuristics
Robert K. P. Clausecker; Florian Schintke
2021
Revisiting the Complexity Analysis of Conflict-Based Search: New Computational Techniques and Improved Bounds
Ofir Gordon; Yuval Filmus; Oren Salzman
2021
Finding the Exact Diameter of a Graph with Partial Breadth-First Searches
Richard E. Korf
2021
Customised Shortest Paths Using a Distributed Reverse Oracle
Arthur Maheo; Shizhe Zhao; Afzaal Hassan; Daniel Harabor; Peter J. Stuckey; Mark Wallace
2021
Learning-based Synthesis of Social Laws in STRIPS
Ronen Nir; Alexander Shleyfman; Erez Karpas
2021
SOLO: Search Online, Learn Offline for Combinatorial Optimization Problems
Joel Oren; Chana Ross; Maksym Lefarov; Felix Richter; Ayal Taitler; Zohar Feldman; Dotan Di Castro; Christian Daniel
2021
Suboptimally Solving the Watchman Route Problem on a Grid with Heuristic Search
Tamir Yaffe; Shawn Skyler; Ariel Felner
2021
On the Benefits of Randomly Adjusting Anytime Weighted A*
Abhinav Bhatia; Justin Svegliato; Shlomo Zilberstein
2021
The Closed List Is an Obstacle Too
Ariel Felner; Shahaf S. Shperberg; Hadar Buzhish
2021
Experimental Evaluation of Classical Multi Agent Path Finding Algorithms
Omri Kaduri; Eli Boyarski; Roni Stern
2021
Pattern Databases for Stochastic Shortest Path Problems
Thorsten Klossner; Jorg Hoffmann
2021
Towards Narrowing the Search in Bounded-Suboptimal Safe Interval Path Planning
Tomas Rybecky; Miroslav Kulich; Anton Andreychuk; Konstantin Yakovlev
2021
Bi-objective Search with Bi-directional A*
Saman Ahmadi; Guido Tack; Daniel Harabor; Philip Kilby
2021
Improving Continuous-time Conflict Based Search
Anton Andreychuk; Konstantin Yakovlev; Eli Boyarski; Roni Stern
2021
1
2
3
©2016机械工业出版社(机械工业信息研究院) 京ICP备05055788号-35