The Persistent Robot Charging Problem for Long-Duration Autonomy
<|reference_start|>The Persistent Robot Charging Problem for Long-Duration Autonomy: This paper introduces a novel formulation aimed at determining the optimal schedule for recharging a fleet of $n$ heterogeneous robots, with the primary objective of minimizing resource utilization. This study provides a foundational framework applicable to Multi-Robot Mission Planning, particularly in scenarios demanding Long-Duration Autonomy (LDA) or other contexts that necessitate periodic recharging of multiple robots. A novel Integer Linear Programming (ILP) model is proposed to calculate the optimal initial conditions (partial charge) for individual robots, leading to the minimal utilization of charging stations. This formulation was further generalized to maximize the servicing time for robots given adequate charging stations. The efficacy of the proposed formulation is evaluated through a comparative analysis, measuring its performance against the thrift price scheduling algorithm documented in the existing literature. The findings not only validate the effectiveness of the proposed approach but also underscore its potential as a valuable tool in optimizing resource allocation for a range of robotic and engineering applications.<|reference_end|>
@article{kumar2024the,
    title={The Persistent Robot Charging Problem for Long-Duration Autonomy},
    author={Nitesh Kumar, Jaekyung Jackie Lee, Sivakumar Rathinam, Swaroop Darbha,
  P.B. Sujit and Rajiv Raman},
    journal={arXiv preprint arXiv:2409.00572},
    year={2024},
    archivePrefix={arXiv},
    eprint={2409.00572},
    primaryClass={cs.RO}
}