Jump to content

Kidnapped robot problem

From Wikipedia, the free encyclopedia

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 1992 IEEE International Conference on Robotics and Automation. pp. 2555–2560. doi:10.1109/ROBOT.1992.220057. ISBN 0-8186-2720-4. S2CID 38811217.{{cite book}}: CS1 maint: date and year (link)
  2. ^ Howie M. Choset et al. (2005). Principles of robot motion: theory, algorithms, and implementation. p.302.