Now showing items 1-3 of 3
Competitive search ratio of graphs and polygons
We consider the problem of searching for a goal in an unknown environment, which may be a graph or a polygonal environment. The search ratio is the worst-case ratio before the goal is found while moving along some search ...
Finding a door along a wall with an error afflicted robot
We consider the problem of finding a door in a wall with a blind robot, that does not know the distance to the door or whether the door is located left hand or right hand to its start point. This problem can be solved with ...