Jump to content

Wake-up robot problem

Add links
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Phil Boswell (talk | contribs) at 21:40, 10 May 2014 (convert dodgy URL to ID using AWB). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

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.

See also

References

  1. ^ Negenborn, Rudy (2003). "Robot localization and kalman filters". Institute of Information and Computing Sciences, Utrecht University. CiteSeerx: 10.1.1.62.9672. {{cite journal}}: Cite journal requires |journal= (help)
  2. ^ Qingxiang Wu (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. pp. 1226–1230. ISBN 0-7803-7268-9. {{cite book}}: Unknown parameter |coauthors= ignored (|author= suggested) (help)
Retrieved from "https://en.wikipedia.org/w/index.php?title=Wake-up_robot_problem&oldid=607968728"