利用矩形孔在线探索矩形蜂窝环境

IF 0.7 4区计算机科学 Q4 COMPUTER SCIENCE, INFORMATION SYSTEMS

Information Processing Letters Pub Date : 2024-01-09 DOI:10.1016/j.ipl.2023.106470

Qi Wei , Xiaolin Yao , Wenxin Zhang , Ruiyue Zhang , Yonggong Ren

{"title":"利用矩形孔在线探索矩形蜂窝环境","authors":"Qi Wei , Xiaolin Yao , Wenxin Zhang , Ruiyue Zhang , Yonggong Ren","doi":"10.1016/j.ipl.2023.106470","DOIUrl":null,"url":null,"abstract":"<div>This paper considers the problem of exploring an unknown rectangular cellular environment with a rectangular hole using a mobile robot. The robot's task is to visit each cell at least once and return to the start. The robot has limited visibility that can only detect four cells adjacent to it. And it has large amount of memory that can store a map of discovered cells. The goal of this work is to find the shortest exploration tour, that is, minimizing the total number of multiple visited cells. We consider the environment in four possible scenarios: rectangular, L-shaped, C-shaped or O-shaped grid polygon. An on-line strategy has been proposed for these scenarios. We prove that it is optimal for rectangular, L-shaped, C-shaped grid polygon, and is 4/3-competitive for O-shaped grid polygon.</div>","PeriodicalId":56290,"journal":{"name":"Information Processing Letters","volume":"185 ","pages":"Article 106470"},"PeriodicalIF":0.7000,"publicationDate":"2024-01-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"On-line exploration of rectangular cellular environments with a rectangular hole\",\"authors\":\"Qi Wei , Xiaolin Yao , Wenxin Zhang , Ruiyue Zhang , Yonggong Ren\",\"doi\":\"10.1016/j.ipl.2023.106470\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div>This paper considers the problem of exploring an unknown rectangular cellular environment with a rectangular hole using a mobile robot. The robot's task is to visit each cell at least once and return to the start. The robot has limited visibility that can only detect four cells adjacent to it. And it has large amount of memory that can store a map of discovered cells. The goal of this work is to find the shortest exploration tour, that is, minimizing the total number of multiple visited cells. We consider the environment in four possible scenarios: rectangular, L-shaped, C-shaped or O-shaped grid polygon. An on-line strategy has been proposed for these scenarios. We prove that it is optimal for rectangular, L-shaped, C-shaped grid polygon, and is 4/3-competitive for O-shaped grid polygon.</div>\",\"PeriodicalId\":56290,\"journal\":{\"name\":\"Information Processing Letters\",\"volume\":\"185 \",\"pages\":\"Article 106470\"},\"PeriodicalIF\":0.7000,\"publicationDate\":\"2024-01-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Information Processing Letters\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0020019023001138\",\"RegionNum\":4,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Information Processing Letters","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0020019023001138","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}

引用次数: 0

摘要

本文探讨的问题是使用移动机器人探索一个带有矩形洞的未知矩形单元环境。机器人的任务是至少访问每个单元格一次，然后返回起点。机器人的能见度有限，只能探测到与其相邻的四个单元。它有大量内存，可以存储已发现单元的地图。这项工作的目标是找到最短的探索行程，即尽可能减少多次访问小区的总次数。我们考虑了四种可能的环境：矩形、L 形、C 形或 O 形网格多边形。针对这些情况，我们提出了一种在线策略。我们证明，对于矩形、L 形、C 形网格多边形，该策略是最优的；对于 O 形网格多边形，该策略具有 4/3 的竞争性。

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

查看原文本刊更多论文

On-line exploration of rectangular cellular environments with a rectangular hole

This paper considers the problem of exploring an unknown rectangular cellular environment with a rectangular hole using a mobile robot. The robot's task is to visit each cell at least once and return to the start. The robot has limited visibility that can only detect four cells adjacent to it. And it has large amount of memory that can store a map of discovered cells. The goal of this work is to find the shortest exploration tour, that is, minimizing the total number of multiple visited cells. We consider the environment in four possible scenarios: rectangular, L-shaped, C-shaped or O-shaped grid polygon. An on-line strategy has been proposed for these scenarios. We prove that it is optimal for rectangular, L-shaped, C-shaped grid polygon, and is 4/3-competitive for O-shaped grid polygon.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Information Processing Letters 工程技术-计算机：信息系统

CiteScore

1.80

自引率

0.00%

发文量

审稿时长

7.3 months

期刊介绍： Information Processing Letters invites submission of original research articles that focus on fundamental aspects of information processing and computing. This naturally includes work in the broadly understood field of theoretical computer science; although papers in all areas of scientific inquiry will be given consideration, provided that they describe research contributions credibly motivated by applications to computing and involve rigorous methodology. High quality experimental papers that address topics of sufficiently broad interest may also be considered. Since its inception in 1971, Information Processing Letters has served as a forum for timely dissemination of short, concise and focused research contributions. Continuing with this tradition, and to expedite the reviewing process, manuscripts are generally limited in length to nine pages when they appear in print.