Hao-Tsung Yang
Papers
3
Total Citations
20
H-Index
2
About
Hao-Tsung Yang is a computational researcher specializing in algorithmic design and multi-robot coordination, with a particular focus on optimization problems in autonomous surveillance and patrolling systems. Their most significant contributions center on developing approximation algorithms for the challenging Min-Max Latency Multi-Robot Patrol-Scheduling problem — a combinatorially complex domain that sits at the intersection of theoretical computer science, robotics, and operations research. Yang's most impactful work, published across 2020 and 2021, addresses how to optimally schedule multiple robots patrolling a set of sites in a metric space, minimizing the worst-case time any site goes unvisited. This research has garnered 18 combined citations, demonstrating meaningful traction within the algorithms and robotics communities. Their 2022 follow-up, which investigates cyclic patrol solutions, further deepens the theoretical foundations of this problem space, exploring infinite-sequence scheduling strategies to achieve provably efficient coverage guarantees. By crafting rigorous approximation frameworks for NP-hard scheduling problems, Yang contributes tools with real-world relevance to security robotics, infrastructure monitoring, and autonomous systems. Their body of work reflects a disciplined commitment to bridging theoretical algorithmic guarantees with practically motivated robotic coordination challenges.
Research Focus
Key Achievements
Top Papers
- 1
- 2
- 3