Saved in:
Bibliographic Details
Main Authors: Zellner, Aaron, Dutta, Ayan, Kulbaka, Iliya, Sharma, Gokarna
Format: Preprint
Published: 2022
Subjects:
Online Access:https://arxiv.org/abs/2210.00327
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866918087905771520
author Zellner, Aaron
Dutta, Ayan
Kulbaka, Iliya
Sharma, Gokarna
author_facet Zellner, Aaron
Dutta, Ayan
Kulbaka, Iliya
Sharma, Gokarna
contents In this paper, we study the problem of coverage of an environment with an energy-constrained robot in the presence of multiple charging stations. As the robot's on-board power supply is limited, it might not have enough energy to cover all the points in the environment with a single charge. Instead, it will need to stop at one or more charging stations to recharge its battery intermittently. The robot cannot violate the energy constraint, i.e., visit a location with negative available energy. To solve this problem, we propose a deep Q-learning framework that produces a policy to maximize the coverage and minimize the budget violations. Our proposed framework also leverages the memory of a recurrent neural network (RNN) to better suit this multi-objective optimization problem. We have tested the presented framework within a 16 x 16 grid environment having charging stations and various obstacle configurations. Results show that our proposed method finds feasible solutions and outperforms a comparable existing technique.
format Preprint
id arxiv_https___arxiv_org_abs_2210_00327
institution arXiv
publishDate 2022
record_format arxiv
spellingShingle Deep Recurrent Q-learning for Energy-constrained Coverage with a Mobile Robot
Zellner, Aaron
Dutta, Ayan
Kulbaka, Iliya
Sharma, Gokarna
Robotics
Machine Learning
Neural and Evolutionary Computing
In this paper, we study the problem of coverage of an environment with an energy-constrained robot in the presence of multiple charging stations. As the robot's on-board power supply is limited, it might not have enough energy to cover all the points in the environment with a single charge. Instead, it will need to stop at one or more charging stations to recharge its battery intermittently. The robot cannot violate the energy constraint, i.e., visit a location with negative available energy. To solve this problem, we propose a deep Q-learning framework that produces a policy to maximize the coverage and minimize the budget violations. Our proposed framework also leverages the memory of a recurrent neural network (RNN) to better suit this multi-objective optimization problem. We have tested the presented framework within a 16 x 16 grid environment having charging stations and various obstacle configurations. Results show that our proposed method finds feasible solutions and outperforms a comparable existing technique.
title Deep Recurrent Q-learning for Energy-constrained Coverage with a Mobile Robot
topic Robotics
Machine Learning
Neural and Evolutionary Computing
url https://arxiv.org/abs/2210.00327