Wake-up robot problem

In robotics, the wake-up robot problem refers to a situation where an autonomous robot is carried to an arbitrary location and put to operation, and the robot must localize itself without any prior knowledge.^[1]^[2]

The wake-up robot problem is closely related to the kidnapped robot problem.

References

^ Negenborn, Rudy (2003). Robot localization and kalman filters (Master of Science thesis). Institute of Information and Computing Sciences, Utrecht University. CiteSeerX 10.1.1.62.9672.
^ Qingxiang Wu; et al. (2002). "Rough computational methods on reducing cost of computation in Markov localization for mobile robots". Intelligent Control and Automation, 2002. Proceedings of the 4th World Congress. Vol. 2. pp. 1226–1230. doi:10.1109/WCICA.2002.1020777. ISBN 0-7803-7268-9.

This robotics-related article is a stub. You can help Wikipedia by expanding it.

[1] Negenborn, Rudy (2003). Robot localization and kalman filters (Master of Science thesis). Institute of Information and Computing Sciences, Utrecht University. CiteSeerX 10.1.1.62.9672.

[2] Qingxiang Wu; et al. (2002). "Rough computational methods on reducing cost of computation in Markov localization for mobile robots". Intelligent Control and Automation, 2002. Proceedings of the 4th World Congress. Vol. 2. pp. 1226–1230. doi:10.1109/WCICA.2002.1020777. ISBN 0-7803-7268-9.

[1]

[2]

See also

References