Using tabled logic programming to solve the Petrobras planning problem

DOI10.1017/S1471068414000295MaRDI QIDQ2931274zbMATH OpenFDO

Publication date 25 November 2014

Published in Theory and Practice of Logic Programming (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1405.2501

logistics pattern matching Picat planning resource-bounded search symmetry breaking tabling

Logic programming (68N17) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Transportation, logistics and supply chain management (90B06)

Abstract: Tabling has been used for some time to improve efficiency of Prolog programs by memorizing answered queries. The same idea can be naturally used to memorize visited states during search for planning. In this paper we present a planner developed in the Picat language to solve the Petrobras planning problem. Picat is a novel Prolog-like language that provides pattern matching, deterministic and non-deterministic rules, and tabling as its core modelling and solving features. We demonstrate these capabilities using the Petrobras problem, where the goal is to plan transport of cargo items from ports to platforms using vessels with limited capacity. Monte Carlo Tree Search has been so far the best technique to tackle this problem and we will show that by using tabling we can achieve much better runtime efficiency and better plan quality.

Recommendations

Cited in

(1)

Planning as tabled logic programming

This page was built for publication: Using tabled logic programming to solve the Petrobras planning problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2931274)