A hybrid bit-encoding for SAT planning based on clique-partitioning

Abstract

An approach to the drone fleet survivability assessment based on a stochastic continues-time model AIP Conference Proceedings 1872, 020025 (2017) Abstract. Planning as satisfiability is one of the most efficient ways to solve classic automated planning problems. In SAT planning, the encoding used to convert the problem to a SAT formula is critical for the performance of the SAT solver. This paper presents a novel bit-encoding that reduces the number of bits required to represent actions in a SATbased automated planning problem. To obtain such encoding we first build a conflict graph, which represents incompatibilities of pairs of actions, and bitwise encode the subsets of actions determined by a clique partition. This reduces the number of Boolean variables and clauses of the SAT encoding, while preserving the possibility of parallel execution of compatible (non-neighbor) actions. The article also describes an appropriate algorithm for selecting the clique partition for this application and compares the new encodings obtained over some standard planning problems.

Planning Domain Simulation: An Interactive System for Plan Visualisation

“…In general, PDSim offers a powerful and flexible framework for visualising planning problems using a state-of-the-art graphical engine. More specifically, PDSim aims to fill a gap in current systems that provide plan simulations, by offering users a simplified environment to develop 3D or 2D simulations compared with current approaches that come with the overhead of learning and using an ad hoc scripting language to interact with a custom simulator (Tapia, San Segundo, and Artieda 2015;Chen et al 2020;Roberts et al 2021).…”