KEYWORDS: Machine learning, Evolutionary algorithms, Education and training, Deep learning, Attenuation, Social networks, Algorithms, Intelligence systems, Detection and tracking algorithms, Decision making
In the field of algorithm research, the problem of single-source shortest path has been discussed for a long time. In this paper, the problem of single source shortest path based on Q-learning is studied. Q-learning is a reinforcement learning algorithm that iterates to update the Q value of each state-action pair to determine the optimal path. When solving the single-source shortest path problem, each node in the graph is regarded as a state, and the edge between each node as an action. By using the Q-learning algorithm, we can find the optimal strategy, that is, to minimize the total cost from the starting point to the end point, and then find the shortest path. This paper introduces the implementation process of Q-learning algorithm, including initializing Q-table, selecting action, executing action, updating Q-table and so on. Finally, the effectiveness and feasibility of Q-learning algorithm are verified by experiments.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.