Meeting a deadline: shortest paths on stochastic directed acyclic graphs with information gathering
Ann. Math. Artif. Intell., Volume 79, Issue 4, 2017, Pages 337-370.
EI
Abstract:
We consider the problem of an agent traversing a directed graph with the objective of maximizing the probability of reaching a goal node before a given deadline. Only the probability of the travel times of edges is known to the agent. The agent must balance between traversal actions towards the goal, and delays due to actions improving in...More
Code:
Data:
Get fulltext within 24h
Upload PDF
1.Your uploaded documents will be check within 24h, and coins will be credited to your account.
2.As the current system does not support cash withdrawal, you can add staff WeChat (AMxiaomai) to receive it as a red packet.
3.10 coins will be exchanged for 1 yuan.
?
￥
Upload a single paper
for 5 coins
Wechat's Red Packet
?
￥
Upload 50 articles
for 250 coins
Wechat's Red Packet
?
￥
Upload 200 articles
for 1000 coins
Wechat's Red Packet
?
￥
Upload 500 articles
for 2500 coins
Wechat's Red Packet
?
￥
Upload 1000 articles
for 5000 coins
Wechat's Red Packet
Tags
Comments