Abstract
This letter considers the problem of assigning multiple robots to charging stations in order to minimize the total time required by all robots for the charging operation. We first show that the centralized problem is NP-hard. Then, we formulate the charging problem as a non-cooperative game. We propose an algorithm to obtain the pure strategy Nash equilibrium of the non-cooperative game, and show its uniqueness. We investigate the price of anarchy of this equilibrium as a function of the number of robots and stations. Next, we leverage our analysis on static charging stations to propose strategies for reducing the total cost when the charging stations are mobile. Finally, we analyze the performance of the strategies proposed for the charging stations through extensive simulation.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
