Conflict-Based Local Search for Minimum Partition into Plane Subgraphs

被引：0
|
作者：
Spalding-Jamieson, Jack [1 ]
Zhang, Brandon [2 ]
Zheng, Da Wei [3 ]
机构：
[1] David R. Cheriton School of Computer Science, University of Waterloo, Canada
[2] Vancouver, Canada
[3] Department of Computer Science, University of Illinois at Urbana-Champaign, IL, United States
来源：
Leibniz International Proceedings in Informatics, LIPIcs | 2022年 / 224卷
关键词：
921.4 Combinatorial Mathematics; Includes Graph Theory; Set Theory - 921.5 Optimization Techniques;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
15
引用
收藏
相关论文
共 50 条
  • [21] Conflict-Based Steiner Search for Multi-Agent Combinatorial Path Finding
    Ren, Zhongqiang
    Rathinam, Sivakumar
    Choset, Howie
    [J]. ROBOTICS: SCIENCE AND SYSTEM XVIII, 2022,
  • [22] Finding Optimal Solutions to Token Swapping by Conflict-based Search and Reduction to SAT
    Surynek, Pavel
    [J]. 2018 IEEE 30TH INTERNATIONAL CONFERENCE ON TOOLS WITH ARTIFICIAL INTELLIGENCE (ICTAI), 2018, : 592 - 599
  • [23] Incremental Conflict-Based Search for Multi-agent Path Finding in Dynamic Environment
    Wang, Yu
    Shi, Yuhong
    Liu, Jianyi
    Zheng, Xinhu
    [J]. ARTIFICIAL INTELLIGENCE APPLICATIONS AND INNOVATIONS, PT IV, AIAI 2024, 2024, 714 : 349 - 359
  • [24] Combining Abduction with Conflict-based Diagnosis
    Flesch, Ildiko
    Lucas, Peter J. F.
    [J]. ECAI 2008, PROCEEDINGS, 2008, 178 : 807 - +
  • [25] Parallel Hierarchical Composition Conflict-Based Search for Optimal Multi-Agent Pathfinding
    Lee, Hannah
    Motes, James
    Morales, Marco
    Amato, Nancy M.
    [J]. IEEE ROBOTICS AND AUTOMATION LETTERS, 2021, 6 (04) : 7001 - 7008
  • [26] Learning to Resolve Conflicts for Multi-Agent Path Finding with Conflict-Based Search
    Huang, Taoan
    Koenig, Sven
    Dilkina, Bistra
    [J]. THIRTY-FIFTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, THIRTY-THIRD CONFERENCE ON INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE AND THE ELEVENTH SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE, 2021, 35 : 11246 - 11253
  • [27] Suboptimal Variants of the Conflict-Based Search Algorithm for the Multi-Agent Pathfinding Problem
    Barer, Max
    Sharon, Guni
    Stern, Roni
    Felner, Ariel
    [J]. 21ST EUROPEAN CONFERENCE ON ARTIFICIAL INTELLIGENCE (ECAI 2014), 2014, 263 : 961 - +
  • [28] Finding optimal subgraphs by local search
    Shimozono, S
    [J]. THEORETICAL COMPUTER SCIENCE, 1997, 172 (1-2) : 265 - 271
  • [29] Conflict-based selection of branching rules
    Herbstritt, M
    Becker, B
    [J]. THEORY AND APPLICATIONS OF SATISFIABILITY TESTING, 2004, 2919 : 441 - 451
  • [30] MINIMUM FACE-SPANNING SUBGRAPHS OF PLANE GRAPHS
    Patwary, Md. Mostofa Ali
    Rahman, Md. Saidur
    [J]. AKCE INTERNATIONAL JOURNAL OF GRAPHS AND COMBINATORICS, 2010, 7 (02) : 133 - 150
12345