@article{Eiben_Godage_Kanj_Xia_2020, title={On the Problem of Covering a 3-D Terrain}, volume={34}, url={https://ojs.aaai.org/index.php/AAAI/article/view/6603}, DOI={10.1609/aaai.v34i06.6603}, abstractNote={<p>We study the problem of <em>covering</em> a 3-dimensional terrain by a sweeping robot that is equipped with a camera. We model the terrain as a mesh in a way that captures the elevation levels of the terrain; this enables a graph-theoretic formulation of the problem in which the underlying graph is a weighted plane graph. We show that the associated graph problem is NP-hard, and that it admits a polynomial time approximation scheme (PTAS). Finally, we implement two heuristic algorithms based on greedy approaches and report our findings.</p>}, number={06}, journal={Proceedings of the AAAI Conference on Artificial Intelligence}, author={Eiben, Eduard and Godage, Isuru and Kanj, Iyad and Xia, Ge}, year={2020}, month={Apr.}, pages={10361-10368} }