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

An improved algorithm for computing a shortest watchman route for lines

  • Published:2018-03 Issue: Volume:131 Page:51-54
  • ISSN:0020-0190
  • Container-title:Information Processing Letters
  • language:en
  • Short-container-title:Information Processing Letters

Author:

Tan Xuehou,Jiang Bo

Funder

JPSP KAKENHI

National Natural Science Foundation of China

Publisher

Elsevier BV

Subject

Computer Science Applications,Information Systems,Signal Processing,Theoretical Computer Science

Reference10 articles.

1. Optimum watchman routes;Chin;Inf. Process. Lett.,1988

2. Introduction to Algorithm;Cormen,2009

3. Touring a sequence of polygons;Dror,2013

4. Watchman routes for lines and line segments;Dumitrescu;Comput. Geom.,2014

5. The traveling salesman problem for lines in the plane;Jonsson;Inf. Process. Lett.,2002

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

1. A Diffusion-Based Reactive Approach to Road Network Cooperative Persistent Surveillance;IEEE Transactions on Intelligent Transportation Systems;2023

2. Towards a Continuous Solution of the $d$-Visibility Watchman Route Problem in a Polygon With Holes;IEEE Robotics and Automation Letters;2022-07

3. Pheromone-Diffusion-based Conscientious Reactive Path Planning for Road Network Persistent Surveillance*;2021 IEEE International Conference on Robotics and Automation (ICRA);2021-05-30

4. Coverage Path Planning (CPP);Multi-robot Exploration for Environmental Monitoring;2020

5. Graphs with equal domination and covering numbers;Journal of Combinatorial Optimization;2019-10-25
同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3