Loading view.
Student Talks
Lower Bounds for Moving Target Traveling Salesman Motion Planning with Obstacles
NSH 3305Abstract: We study the problem of finding a trajectory for an agent to intercept a number of moving targets while avoiding obstacles. Applications include resupplying naval ships at sea and recharging aerial vehicles with a ground vehicle. We model the problem as an extension of the traveling salesman problem, which we refer to as the [...]
Towards Pragmatic Time Series Intelligence
NSH 1305Abstract: The widespread adoption of time series machine learning (ML) models faces multiple challenges involving data, modeling and evaluation. Data. Modern ML models depend on copious amounts of cohesive and reliably annotated data for training and evaluation. However, labeled data is not always available and reliable, and can also be dispersed across different locations. We [...]