Computational geometry column 59-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

Computational geometry column 59

Published:2014-06-09 Issue:2 Volume:45 Page:68-72
ISSN:0163-5700
Container-title:ACM SIGACT News
language:en
Short-container-title:SIGACT News

Author:

Dumitrescu Adrian¹,Tóth Csaba D.²

Affiliation:

1. University of Wisconsin{Milwaukee

2. California State University Northridge, Los Angeles, CA and Tufts University, Medford, MA

Abstract

This column is about patrolling problems in a geometric network. Mobile agents patrol a road network, and have to visit every point in the network as frequently as possible. The goal is finding a schedule that minimizes the idle time, i.e., the maximum time between two consecutive visits of some agent over all points in the network.

Publisher

Association for Computing Machinery (ACM)

Link

https://dl.acm.org/doi/pdf/10.1145/2636805.2636822

Reference14 articles.

1. Multi-robot perimeter patrol in adversarial settings

2. The Lonely Runner with Seven Runners

3. Six Lonely Runners

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Simple strategies versus optimal schedules in multi-agent patrolling;Theoretical Computer Science;2020-11

2. Problems on track runners;Computational Geometry;2020-06

3. Approximation Algorithms for Barrier Sweep Coverage;International Journal of Foundations of Computer Science;2019-04

4. Approximation algorithm for sweep coverage on graph;Information Processing Letters;2015-09

5. Simple Strategies Versus Optimal Schedules in Multi-agent Patrolling;Lecture Notes in Computer Science;2015

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP