TY - GEN
T1 - Mobile robot simultaneous localization and mapping using low cost vision sensors
AU - Sujan, Vivek A.
AU - Meggiolaro, Marco A.
AU - Belo, Felipe A.W.
PY - 2008
Y1 - 2008
N2 - In this work, an information-based iterative algorithm is proposed to plan a mobile robot's visual exploration strategy, enabling it to most efficiently build a graph model of its environment. The algorithm is based on determining the information present in sub-regions of a 2-D panoramic image of the environment from the robot's current location using a single camera fixed on the mobile robot. Using a metric based on Shannon's information theory, the algorithm determines potential locations of nodes from which to further image the environment. Using a feature tracking process, the algorithm helps navigate the robot to each new node, where the imaging process is repeated. A Mellin transform and tracking process is used to guide the robot back to a previous node. The set of nodes and the images taken at each node are combined into a graph to model the environment. By tracing its path from node to node, a service robot can navigate around its environment. Experimental results show the effectiveness of this algorithm.
AB - In this work, an information-based iterative algorithm is proposed to plan a mobile robot's visual exploration strategy, enabling it to most efficiently build a graph model of its environment. The algorithm is based on determining the information present in sub-regions of a 2-D panoramic image of the environment from the robot's current location using a single camera fixed on the mobile robot. Using a metric based on Shannon's information theory, the algorithm determines potential locations of nodes from which to further image the environment. Using a feature tracking process, the algorithm helps navigate the robot to each new node, where the imaging process is repeated. A Mellin transform and tracking process is used to guide the robot back to a previous node. The set of nodes and the images taken at each node are combined into a graph to model the environment. By tracing its path from node to node, a service robot can navigate around its environment. Experimental results show the effectiveness of this algorithm.
UR - http://www.scopus.com/inward/record.url?scp=38949102663&partnerID=8YFLogxK
U2 - 10.1007/978-3-540-77457-0_24
DO - 10.1007/978-3-540-77457-0_24
M3 - Conference contribution
AN - SCOPUS:38949102663
SN - 9783540774563
T3 - Springer Tracts in Advanced Robotics
SP - 259
EP - 266
BT - Experimental Robotics
A2 - Khatib, Oussama
A2 - Kumar, Vijay
A2 - Rus, Daniela
ER -