The simple grid polygon exploration problem

DOI10.1007/s10878-021-00705-5zbMath1468.90117OpenAlexW3126655404MaRDI QIDQ2025057

Yanyan Li

Publication date: 11 May 2021

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-021-00705-5

zbMATH Keywords

competitive analysispath planningmobile roboton-line explorationgrid polygon

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Combinatorial optimization (90C27)

Related Items (2)

An Algorithm to Compute Any Simple $k$-gon of a Maximum Area or Perimeter Inscribed in a Region of Interest ⋮ On-line exploration of rectangular cellular environments with a rectangular hole

Cites Work

• Unnamed Item
• Lower and upper competitive bounds for online directed graph exploration
• Online algorithms for searching and exploration in the plane
• Competitive on-line coverage of grid environments by a mobile robot
• Online graph exploration: New results on old and new algorithms
• Fast collaborative graph exploration
• The Polygon Exploration Problem
• An Improved On-line Strategy for Exploring Unknown Polygons
• How to learn an unknown environment. I
• Mapping Simple Polygons
• Computing and Combinatorics
• Hamiltonian paths in \(L\)-shaped grid graphs
• Exploration of finite 2D square grid by a metamorphic robotic system

This page was built for publication: The simple grid polygon exploration problem