Temporal Graph Traversals Using Reinforcement Learning With Proximal Policy Optimization
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 q...
Main Authors: | Samuel Henrique Silva, Adel Alaeddini, Peyman Najafirad |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2020-01-01
|
Series: | IEEE Access |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/9055369/ |
Similar Items
-
Reasoning for Local Graph Over Knowledge Graph With a Multi-Policy Agent
by: Jie Zhang, et al.
Published: (2021-01-01) -
Combining Subgoal Graphs with Reinforcement Learning to Build a Rational Pathfinder
by: Junjie Zeng, et al.
Published: (2019-01-01) -
Recent Advances in Deep Reinforcement Learning Applications for Solving Partially Observable Markov Decision Processes (POMDP) Problems: Part 1—Fundamentals and Applications in Games, Robotics and Natural Language Processing
by: Xuanchen Xiang, et al.
Published: (2021-07-01) -
Deep Reinforcement Learning for Path Planning by Cooperative Robots: Existing Approaches and Challenges
by: Walaa Othman, et al.
Published: (2021-01-01) -
UAV Autonomous Target Search Based on Deep Reinforcement Learning in Complex Disaster Scene
by: Chunxue Wu, et al.
Published: (2019-01-01)