DocumentCode
2760639
Title
AntNet with Reward-Penalty Reinforcement Learning
Author
Lalbakhsh, Pooia ; Zaeri, Bahram ; Lalbakhsh, Ali ; Fesharaki, Mehdi N.
Author_Institution
Comput. Eng. Dept., Islamic Azad Univ.-Borujerd Branch, Borujerd, Iran
fYear
2010
fDate
28-30 July 2010
Firstpage
17
Lastpage
21
Abstract
The paper deals with a modification in the learning phase of AntNet routing algorithm, which improves the system adaptability in the presence of undesirable events. Unlike most of the ACO algorithms which consider reward-inaction reinforcement learning, the proposed strategy considers both reward and penalty onto the action probabilities. As simulation results show, considering penalty in AntNet routing algorithm increases the exploration towards other possible and sometimes much optimal selections, which leads to a more adaptive strategy. The proposed algorithm also uses a self-monitoring solution called Occurrence-Detection, to sense traffic fluctuations and make decision about the level of undesirability of the current status. The proposed algorithm makes use of the two mentioned strategies to prepare a self-healing version of AntNet routing algorithm to face undesirable and unpredictable traffic conditions.
Keywords
computer networks; learning (artificial intelligence); optimisation; probability; telecommunication network routing; telecommunication traffic; ACO algorithm; AntNet routing algorithm; action probability; decision making; occurrence detection; reward-penalty reinforcement learning; self healing; self-monitoring solution; system adaptability; traffic fluctuation sensing; Ant Colony Optimization; AntNet; Reward-penalty reinforcement Learning; Swarm intelligence;
fLanguage
English
Publisher
ieee
Conference_Titel
Computational Intelligence, Communication Systems and Networks (CICSyN), 2010 Second International Conference on
Conference_Location
Liverpool
Print_ISBN
978-1-4244-7837-8
Electronic_ISBN
978-0-7695-4158-7
Type
conf
DOI
10.1109/CICSyN.2010.11
Filename
5615774
Link To Document