Study on strategy to search in star-shaped polygons
Yi He · Jisuanji yingyong yanjiu · 2009
In the navigation problem of autonomous robots,the robot must repeatedly make decisions without full knowledge or under uncertainty and find a goal in an unknown environment finally;the problem is solved when the robot has gained full information.This paper studied the problem of on-line searching for a target inside a polygon and proposed a strategy for finding a target of unknown location in a star-shaped polygon with a competitive ratio of 11.18,it was independent on the starting position of the robot and the position of the target.