Dynamic heuristic acceleration of linearly approximated SARSA($$\lambda $$): using ant colony optimization to learn heuristics dynamically
Crossref DOI link: https://doi.org/10.1007/s10732-019-09408-x
Published Online: 2019-05-03
Published Print: 2019-12
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Bromuri, Stefano
Funding for this research was provided by:
Open University of The Netherlands
Text and Data Mining valid from 2019-05-03
Article History
Received: 16 October 2016
Revised: 8 February 2018
Accepted: 15 February 2019
First Online: 3 May 2019