Abstract | ||
---|---|---|
This paper presents strategies for speeding up the convergence of agents on swarm. Speeding up the learning of an agent is a complex task since the choice of inadequate updating techniques may cause delays in the learning process or even induce an unexpected acceleration that causes the agent to converge to a non-satisfactory policy. We have developed strategies for updating policies which combines local and global search using past policies. Experimental results in dynamic environments of different dimensions have shown that the proposed strategies are able to speed up the convergence of the agents while achieving optimal action policies, improving the coordination of agents in the swarm while deliberating. |
Year | DOI | Venue |
---|---|---|
2013 | 10.1007/978-3-319-09492-2_9 | Lecture Notes in Business Information Processing |
Keywords | Field | DocType |
Coordination,Ant-colony algorithms,Dynamic environments | Convergence (routing),Data mining,Swarm behaviour,Computer science,Acceleration,Speedup,Distributed computing | Conference |
Volume | ISSN | Citations |
190 | 1865-1348 | 0 |
PageRank | References | Authors |
0.34 | 16 | 4 |
Name | Order | Citations | PageRank |
---|---|---|---|
Richardson Ribeiro | 1 | 43 | 11.12 |
Adriano F. Ronszcka | 2 | 4 | 1.12 |
Marco A. C. Barbosa | 3 | 2 | 2.06 |
Fabrício Enembreck | 4 | 274 | 38.42 |