The Polygon Exploration Problem I: A Competitive Strategy
msra
摘要
We present an on-line strategy that enables a mobile robot with vision to explore an unknown simple polygon. We prove that the resulting tour is less than 26.5 times as long as the shortest watchman tour that could be computed o-line. Our analysis is doubly founded on a novel geometric structure called the angle hull. This structure is presented in Part II of this paper (13).
更多查看译文
关键词
motion planning,computational geometry,optimum watchman tour,on-line algorithm,poly- gon,navigation,robot.,competitive strategy,angle hull
AI 理解论文
溯源树
样例
![](https://originalfileserver.aminer.cn/sys/aminer/pubs/mrt_preview.jpeg)
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要