发布求助
文献互助 智能选刊 最新文献

Symposium on Combinatorial Search最新文献

筛选
英文 中文
Structural Bias in Heuristic Search (Student Abstract) 启发式搜索中的结构偏差(学生摘要)
Symposium on Combinatorial Search Pub Date : 2023-07-02 DOI: 10.1609/socs.v16i1.27311
Alison Paredes
{"title":"Structural Bias in Heuristic Search (Student Abstract)","authors":"Alison Paredes","doi":"10.1609/socs.v16i1.27311","DOIUrl":"https://doi.org/10.1609/socs.v16i1.27311","url":null,"abstract":"In this line of work, we consider the possibility that some fast heuristic search methods introduce structural bias, which can cause problems similar to sampling-bias for downstream statistical learning methods. We seek to understand the source of this kind of bias and to develop efficient alternatives. Here we present some preliminary results in developing a variation of canonical A* that can overcome the structural bias introduced by first-in-first-out duplicate detection, which we observed under the condition of variable heuristic error. These results inspire a model of greedy-best-first-search for this problem in the satisficing setting. We hope to apply our approach in a novel planning application--activity selection for agent-based modeling for epidemiology--where planning technology should avoid introducing structural bias if possible.","PeriodicalId":425645,"journal":{"name":"Symposium on Combinatorial Search","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124112411","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A Look-Ahead Technique for Search-Based HTN Planning: Reducing the Branching Factor by Identifying Inevitable Task Refinements 基于搜索的HTN规划的前瞻性技术:通过识别不可避免的任务细化来减少分支因素
Symposium on Combinatorial Search Pub Date : 2023-07-02 DOI: 10.1609/socs.v16i1.27284
Conny Olz, P. Bercher
{"title":"A Look-Ahead Technique for Search-Based HTN Planning: Reducing the Branching Factor by Identifying Inevitable Task Refinements","authors":"Conny Olz, P. Bercher","doi":"10.1609/socs.v16i1.27284","DOIUrl":"https://doi.org/10.1609/socs.v16i1.27284","url":null,"abstract":"In HTN planning the choice of decomposition methods used to refine compound tasks is key to finding a valid plan. Based on inferred preconditions and effects of compound tasks, we propose a look-ahead technique for search-based total-order HTN planning that can identify inevitable refinement choices and in some cases dead-ends. The former occurs when all but one decomposition method for some task are proven infeasible for turning a task network into a solution, whereas the latter occurs when all methods are proven infeasible. We show how it can be used for pruning, as well as to strengthen heuristics and to reduce the search branching factor. An empirical evaluation proves its potential as incorporating it improves an existing HTN planner such that it is the currently best performing one in terms of coverage and IPC score.","PeriodicalId":425645,"journal":{"name":"Symposium on Combinatorial Search","volume":"593 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132950250","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Multi-Agent Pathfinding with Predefined Paths: To Wait, or Not to Wait, That Is the Question [Extended Abstract] 具有预定义路径的多智能体寻路:等待，还是不等待，这是一个问题
Symposium on Combinatorial Search Pub Date : 2023-07-02 DOI: 10.1609/socs.v16i1.27306
Jirí Svancara, Etienne Tignon, R. Barták, Torsten Schaub, P. Wanko, R. Kaminski
{"title":"Multi-Agent Pathfinding with Predefined Paths: To Wait, or Not to Wait, That Is the Question [Extended Abstract]","authors":"Jirí Svancara, Etienne Tignon, R. Barták, Torsten Schaub, P. Wanko, R. Kaminski","doi":"10.1609/socs.v16i1.27306","DOIUrl":"https://doi.org/10.1609/socs.v16i1.27306","url":null,"abstract":"Multi-agent pathfinding is the task of navigating a set of agents in a shared environment without collisions. Finding an optimal plan is a computationally hard problem, therefore, one may want to sacrifice optimality for faster computation time. In this paper, we present our preliminary work on finding a valid solution using only a predefined path for each agent with the possibility of adding wait actions. This restriction makes some instances unsolvable, however, we show instances where this approach is guaranteed to find a solution.","PeriodicalId":425645,"journal":{"name":"Symposium on Combinatorial Search","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124015573","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Multi-Agent Path-Finding and Algorithmic Graph Theory (Student Abstract) 多智能体寻径与算法图论(学生摘要)
Symposium on Combinatorial Search Pub Date : 2023-07-02 DOI: 10.1609/socs.v16i1.27308
D. Fairbairn
{"title":"Multi-Agent Path-Finding and Algorithmic Graph Theory (Student Abstract)","authors":"D. Fairbairn","doi":"10.1609/socs.v16i1.27308","DOIUrl":"https://doi.org/10.1609/socs.v16i1.27308","url":null,"abstract":"I specialise in conducting research in Multi-Agent Path-\u0000Finding (MAPF) and Algorithmic Graph Theory. Specifically,\u0000I investigate the impact of geometric constraints on\u0000a given instance of MAPF, as well as the expansion of\u0000MAPF to include resource constraints, target assignment\u0000path-finding (TAPF), and academic problems that are relevant\u0000to industry. In Algorithmic Graph Theory, I extend the\u0000capabilities of standard and novel MAPF solvers to temporal\u0000graphs, and explore clustering techniques and ideas that\u0000utilise Graph Classifications on MAPF domains to reduce\u0000the computational complexity of MAPF. Furthermore, I research\u0000the implementation and application of massively parallelized\u0000computing techniques on MAPF, especially in relation\u0000to distance matrix computation and parallelized centralized\u0000MAPF.\u0000Aside from my PhD research, I have the pleasure to collaborate\u0000with researchers at Tharsus Limited, to directly apply\u0000my research to novel industrial problems and develop\u0000benchmarks that are relevant to both the industry and the research\u0000community for Multi-Agent Systems.","PeriodicalId":425645,"journal":{"name":"Symposium on Combinatorial Search","volume":"100 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130236390","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A Generalization of the Shortest Path Problem to Graphs with Multiple Edge-Cost Estimates (Student Abstract) 将最短路径问题推广到具有多个边成本估计值的图形（学生摘要）
Symposium on Combinatorial Search Pub Date : 2023-07-02 DOI: 10.1609/socs.v16i1.27316
Eyal Weiss
{"title":"A Generalization of the Shortest Path Problem to Graphs with Multiple Edge-Cost Estimates (Student Abstract)","authors":"Eyal Weiss","doi":"10.1609/socs.v16i1.27316","DOIUrl":"https://doi.org/10.1609/socs.v16i1.27316","url":null,"abstract":"The shortest path problem in graphs is a cornerstone of AI theory and applications. Existing algorithms generally ignore edge weight computation time. In this paper we present a generalized framework for weighted directed graphs, where edge weight can be computed (estimated) multiple times, at increasing accuracy and run-time expense. This raises a generalized shortest path problem that optimizes different aspects of path cost and its uncertainty. We describe in high-level a complete anytime algorithm for the generalized problem and discuss possible future extensions.","PeriodicalId":425645,"journal":{"name":"Symposium on Combinatorial Search","volume":"5 1","pages":"206-207"},"PeriodicalIF":0.0,"publicationDate":"2023-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139364358","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Voxel Benchmarks for 3D Pathfinding: Sandstone, Descent, and Industrial Plants 3D寻路的体素基准:砂岩，下降和工业工厂
Symposium on Combinatorial Search Pub Date : 2023-07-02 DOI: 10.1609/socs.v16i1.27283
Thomas K. Nobes, Daniel Damir Harabor, Michael Wybrow, S. Walsh
{"title":"Voxel Benchmarks for 3D Pathfinding: Sandstone, Descent, and Industrial Plants","authors":"Thomas K. Nobes, Daniel Damir Harabor, Michael Wybrow, S. Walsh","doi":"10.1609/socs.v16i1.27283","DOIUrl":"https://doi.org/10.1609/socs.v16i1.27283","url":null,"abstract":"Voxel grids are an increasingly common enabler for pathfinding in 3D spaces. Currently in this area there exists only a limited number of publicly available benchmarks. This makes it difficult to establish state-of-the-art performance and to compare the strengths and weaknesses of competing search techniques. In this work, we introduce three new and diverse sets of voxel benchmarks intended to help fill this gap. We further describe our methodology for generating and selecting a representative set of pathfinding queries. Our dataset comprises 46 distinct voxel maps and 92,000 problem instances. The data is drawn from distinct application domains: computer video games, industrial plant layouts and sandstone porosity scans. Featuring distinctive geometric properties and a variety of challenging query types, these new datasets allow practitioners to evaluate algorithmic performance across a variety of settings encountered when pathfinding in practice.","PeriodicalId":425645,"journal":{"name":"Symposium on Combinatorial Search","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125807207","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Core Expansion in Optimization Crosswords 核心扩展优化填字游戏
Symposium on Combinatorial Search Pub Date : 2023-07-02 DOI: 10.1609/socs.v16i1.27277
A. Botea, V. Bulitko
{"title":"Core Expansion in Optimization Crosswords","authors":"A. Botea, V. Bulitko","doi":"10.1609/socs.v16i1.27277","DOIUrl":"https://doi.org/10.1609/socs.v16i1.27277","url":null,"abstract":"In constraint optimization many problem instances remain challenging to current technology.\u0000We focus on the Romanian Crosswords Competition Problem.\u0000It is a challenging, NP-hard constraint optimization problem\u0000where state-of-the-art AI has been lagging significantly behind top human performance.\u0000We present an approach that first builds a core, a portion of the problem that will \u0000have a high contribution to the objective function.\u0000A core is grown into a seed, a partial solution with\u0000a subset of variables defined and instantiated.\u0000Seeds are further extended into full solutions.\u0000Our approach takes as input the size of a rectangular core to consider,\u0000and the locations of zero or more black cells inside the core.\u0000The results advance state-of-the-art substantially.\u0000We report a boost in the scores obtained, bringing our top solutions\u0000in the vicinity of top human entries.","PeriodicalId":425645,"journal":{"name":"Symposium on Combinatorial Search","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114575450","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Hybrid Search with Graph Neural Networks for Constraint-Based Navigation Planning [Extended Abstract] 基于约束的图神经网络混合搜索导航规划[扩展摘要]
Symposium on Combinatorial Search Pub Date : 2023-07-02 DOI: 10.1609/socs.v16i1.27299
Marc-Emmanuel Coupvent des Graviers, Kevin Osanlou, C. Guettier, T. Cazenave
{"title":"Hybrid Search with Graph Neural Networks for Constraint-Based Navigation Planning [Extended Abstract]","authors":"Marc-Emmanuel Coupvent des Graviers, Kevin Osanlou, C. Guettier, T. Cazenave","doi":"10.1609/socs.v16i1.27299","DOIUrl":"https://doi.org/10.1609/socs.v16i1.27299","url":null,"abstract":"Route planning for autonomous vehicles is a challenging task, especially in dense road networks with multiple delivery points. Additional external constraints can quickly add overhead to this already-difficult problem that often requires prompt, on-the-fly decisions. This work introduces a hybrid method combining machine learning and Constraint Programming (CP) to improve search performance. A new message passing-based graph neural network tailored to constraint solving and global search is defined. Once trained, a single neural network inference is enough to guide CP search while ensuring solution optimality. Large-scale experiments using real road networks from cities worldwide are presented. The hybrid method is effective in solving complex routing problems, addressing larger problems than those used for model training.","PeriodicalId":425645,"journal":{"name":"Symposium on Combinatorial Search","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123512573","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Comparing Front-to-Front and Front-to-End Heuristics in Bidirectional Search 双向搜索中前端到前端和前端到端启发式的比较
Symposium on Combinatorial Search Pub Date : 2023-07-02 DOI: 10.1609/socs.v16i1.27296
Lior Siag, Shahaf S. Shperberg, Ariel Felner, Nathan R Sturtevant
{"title":"Comparing Front-to-Front and Front-to-End Heuristics in Bidirectional Search","authors":"Lior Siag, Shahaf S. Shperberg, Ariel Felner, Nathan R Sturtevant","doi":"10.1609/socs.v16i1.27296","DOIUrl":"https://doi.org/10.1609/socs.v16i1.27296","url":null,"abstract":"Most recent theoretical and algorithmic work in bidirectional heuristic search (BiHS) used front-to-end (F2E) heuristics that estimate the distance to the start and goal states. In this paper, we start exploring front-to-front (F2F) heuristics, which estimate the distance between any pair of states. Devising efficient algorithms that use F2F heuristics is a challenging task. Thus, it is important to first understand the benefits of using F2F heuristics compared to F2E heuristics. To this end, we theoretically and experimentally demonstrate that there is a great potential in using F2F heuristics implying that F2F BiHS is a promising area of future research.","PeriodicalId":425645,"journal":{"name":"Symposium on Combinatorial Search","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115217872","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Searching with Distributional Heuristics (Student Abstract) 基于分布启发式的搜索(学生摘要)
Symposium on Combinatorial Search Pub Date : 2023-07-02 DOI: 10.1609/socs.v16i1.27317
Stephen Wissow
{"title":"Searching with Distributional Heuristics (Student Abstract)","authors":"Stephen Wissow","doi":"10.1609/socs.v16i1.27317","DOIUrl":"https://doi.org/10.1609/socs.v16i1.27317","url":null,"abstract":"Distributional heuristic search uses distributions rather than point values for its heuristic estimates of the cost to goal from any given state. Distributional heuristics are desirable as they provide search algorithms not only with a way to evaluate nodes, but also with a basis for rational decision making tailored to specific search settings. Bounded suboptimal, anytime, and contract searches have differing but related objectives that each lend themselves to probabilistic reasoning supported by distributional heuristics. In many applications, speed of planning can be more important than solution quality. Whether due to certain domains' inherent difficulty, where anything but a satisficing approach is infeasible due to time or memory constraints, or due to the limited planning time available in real-time robotics and other time-sensitive planning settings, important open questions are how best to find solutions as quickly as possible and how to find the best solution possible while subject to an explicit limit on planning time. Successful algorithms must reason not only about solution cost, possibly in relation to a suboptimality bound, but also about the relative likelihood of finding a solution under one node vs. under another, of finding a solution of a particular cost (such as in relation to that of an incumbent solution), or about the expected amount of search effort to find a goal under a given node. This dissertation takes up these issues in four parts. I (1) examine different methods for generating distributional heuristics in bounded cost heuristic search and classical planning; (2) study the contract search setting, which involves online estimation of several unknown values; (3) consider the bounded suboptimal setting; and (4) address the anytime setting.","PeriodicalId":425645,"journal":{"name":"Symposium on Combinatorial Search","volume":"2012 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131937865","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信