Deep R-Learning for Continual Area Sweeping
Rishi Shah,Yuqian Jiang,Justin Hart,Peter Stone,Rishi Shah,Yuqian Jiang,Justin Hart,Peter Stone
Coverage path planning is a well-studied problem in robotics in which a robot must plan a path that passes through every point in a given area repeatedly, usually with a uniform frequency. To address the scenario in which some points need to be visited more frequently than others, this problem has been extended to non-uniform coverage planning. This paper considers the variant of non-uniform cover...
