Abstract: The rooted max tree coverage (MTC) problem has wide applications in areas, such as network design and vehicle routing. Given a graph with non-negative costs defined on edges, a vertex used ...
Abstract: This paper presents a novel hybrid framework that combines Dynamic Spanning Tree Coverage (D-STC) with Q-learning to address the challenges of mobile robot navigation and coverage in dynamic ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback