• Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Scaling Ant Colony Optimization With Hierarchical Reinforcement Learning Partitioning

Scaling Ant Colony Optimization With Hierarchical Reinforcement Learning Partitioning

Paperback

Business GeneralGeneral ComputersGeneral Mathematics

ISBN10: 1025136322
ISBN13: 9781025136325
Publisher: Hutson Street Press
Published: May 22 2025
Pages: 92
Weight: 0.31
Height: 0.19 Width: 6.14 Depth: 9.21
Language: English

This research merges the hierarchical reinforcement learning (HRL) domain and the ant colony optimization (ACO) domain. The merger produces a HRL ACO algorithm capable of generating solutions for both domains. This research also provides two specific implementations of the new algorithm: the first a modification to Dietterich's MAXQ-Q HRL algorithm, the second a hierarchical ACO algorithm. These implementations generate faster results, with little to no significant change in the quality of solutions for the tested problem domains. The application of ACO to the MAXQ-Q algorithm replaces the reinforcement learning, Q-learning and SARSA, with the modified ant colony optimization method, Ant-Q. This algorithm, MAXQ-AntQ, converges to solutions not significantly different from MAXQ-Q in 88% of the time. This research then transfers HRL techniques to the ACO domain and traveling salesman problem (TSP). To apply HRL to ACO, a hierarchy must be created for the TSP. A data clustering algorithm creates these subtasks, with an ACO algorithm to solve the individual and complete problems. This research tests two clustering algorithms, k-means and G-means.

1 different editions

Also available

Also from

Dries, Erik

Also in

General Computers