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

DOI10.1016/j.ipl.2023.106470OpenAlexW4390729254MaRDI QIDQ6195347

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

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

mobile robotcomputational geometryrectangular holeon-line explorationgrid polygon

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

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

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