Balancing Efficiency and Unpredictability in Multi-robot Patrolling: A MARL-Based Approach

L Guo, H Pan, X Duan, J He - 2023 IEEE International …, 2023 - ieeexplore.ieee.org
Patrolling with multiple robots is a challenging task. While the robots collaboratively and
repeatedly cover the regions of interest in the environment, their routes should satisfy two …

Multi-robot persistent monitoring: Minimizing latency and number of robots with recharging constraints

AB Asghar, S Sundaram, SL Smith - arXiv preprint arXiv:2303.08935, 2023 - arxiv.org
In this paper we study multi-robot path planning for persistent monitoring tasks. We consider
the case where robots have a limited battery capacity with a discharge time $ D $. We …

Fair Surveillance Assignment Problem

F Wang, B Li - Proceedings of the ACM on Web Conference 2024, 2024 - dl.acm.org
Monitoring a specific set of locations serves multiple purposes, such as infrastructure
inspection and safety surveillance. We study a generalization of the surveillance problem …

Polyamorous Scheduling

L Gąsieniec, B Smith, S Wild - arXiv preprint arXiv:2403.00465, 2024 - arxiv.org
Finding schedules for pairwise meetings between the members of a complex social group
without creating interpersonal conflict is challenging, especially when different relationships …

Improved Approximation Algorithms for Patrol-Scheduling with Min-Max Latency Using Multiclass Minimum Spanning Forests

LH Chen, LJ Hung, R Klasing - … on Algorithmic Aspects in Information and …, 2024 - Springer
In a weighted complete metric graph G=(V, E, w, d), with w: V→ R+ determining the
importance of vertices and d: E→ R+ defining the distance between vertices, consider k≥ 1 …