论文信息 - The simple grid polygon exploration problem - 字舞流文

The simple grid polygon exploration problem

Xuehou Tan | Qi Wei | Yonggong Ren | Xiaolin Yao | Jie Sun

[1] Roger Wattenhofer,et al. Lower and upper competitive bounds for online directed graph exploration , 2016, Theor. Comput. Sci..

[2] Lúcia Valéria Ramos de Arruda,et al. Bio-inspired on-line path planner for cooperative exploration of unknown environment by a Multi-Robot System , 2019, Robotics Auton. Syst..

[3] Rolf Klein,et al. The Polygon Exploration Problem , 2001, SIAM J. Comput..

[4] Jérémie Chalopin,et al. Mapping Simple Polygons: The Power of Telling Convex from Reflex , 2015, TALG.

[5] Rolf Klein,et al. Online algorithms for searching and exploration in the plane , 2010, Comput. Sci. Rev..

[6] Alireza Bagheri,et al. Hamiltonian paths in L-shaped grid graphs , 2016, Theor. Comput. Sci..

[7] Elon Rimon,et al. Competitive on-line coverage of grid environments by a mobile robot , 2003, Comput. Geom..

[8] Cyrill Stachniss,et al. Robust exploration and homing for autonomous robots , 2017, Robotics Auton. Syst..

[9] Kurt Mehlhorn,et al. Online graph exploration: New results on old and new algorithms , 2012, Theor. Comput. Sci..