Buscar
Mostrando ítems 1-3 de 3
Ponencia
Competitive search ratio of graphs and polygons
(2004)
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 ...
Ponencia
Finding a door along a wall with an error afflicted robot
(2004)
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 ...
Ponencia
Lower bounds for the polygon exploration problem
(2004)
We improve the best known lower bound for the polygon exploration problem from 1.2071 to 1.2825.