Misplaced Pages

Exploration problem

Article snapshot taken from Wikipedia with creative commons attribution-sharealike license. Give it a read and then ask your questions in the chat. We can research this topic together.
Use of a robot to maximize the knowledge over a particular area For the exploration problem in recreational mathematics, see jeep problem.

In robotics, the exploration problem deals with the use of a robot to maximize the knowledge over a particular area. The exploration problem arises in robotic mapping and search & rescue situations, where an environment might be dangerous or inaccessible to humans.

Overview

The exploration problem naturally arises in situations in which a robot is utilized to survey an area that is dangerous or inaccessible for humans. The field of robotic explorations draws from various fields of information gathering and decision theory, and have been studied as far back as the 1950s.

The earliest work in robotic exploration was done in the context of simple finite state automata known as bandits, where algorithms were designed to distinguish and map different states in a finite-state automaton. Since then, the primary emphasis has been shifted to the robotics system development domain, where exploration-algorithms guided robot have been used to survey volcanos, search and rescue, and abandoned mines mapping. Current state of the art system include advanced techniques on active localization, simultaneous localization and mapping (SLAM) based exploration, and multi-agent cooperative exploration.

Information gain

The key concept in the exploration problem is the notion of information gain, that is, the amount of knowledge acquired while pushing the frontiers. A probabilistic measure of information gain is defined by the entropy

H p ( x ) = − ∫ p ( x ) log ⁡ p ( x ) d x . {\displaystyle H_{p}(x)=-\int p(x)\log p(x)\,dx.}

The function H p ( x ) {\displaystyle H_{p}(x)} is maximized if p is a uniform distribution and minimized when p is a point mass distribution. By minimizing the expected entropy of belief, information gain is maximized as

I b ( u ) = H p ( x ) − E z [ H b ( x ′ | z , u ) ] . {\displaystyle I_{b}(u)=H_{p}(x)-E_{z}\left.}

See also

References

  1. Thrun, S.; Burgard, W.; Fox, D. (2005). Probabilistic Robotics. Cambridge: MIT Press. ISBN 978-0-262-20162-9.
  2. Bares, J.E.; Wettergreen, D.S. (1999). "Dante II: Technical Description, Results, and Lessons Learned". The International Journal of Robotics Research. 18 (7): 621. CiteSeerX 10.1.1.41.8358. doi:10.1177/02783649922066475. S2CID 9772668.
  3. Thrun, S.; Hahnel, D.; Ferguson, D.; Montemerlo, M.; Triebel, R.; Burgard, W.; Baker, C.; Omohundro, Z.; Thayer, S.; Whittaker, W. (2003). "A system for volumetric robotic mapping of abandoned mines". Robotics and Automation, 2003. Proceedings. ICRA'03. IEEE International Conference on. Vol. 3. doi:10.1109/ROBOT.2003.1242260.
Category: