Neural networks for model-free and scale-free automated planning

作者:Michaela Urbanovská, Antonín Komenda

摘要

Automated planning for problems without an explicit model is an elusive research challenge. However, if tackled, it could provide a general approach to problems in real-world unstructured environments. There are currently two strong research directions in the area of artificial intelligence (AI), namely machine learning and symbolic AI. The former provides techniques to learn models of unstructured data but does not provide further problem solving capabilities on such models. The latter provides efficient algorithms for general problem solving, but requires a model to work with. Creating the model can itself be a bottleneck of many problem domains. Complicated problems require an explicit description that can be very costly or even impossible to create. In this paper, we propose a combination of the two areas, namely deep learning and classical planning, to form a planning system that works without a human-encoded model for variably scaled problems. The deep learning part extracts the model in the form of a transition system and a goal-distance heuristic estimator; the classical planning part uses such a model to efficiently solve the planning problem. Both networks in the planning system, we introduced, work with a problem in its graphic form and there is no need for any additional information to create the state transition system or to estimate a heuristic value. We proposed three different architectures for the heuristic estimator to compare different characteristics of well- known deep learning techniques. Besides the design of such planning systems, we provide experimental evaluation comparing the implemented techniques to classical model-based methods.

论文关键词:Automated planning, Deep neural networks, Model-free planning, Scale-free planning, Convolutional neural networks, Recurrent neural networks

论文评审过程:

论文官网地址:https://doi.org/10.1007/s10115-021-01619-8