An accurate solution to the cardinality-based punctuality problem

• المؤلفون الرئيسيون: Cao, Zhiguang, Wu, Yaoxin, Rao, Akshay, Klanner, Felix, Erschen, Stefan, Chen, Wei, Zhang, Le, Guo, Hongliang
• مؤلفون آخرون: School of Computer Science and Engineering
• التنسيق: مقال
• اللغة: English
• منشور في: 2020
• الموضوعات: Engineering::Computer science and engineering; Punctuality; Stochastic Shortest Path
• الوصول للمادة أونلاين: https://hdl.handle.net/10356/144359

This paper focuses on a specific stochastic shortest path (SSP) problem, namely the punctuality problem. It aims to determine a path that maximizes the probability of arriving at the destination before a specified deadline. The popular solution to this problem always formulates it as a cardinality m...