Off-line exploration of rectangular cellular environments with a rectangular obstacle
From MaRDI portal
Publication:5058395
DOI10.1080/10556788.2021.1977811OpenAlexW3206618188MaRDI QIDQ5058395
Publication date: 20 December 2022
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556788.2021.1977811
Hamiltonian cyclegrid graphexploration problemlongest simple cycleoptimal exploration tourrectangular cellular environments with a rectangular obstacle
Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Distance in graphs (05C12)
Related Items (2)
The Hamiltonicity and Hamiltonian-connectivity of solid supergrid graphs ⋮ On-line exploration of rectangular cellular environments with a rectangular hole
Cites Work
- An approximation algorithm for the longest cycle problem in solid grid graphs
- Watchman routes under limited visibility
- The traveling salesman problem on grids with forbidden neighborhoods
- Approximation algorithms for lawn mowing and milling
- Linear-time algorithms for finding Hamiltonian and longest \((s,t)\)-paths in \(C\)-shaped grid graphs
- Fast collaborative graph exploration
- A linear-time algorithm for finding Hamiltonian \((s,t)\)-paths in even-sized rectangular grid graphs with a rectangular hole
- An approximation algorithm for the longest path problem in solid grid graphs
- An Improved Strategy for Exploring a Grid Polygon
- Hamilton Paths in Grid Graphs
- Computing and Combinatorics
- Hamiltonian paths in \(L\)-shaped grid graphs
This page was built for publication: Off-line exploration of rectangular cellular environments with a rectangular obstacle
