.png){kind=icon}
返回
Temporal Graph Traversals Using Reinforcement Learning With Proximal Policy Optimization
.png){kind=icon}
OA
AI
DOI：10.1109/ACCESS.2020.2985295.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Graphs in real-world applications are dynamic both in terms of structures and inputs. Information discovery in such networks, which present dense and deeply connected patterns locally and sparsity globally can be time consuming and computationally costly. In this paper we address the shortest path query in spatio-temporal graphs which is a fundamental graph problem with numerous applications. In spatio-temporal graphs, shortest path query classical algorithms are insufficient or even flawed because information consistency can not be guaranteed between two timestamps and path recalculation is computationally costly. In this work, we address the complexity and dynamicity of the shortest path query in spatio-temporal graphs with a simple, yet effective model based on Reinforcement Learning with Proximal Policy Optimization. Our solution simplifies the problem by decomposing the spatio-temporal graph in two components: a static and a dynamic sub-graph. The static graph, known and immutable, is efficiently solved with A* algorithm. The sub-graphs interconnecting the static graph have unknown dynamics and we address such issue by estimating the unknown dynamic portion of the graph as a Markov Chain which correlates the observations of the agents in the environment and the path to be followed. We then derive an action policy through Proximal Policy Optimization to select the local optimal actions in the Markov Process that will lead to the shortest path, given the estimated system dynamics. We evaluate the system in a simulation environment constructed in Unity3D. In partially structured and unknown environments, with variable environment parameters we've obtained an efficiency 75% greater than the comparable deterministic solution.
Keyword:
Machine learning
graphs
Markov-chain
deep reinforcement learning
path-planning
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.6
论文数:
9.8W
被引数:
29.4W
机构
引用论文
分享收藏Does it take older adults longer than younger adults to perceptually segregate a speech target from a background masker?在感知上将语音目标与背景掩蔽器隔离开来是否需要老年人比年轻人更长的时间？
PREAI
分享收藏分享收藏Spectral properties of the Dirichlet-to-Neumann operator for spheroids椭球体的Dirichlet-to-Neumann算子的谱性质
OAAI
OAAI分享收藏Adaptive output-feedback bipartite consensus for nonstrict-feedback nonlinear multi-agent systems: A finite-time approach.png)
NEUROCOMPUTING
NEUROCOMPUTINGIF6.5
PREAI
分享收藏HIPPIE v2.0: enhancing meaningfulness and reliability of protein-protein interaction networksHIPPIE v2.0: 增强蛋白质-蛋白质相互作用网络的意义和可靠性NUCLEIC ACIDS RESEARCHOAAI
NUCLEIC ACIDS RESEARCHIF13.1
OAAI分享收藏
查看更多内容