Hierarchical task network approach for time and budget constrained construction project planning

© 2019 The Author(s). Completing a construction project on time and within budget is of great importance in the construction industry. To achieve this goal, a construction plan satisfying the time and cost constraints is crucial. While a rich amount of literature on the time-cost trade-off scheduling and time/cost optimization scheduling has been presented, developing a construction plan for the time and cost-constrained construction project has not been fully explored. This study presented a hierarchical task network (HTN) based construction planning model to fill this gap. First of all, a knowledge formalism catering to the HTN planning was provided to accommodate the construction planning knowledge. Then, the planning process was explained in detail, including temporal reasoning used to sequence the construction activities, and backtracking evasion mechanism used to avoid the trouble of backtracking due to inappropriate selection of execution modes for construction activities. Finally, two sets of comparisons based on a fictional construction project were performed, the results of which demonstrate that the time and budget constraints have an impact on the sec-tion of execution modes for construction methods, and the proposed planning model can develop construction plan that satisfies the specified deadline and budget limitations effectively regardless of the existing of backtracking

Generating Instructions at Different Levels of Abstraction

When generating technical instructions, it is often convenient to describe complex objects in the world at different levels of abstraction. A novice user might need an object explained piece by piece, while for an expert, talking about the complex object (e.g. a wall or railing) directly may be more succinct and efficient. We show how to generate building instructions at different levels of abstraction in Minecraft. We introduce the use of hierarchical planning to this end, a method from AI planning which can capture the structure of complex objects neatly. A crowdsourcing evaluation shows that the choice of abstraction level matters to users, and that an abstraction strategy which balances low-level and high-level object descriptions compares favorably to ones which don't.Comment: Accepted COLING 2020 long pape

Lilotane : A Lifted SAT-based Approach to Hierarchical Planning

One of the oldest and most popular approaches to automated planning is to encode the problem at hand into a propositional formula and use a Satisfiability (SAT) solver to find a solution. In all established SAT-based approaches for Hierarchical Task Network (HTN) planning, grounding the problem is necessary and oftentimes introduces a combinatorial blowup in terms of the number of actions and reductions to encode. Our contribution named Lilotane (Lifted Logic for Task Networks) eliminates this issue for Totally Ordered HTN planning by directly encoding the lifted representation of the problem at hand. We lazily instantiate the problem hierarchy layer by layer and use a novel SAT encoding which allows us to defer decisions regarding method arguments to the stage of SAT solving. We show the correctness of our encoding and compare it to the best performing prior SAT encoding in a worst-case analysis. Empirical evaluations confirm that Lilotane outperforms established SAT-based approaches, often by orders of magnitude, produces much smaller formulae on average, and compares favorably to other state-of-the-art HTN planners regarding robustness and plan quality. In the International Planning Competition (IPC) 2020, a preliminary version of Lilotane scored the second place. We expect these considerable improvements to SAT-based HTN planning to open up new perspectives for SAT-based approaches in related problem classes