An accurate solution to the cardinality-based punctuality problem

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...

Full description

Saved in:
Bibliographic Details
Main Authors: Cao, Zhiguang, Wu, Yaoxin, Rao, Akshay, Klanner, Felix, Erschen, Stefan, Chen, Wei, Zhang, Le, Guo, Hongliang
Other Authors: School of Computer Science and Engineering
Format: Article
Language:English
Published: 2020
Subjects:
Online Access:https://hdl.handle.net/10356/144359
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Nanyang Technological University
Language: English