-1A Mobile Robot Navigation Exploration Algorithm Export

@misc{citeulike:3374913, abstract = {This paper will present an algorithm for path planning to a goal with a mobile robot in an unknown environment. The robot maps the environment only to the extent that is necessary to achieve the goal. Mapping is achieved using tactile sensing while the robot is executing a path to the specified goal. Paths are generated by treating unknown regions in the environment as free space. As obstacles are encountered en route to a goal, the model of the environment is updated and a new path to the goal is planned and executed. Initially the paths to the goal generated by this algorithm will be negotiable paths. However as the robot acquires more knowledge about the environment, the length of the planned paths will be optimised. The optimisation criteria can be modified to favour or avoid unexplored regions in the environment. The algorithm presented in this paper makes use of the quadtree data structure to model the environment and uses the distance transform methodology to generate paths for the robot to execute.}, author = {Zelinsky, Alexander}, citeulike-article-id = {3374913}, citeulike-linkout-0 = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.47.7090}, keywords = {mapping, tactile}, posted-at = {2008-10-04 20:11:48}, priority = {2}, title = {-1A Mobile Robot Navigation Exploration Algorithm}, url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.47.7090} }

TY - ELEC ID - citeulike:3374913 L3 - citeulike-article-id:3374913 N2 - This paper will present an algorithm for path planning to a goal with a mobile robot in an unknown environment. The robot maps the environment only to the extent that is necessary to achieve the goal. Mapping is achieved using tactile sensing while the robot is executing a path to the specified goal. Paths are generated by treating unknown regions in the environment as free space. As obstacles are encountered en route to a goal, the model of the environment is updated and a new path to the goal is planned and executed. Initially the paths to the goal generated by this algorithm will be negotiable paths. However as the robot acquires more knowledge about the environment, the length of the planned paths will be optimised. The optimisation criteria can be modified to favour or avoid unexplored regions in the environment. The algorithm presented in this paper makes use of the quadtree data structure to model the environment and uses the distance transform methodology to generate paths for the robot to execute. TI - -1A Mobile Robot Navigation Exploration Algorithm KW - mapping KW - tactile AU - Zelinsky, Alexander UR - http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.47.7090 ER -