The simple grid polygon exploration problem

Qi Wei (), Jie Sun, Xuehou Tan, Xiaolin Yao and Yonggong Ren ()
Additional contact information
Qi Wei: Liaoning Normal University
Jie Sun: Liaoning Normal University
Xuehou Tan: Tokai University
Xiaolin Yao: Dalian Neusoft University of Information
Yonggong Ren: Liaoning Normal University

Journal of Combinatorial Optimization, 2021, vol. 41, issue 3, No 3, 625-639

Abstract: Abstract This paper considers an on-line exploration problem. We use a mobile robot to explore an unknown simple grid polygon. The robot is assumed to have limited sensing capability that can only detect the four basic cells adjacent to it. The robot’s task is to explore each cell and to return to the start. To explore a cell, the robot has to enter it. We ask for a short exploration tour, that is, minimizing the number of multiple-visit cells. The competitive ratio is used to measure the performance of our strategy. It is the ratio between the length of the on-line exploration path and the length of the shortest path achieved with full knowledge of the polygon. As our main result, we present a new on-line exploration strategy and prove that the robot’s path is at most 7/6 times longer than the shortest path. This matches the previously known lower bound.

Keywords: Path planning; On-line Exploration; Competitive analysis; Grid polygon; Mobile robot (search for similar items in EconPapers)
Date: 2021
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-021-00705-5 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:41:y:2021:i:3:d:10.1007_s10878-021-00705-5

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-021-00705-5

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().