Reinforcement Learning Based Stochastic Shortest Path Finding in Wireless Sensor Networks
Many factors influence the connection states between nodes of wireless sensor networks, such as physical distance, and the network load, making the network’s edge length dynamic in abundant scenarios. This dynamic property makes the network essentially form a graph with stochastic edge le...
Saved in:
Main Authors: | Wenwen Xia, Chong Di, Haonan Guo, Shenghong Li |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2019-01-01
|
Series: | IEEE Access |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/8886484/ |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Speed-up Technique in Time-Varying Shortest Path Problems with Arbitrary Waiting Times
by: Gholamhasan Shirdel, et al.
Published: (2020-09-01) -
Improved artificial fish-swarm algorithm based on adaptive vision for solving the shortest path problem
by: Xian-min MA, et al.
Published: (2014-01-01) -
Q-learning global path planning for UAV navigation with pondered priorities
by: Kevin B. de Carvalho, et al.
Published: (2025-03-01) -
A Comparison of Three Real-Time Shortest Path Models in Dynamic Interval Graph
by: Bo Xu, et al.
Published: (2025-01-01) -
Influence of shortest path algorithms on energy consumption of multi-core processors
by: A. A. Prihozhy, et al.
Published: (2023-10-01)