Skip Nav Destination
Close Modal
Update search
NARROW
Format
TocHeadingTitle
Date
Availability
1-2 of 2
Vadim Bulitko
Close
Follow your search
Access your saved searches in your account
Would you like to receive an alert when new items match your search?
Sort by
Proceedings Papers
. isal2019, ALIFE 2019: The 2019 Conference on Artificial Life465-466, (July 29–August 2, 2019) doi: 10.1162/isal_a_00204
Abstract
PDF
Recent successes in Artificial Intelligence (AI) use machine learning to produce AI agents with both hand-engineered and procedurally generated elements learned from large amounts of data. As the balance shifts toward procedural generation, how can we predict interactions between such agents and humans? We propose to use Artificial Life to study emergence of group behaviours between procedurally generated AI agents and humans. We simulate Darwinian evolution to procedurally generate agents in a simple environment where the agents interact with human-controlled avatars. To reduce human involvement time, we machine-learn another set of AI agents that mimic human avatar behaviours and run the evolution with such human proxies instead of actual humans. This paper is an update on the on-going project.
Proceedings Papers
. alif2016, ALIFE 2016, the Fifteenth International Conference on the Synthesis and Simulation of Living Systems108-115, (July 4–6, 2016) doi: 10.1162/978-0-262-33936-0-ch024
Abstract
PDF
Heuristic search is a core area of Artificial Intelligence, successfully applied to planning, constraint satisfaction and game playing. In real-time heuristic search autonomous agents interleave planning and plan execution and access environment locally which make them more suitable for Artificial Life style settings. Over the last two decades a large number of real-time heuristic search algorithms have been manually crafted and evaluated. In this paper we break down several published algorithms into building blocks and then let a simulated evolution re-combine the blocks in a performance-based way. Remarkably, even relatively short evolution runs result in algorithms with state-of-the-art performance. These promising preliminary results open exciting possibilities in the field of real-time heuristic search.