Weighted group search on the disk & improved lower bounds for priority evacuation

IF 1.1 3区计算机科学 Q1 BUSINESS, FINANCE

Journal of Computer and System Sciences Pub Date : 2025-05-15 DOI:10.1016/j.jcss.2025.103678

Konstantinos Georgiou, Xin Wang

{"title":"Weighted group search on the disk & improved lower bounds for priority evacuation","authors":"Konstantinos Georgiou, Xin Wang","doi":"10.1016/j.jcss.2025.103678","DOIUrl":null,"url":null,"abstract":"<div><div>We study <em>weighted group search on a disk</em>, where two unit-speed agents must locate a hidden target exactly distance 1 away (within a unit-radius disk), starting from the same point. Agents share findings instantly via the <em>wireless</em> model. The goal is to minimize the worst-case <em>weighted average</em> of their arrival times, with one agent weighted 1 and the other <span><math><mi>w</mi><mo>∈</mo><mo>[</mo><mn>0</mn><mo>,</mo><mn>1</mn><mo>]</mo></math></span>. This problem extends prior work on search on a line (with known optimal strategies) and the <em>priority evacuation</em> problem, which corresponds to <span><math><mi>w</mi><mo>=</mo><mn>0</mn></math></span> and still has a notable gap between upper and lower bounds. Our contributions are the following: (1) Upper bounds for all <em>w</em>, using refined known techniques. (2) A novel lower-bound framework using linear programming, inspired by metric embeddings, and (3) Improved bounds for priority evacuation, raising the lower bound from 4.38962 to 4.56798.</div></div>","PeriodicalId":50224,"journal":{"name":"Journal of Computer and System Sciences","volume":"154 ","pages":"Article 103678"},"PeriodicalIF":1.1000,"publicationDate":"2025-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Computer and System Sciences","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0022000025000601","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"BUSINESS, FINANCE","Score":null,"Total":0}

引用次数: 0

Abstract

We study weighted group search on a disk, where two unit-speed agents must locate a hidden target exactly distance 1 away (within a unit-radius disk), starting from the same point. Agents share findings instantly via the wireless model. The goal is to minimize the worst-case weighted average of their arrival times, with one agent weighted 1 and the other

w \in [0, 1]

. This problem extends prior work on search on a line (with known optimal strategies) and the priority evacuation problem, which corresponds to

w = 0

and still has a notable gap between upper and lower bounds. Our contributions are the following: (1) Upper bounds for all w, using refined known techniques. (2) A novel lower-bound framework using linear programming, inspired by metric embeddings, and (3) Improved bounds for priority evacuation, raising the lower bound from 4.38962 to 4.56798.

查看原文本刊更多论文

磁盘上的加权群搜索&改进的优先疏散下界

我们研究了磁盘上的加权群搜索，其中两个单位速度代理必须从同一点出发，在距离为1的距离（在单位半径的磁盘内）找到一个隐藏目标。代理们通过无线模型即时分享发现。目标是最小化它们到达时间的最坏情况加权平均值，其中一个代理的权重为1，另一个代理w∈[0,1]。该问题扩展了先前的在线搜索工作（具有已知的最优策略）和优先级疏散问题，该问题对应于w=0，并且在上界和下界之间仍然存在明显的差距。我们的贡献如下：(1)所有w的上界，使用改进的已知技术。(2)基于度量嵌入的线性规划框架；(3)改进了优先级疏散的下限，将下限从4.38962提高到4.56798。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Journal of Computer and System Sciences 工程技术-计算机：理论方法

CiteScore

3.70

自引率

0.00%

发文量

审稿时长

68 days

期刊介绍： The Journal of Computer and System Sciences publishes original research papers in computer science and related subjects in system science, with attention to the relevant mathematical theory. Applications-oriented papers may also be accepted and they are expected to contain deep analytic evaluation of the proposed solutions. Research areas include traditional subjects such as: • Theory of algorithms and computability • Formal languages • Automata theory Contemporary subjects such as: • Complexity theory • Algorithmic Complexity • Parallel & distributed computing • Computer networks • Neural networks • Computational learning theory • Database theory & practice • Computer modeling of complex systems • Security and Privacy.