On Weak Stubborn Sets in Classical Planning

Stubborn sets are a pruning technique for state-space search which is well established in optimal classical planning. In this paper, we show that weak stubborn sets introduced in recent work in planning are actually not weak stubborn sets in Valmari's original sense. Based on this finding, we introduce weak stubborn sets in the original sense for planning by providing a generalized definition analogously to generalized strong stubborn sets in previous work. We discuss the relationship of strong, weak and the previously called weak stubborn sets, thus providing a further step in getting an overall picture of the stubborn set approach in planning.

Model Checking $$\omega $$-Regular Properties with Decoupled Search

Decoupled search is a state space search method originally introduced in AI Planning. Similar to partial-order reduction methods, decoupled search exploits the independence of components to tackle the state explosion problem. Similar to symbolic representations, it does not construct the explicit state space, but sets of states are represented in a compact manner, exploiting component independence. Given the success of both partial-order reduction and symbolic representations when model checking liveness properties, our goal is to add decoupled search to the toolset of liveness checking methods. Specifically, we show how decoupled search can be applied to liveness verification for composed Büchi automata by adapting, and showing correct, a standard algorithm for detecting lassos (i.e., infinite accepting runs), namely nested depth-first search. We evaluate our approach using a prototype implementation.

Subgoaling Techniques for Satisficing and Optimal Numeric Planning

This paper studies novel subgoaling relaxations for automated planning with propositional and numeric state variables. Subgoaling relaxations address one source of complexity of the planning problem: the requirement to satisfy conditions simultaneously. The core idea is to relax this requirement by recursively decomposing conditions into atomic subgoals that are considered in isolation. Such relaxations are typically used for pruning, or as the basis for computing admissible or inadmissible heuristic estimates to guide optimal or satis_cing heuristic search planners. In the last decade or so, the subgoaling principle has underpinned the design of an abundance of relaxation-based heuristics whose formulations have greatly extended the reach of classical planning. This paper extends subgoaling relaxations to support numeric state variables and numeric conditions. We provide both theoretical and practical results, with the aim of reaching a good trade-o_ between accuracy and computation costs within a heuristic state-space search planner. Our experimental results validate the theoretical assumptions, and indicate that subgoaling substantially improves on the state of the art in optimal and satisficing numeric planning via forward state-space search.

Numerical Methods for Optimization of the Horizontal Directional Drilling (HDD) Well Path Trajectory

Advances in the field of material engineering, computerization, automation, and equipment miniaturization enable modernization of the existing technologies and development of new solutions for construction, inspection, and renovation of underground pipelines. Underground pipe installations are used in the energy sector, gas industry, telecommunications, water and sewage transport, heating, chemical industry, and environmental engineering. In order to build new pipeline networks, dig and no-dig techniques are used. Horizontal Directional Drilling (HDD) is one of the most popular trenchless technologies. The effectiveness of HDD technology application is mostly determined by its properly designed trajectory. Drilling failures and complications, which often accompany the application of the HDD technology, result from poor design of the well path in relation to the existing geological and drilling conditions. The article presented two concepts of Horizontal Directional Drilling well path trajectory design: Classic sectional, which is a combination of straight and curvilinear sections, and a single-section chain curve trajectory (catenary). Taking into account the advantages and disadvantages of the catenary trajectory relative to the sectional trajectory, the author’s solution was presented, which was the implementation of the sectional trajectory with a maximum shape similarity to the catenary trajectory. The new approach allowed us to take advantage of a chain curve trajectory and was easier to implement using the available technology. The least squares method, based on deviations from a catenary trajectory, was set as the matching criterion. The process of searching for a trajectory, being a combination of straight and curvilinear sections as similar as possible to a catenary-type trajectory, was carried out using two methodologies: State space search and a genetic algorithm. The article shows the pros and cons of both optimization methodologies. Taking into account the technical and technological limitations of HDD drilling devices, a new approach was proposed, combining the methodology of state space search with the genetic algorithm. A calculation example showed the application of the proposed methodology in an engineering design process.

A PSO-Based CEGAR Framework for Stochastic Model Checking

Counterexample-guided abstraction refinement (CEGAR) is an extremely successful methodology for combating the state-space explosion problem in model checking. State-space explosion problem is more serious in the field of stochastic model checking, and it is still a challengeable problem to apply CEGAR in stochastic model checking effectively. In this paper, we formalize the problem of applying CEGAR in stochastic model checking, and propose a novel CEGAR framework for it. In our framework, the abstract model is presented by a quotient probabilistic automaton by making a set of variables or latches invisible, which can distinguish more degrees of abstraction for each variable. The counterexample is described by a diagnostic sub-model. Validating counterexample is performed on diagnostic loop paths, and the directed explicit state-space search algorithm is used for searching diagnostic loop paths. Sample learning, particle swarm optimization algorithm (PSO) and some effective heuristics are integrated for refining abstract model guided by invalid counterexample. A prototype tool is implemented for the framework, and the feasibility and efficiency are shown by some large cases.

Procedural Generation of Initial States of Sokoban

Procedural generation of initial states of state-space search problems have applications in human and machine learning as well as in the evaluation of planning systems. In this paper we deal with the task of generating hard and solvable initial states of Sokoban puzzles. We propose hardness metrics based on pattern database heuristics and the use of novelty to improve the exploration of search methods in the task of generating initial states. We then present a system called Beta that uses our hardness metrics and novelty to generate initial states. Experiments show that Beta is able to generate initial states that are harder to solve by a specialized solver than those designed by human experts.

Efficient Temporal Planning Using Metastates

When performing temporal planning as forward state-space search, effective state memoisation is challenging. Whereas in classical planning, two states are equal if they have the same facts and variable values, in temporal planning this is not the case: as the plans that led to the two states are subject to temporal constraints, one might be extendable into at temporally valid plan, while the other might not. In this paper, we present an approach for reducing the state space explosion that arises due to having to keep many copies of the same ‘classically’ equal state – states that are classically equal are aggregated into metastates, and these are separated lazily only in the case of temporal inconsistency. Our evaluation shows that this approach, implemented in OPTIC and compared to existing state-of-the-art memoisation techniques, improves performance across a range of temporal domains.