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

DOI10.1016/J.IPL.2023.106470MaRDI QIDQ6195347zbMATH OpenOpenAlexFDO

Authors Qi Wei, Xiaolin Yao, Wen-Xin Zhang, Ruiyue Zhang, Yonggong Ren

Publication date 13 March 2024

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2023.106470

zbMATH Keywords

computational geometrymobile robotrectangular holeon-line explorationgrid polygon

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• A linear-time algorithm for finding Hamiltonian (s,t)-paths in even-sized rectangular grid graphs with a rectangular hole
• A local strategy for cleaning expanding cellular domains by simple robots
• Approximation algorithms for lawn mowing and milling
• Competitive on-line coverage of grid environments by a mobile robot
• Computing and Combinatorics
• Grid exploration by a swarm of autonomous robots with minimum repetitions
• Hamilton Paths in Grid Graphs
• Linear-time algorithms for finding Hamiltonian and longest \((s,t)\)-paths in \(C\)-shaped grid graphs
• Not being (super)thin or solid is hard: A study of grid Hamiltonicity
• Off-line exploration of rectangular cellular environments with a rectangular obstacle
• Online algorithms for searching and exploration in the plane
• Online graph exploration on trees, unicyclic graphs and cactus graphs
• The simple grid polygon exploration problem
• The traveling salesman problem on grids with forbidden neighborhoods
• Watchman routes under limited visibility
• Worst-case optimal exploration of terrains with obstacles

Cited in

(1)

• On-line exploration of an unbounded region with one obstacle

This page was built for publication: On-line exploration of rectangular cellular environments with a rectangular hole

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6195347)