Min-Time Coverage in Constricted Environments: Problem Formulations and Complexity Analysis. - Spyros A. Reveliotis; Young-In Kim 002 (IEEE Trans. Control. Netw. Syst., 2022)

Min-Time Coverage in Constricted Environments with Arbitrary Guidepath Networks. - Young-In Kim 002; Spyros A. Reveliotis (CDC, 2023)

A streamlined heuristic for the problem of Min-Time Coverage in Constricted Environments (Extended Abstract). - Young-In Kim 002; Spyros A. Reveliotis (ETFA, 2023)

A Strong Combinatorial Relaxation for the Problem of Min-Time Coverage in Constricted Environments. - Young-In Kim 002; Spyros A. Reveliotis (IEEE Trans. Autom. Control., 2024)

A Heuristic Approach to the Problem of Min-Time Coverage in Constricted Environments. - Young-In Kim 002; Spyros A. Reveliotis (IEEE Trans. Control. Netw. Syst., 2024)

A Streamlined Heuristic for the Problem of Min-Time Coverage in Constricted Environments. - Young-In Kim 002; Spyros A. Reveliotis (IEEE Trans Autom. Sci. Eng., 2025)