We show that two cooperating robots can learn exactly any strongly-connected directed graph with n indistinguishable nodes in expected time polynomial in n. We introduce a new typ...
We consider exploration problems where a robot has to construct a complete map of an unknown environment. We assume that the environment is modeled by a directed, strongly connecte...
The Gauss map projects surface normals to a unit sphere, providing a powerful visualization of the geometry of a graphical object. It can be used to predict visual events caused b...
Bradley C. Lowekamp, Penny Rheingans, Terry S. Yoo
— The creation of a robot capable of navigating in unknown urban environments without the use of GPS data or prior map knowledge is envisioned in the Autonomous City Explorer (AC...