Solving Partially Observable Environments with Universal Search Using Dataflow Graph-Based Programming Model

Abstract

Universal search allows one to create an asymptotically optimal intelligent agent, which can act in a wide range of computable environments. However combinatorial explosion is still lurking behind though its dependency shifted from problem size to solution size. To combat this scenario, we propose a dataflow graph-based functional programming model to be used in the universal search for solution program generation. We have justified the superiority of our proposed model compared to sequential token-based languages when used in universal search-based intelligent agents. We have shown how applying an equivalent program pruning strategy can handle the problem of semantically redundant program generation. An incremental learning strategy based on gradient ascent is also proposed for our designed agent. Experimental results positively reinforced the theoretical justifications. We used our agent to solve some partially observable environments and compared them with the current state of art methods and it reveals the exceptional performance of our agent.