Kidnapped robot problem

From Wikipedia, the free encyclopedia
Jump to navigation Jump to search

In robotics, the kidnapped robot problem is the situation where an autonomous robot in operation is carried to an arbitrary location.[1][2]

The kidnapped robot problem creates significant issues with the robot's localization system, and only a subset of localization algorithms can successfully deal with the uncertainty created; it is commonly used to test a robot's ability to recover from catastrophic localization failures.

See also[edit]

References[edit]

  1. ^ Engelson, S.P.; McDermott, D.V. (1992). "Error correction in mobile robot map learning". Proceedings of the International Conference on Robotics and Automation: 2555–2560. doi:10.1109/ROBOT.1992.220057.
  2. ^ Howie M. Choset et al. (2005). Principles of robot motion: theory, algorithms, and implementation. p.302.