Y. Duan

Safety-Aware Multi-Robot Scheduling Under Time-Critical Constraints: A Colored Traveling Salesman Problem Approach

The Colored Traveling Salesman Problem (CTSP) is a seminal generalization of the Multiple TSP, where colors represent the heterogeneity of salesmen and their city visits. This work presents a time-critical extension, termed the Time-Critical CTSP (T-CTSP). By emphasizing the timing of visits, T-CTSP explicitly captures...