Solving Non-Markovian Control Tasks with Neuro-Evolution
Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence. Uncertainty and Probabilistic Reasoning. Pages 1356-1360.
Abstract
The success of evolutionary methods on standard control learning tasks has created a need for new benchmarks. The classic pole balancing problem is no longer difficult enough to serve as a viable yardstick for measuring the learning efficiency of these systems. The double pole case, where two poles connected to the cart must be balanced simultaneously is much more difficult, especially when velocity information is not available. In this article, we demonstrate a neuroevolution system, Enforced Sub-populations (ESP), that is used to evolve a controller for the standard double pole task and a much harder, non-Markovian version. In both cases, our results show that ESP is faster than other neuroevolution methods. In addition, we introduce an incremental method that evolves on a sequence of tasks, and utilizes a local search technique (DeltaCoding) to sustain diversity. This method enables the system to solve even more difficult versions of the task where direct evolution cannot.
@inproceedings{ijcai1999p192,
title = {Solving Non-Markovian Control Tasks with Neuro-Evolution},
author = {Gomez, Faustino J. and Miikkulainen, Risto},
booktitle = {Proceedings of the Sixteenth International Joint Conference on
Artificial Intelligence, {IJCAI-99}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Thomas Dean},
pages = {1356--1360},
year = {1999},
note = {Uncertainty and Probabilistic Reasoning},
url = {https://ijcai.org/proceedings/1999/192},
}
TY - CPAPER TI - Solving Non-Markovian Control Tasks with Neuro-Evolution AU - Gomez, Faustino J. AU - Miikkulainen, Risto T2 - Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence, IJCAI-99 PB - International Joint Conferences on Artificial Intelligence PY - 1999 SP - 1356 EP - 1360 UR - https://ijcai.org/proceedings/1999/192 ER -Copied
Machine-readable versions of this paper, for tools and AI agents: