Kidnapped robot problem

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

In robotics, the kidnapped robot problem commonly refers to a 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]


  1. ^ S.P. Engelson and D.V. McDermott (1992). "Error correction in mobile robot map-learning". In: ICRA 1992: Proceedings of the international conference on robotics and automation. ISBN 0-8186-2720-4. pp. 2555-2560.
  2. ^ Howie M. Choset et al. (2005). Principles of robot motion: theory, algorithms, and implementation. p.302.