By Topic

Online Coverage by a Tethered Autonomous Mobile Robot in Planar Unknown Environments

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Shnaps, I. ; Dept. of Mech. Eng., Technion - Israel Inst. of Technol., Haifa, Israel ; Rimon, E.

This paper is concerned with an online tethered coverage (TC), in which a mobile robot of size D is attached to a fixed point S by a cable of finite length L. Starting at S, the robot has to cover an unknown planar environment that contains obstacles and return to S with the cable fully retracted. The paper first establishes an optimal offline TC methodology, then introduces the TC algorithm that performs an online TC using position and local obstacle detection sensors. The performance of the TC algorithm is measured by its competitiveness, determined by measuring its total online path length l relative to the optimal offline solution lopt . The paper establishes that the TC algorithm has a competitive performance of l ≤ 2 L/D lopt. The paper additionally establishes a lower bound of l ≥ log(L/D) lopt over a generic family of TC algorithms of which the TC algorithm is a special case. Execution example and experiments with a tethered recoiling mechanism illustrate the usefulness of the TC algorithm.

Published in:

Robotics, IEEE Transactions on  (Volume:30 ,  Issue: 4 )