scholarly journals Imperfect Match: PDDL 2.1 and Real Applications

2003 ◽  
Vol 20 ◽  
pp. 133-137 ◽  
Author(s):  
M. S. Boddy
Keyword(s):  
Lingua Franca ◽  
Planning Models ◽  
Solution Methods ◽  
International Planning ◽  
Planning Problems

PDDL was originally conceived and constructed as a lingua franca for the International Planning Competition. PDDL2.1 embodies a set of extensions intended to support the expression of something closer to ``real planning problems.'' This objective has only been partially achieved, due in large part to a deliberate focus on not moving too far from classical planning models and solution methods.

scholarly journals Planning as tabled logic programming

2015 ◽  
Vol 15 (4-5) ◽  
pp. 543-558 ◽  
Author(s):  
NENG-FA ZHOU ◽  
ROMAN BARTÁK ◽  
AGOSTINO DOVIER
Keyword(s):  
Symmetry Breaking ◽  
Logic Programming ◽  
Domain Knowledge ◽  
Structured Data ◽  
Significant Progress ◽  
State Data ◽  
Planning Models ◽  
Modeling Techniques ◽  
International Planning ◽  
Domain Independent

AbstractThis paper describes Picat's planner, its implementation, and planning models for several domains used in International Planning Competition (IPC) 2014. Picat's planner is implemented by use of tabling. During search, every state encountered is tabled, and tabled states are used to effectively perform resource-bounded search. In Picat, structured data can be used to avoid enumerating all possible permutations of objects, and term sharing is used to avoid duplication of common state data. This paper presents several modeling techniques through the example models, ranging from designing state representations to facilitate data sharing and symmetry breaking, encoding actions with operations for efficient precondition checking and state updating, to incorporating domain knowledge and heuristics. Broadly, this paper demonstrates the effectiveness of tabled logic programming for planning, and argues the importance of modeling despite recent significant progress in domain-independent PDDL planners.

scholarly journals Compilation-Based Approaches to Parallel Planning: An Empirical Comparison

2021 ◽  
Vol 34 (1) ◽  
Author(s):  
Kristýna Pantůčková ◽  
Roman Barták
Keyword(s):  
Programming Language ◽  
Constraint Satisfaction ◽  
Constraint Satisfaction Problem ◽  
Automated Planning ◽  
Boolean Satisfiability ◽  
Planning Problem ◽  
Empirical Comparison ◽  
Boolean Satisfiability Problem ◽  
International Planning ◽  
Planning Problems

Automated planning deals with finding a sequence of actions, a plan, to reach a goal. One of the possible approaches to automated planning is a compilation of a planning problem to a Boolean satisfiability problem or to a constraint satisfaction problem, which takes direct advantage of the advancements of satisfiability and constraint satisfaction solvers. This paper provides a comparison of three encodings proposed for the compilation of planning problems: Transition constraints for parallel planning (TCPP), Relaxed relaxed exist-Step encoding and Reinforced Encoding. We implemented the encodings using the programming language Picat 2.8, we suggested certain modifications, and we compared the performance of the encodings on benchmarks from international planning competitions.

scholarly journals Grounding of HTN Planning Domain

2017 ◽  
Vol 26 (05) ◽  
pp. 1760021 ◽  
Author(s):  
Abdeldjalil Ramoul ◽  
Damien Pellier ◽  
Humbert Fiorino ◽  
Sylvie Pesty
Keyword(s):  
Expert Knowledge ◽  
State Of The Art ◽  
Autonomous Systems ◽  
Planning Problem ◽  
World State ◽  
Hierarchical Task Network ◽  
Htn Planning ◽  
Speed Up ◽  
International Planning ◽  
Planning Problems

Many Artificial Intelligence techniques have been developed for intelligent and autonomous systems to act and make rational decisions based on perceptions of the world state. Among these techniques, HTN (Hierarchical Task Network) planning is one of the most used in practice. HTN planning is based on expressive languages allowing to specify complex expert knowledge for real world domains. At the same time, many preprocessing techniques for classical planning were proposed to speed up the search. One of these technique, named grounding, consists in enumerating and instantiating all the possible actions from the planning problem descriptions. This technique has proven its effectiveness. Therefore, combining the expressiveness of HTN planning with the efficiency of the grounding preprocessing techniques used in classical planning is a very challenging issue. In this paper, we propose a generic algorithm to ground the domain representation for HTN planning. We show experimentally that grounding process improves the performances of state of the art HTN planners on a range of planning problems from the International Planning Competition (IPC).

Revisiting dynamic constraint satisfaction for model-based planning

2016 ◽  
Vol 31 (5) ◽  
pp. 429-439
Author(s):  
Jeremy Frank
Keyword(s):  
Constraint Satisfaction ◽  
Optimization Problems ◽  
Constraint Satisfaction Problem ◽  
Automated Planning ◽  
Planning Models ◽  
Constraint Reasoning ◽  
Dynamic Constraint ◽  
Mixed Initiative ◽  
Planning Problems

AbstractAs planning problems become more complex, it is increasingly useful to integrate complex constraints on time and resources into planning models, and use constraint reasoning approaches to help solve the resulting problems. Dynamic constraint satisfaction is a key enabler of automated planning in the presence of such constraints. In this paper, we identify some limitations with the previously developed theories of dynamic constraint satisfaction. We identify a minimum set of elementary transformations from which all other transformations can be constructed. We propose a new classification of dynamic constraint satisfaction transformations based on a formal criteria, namely the change in the fraction of solutions. This criteria can be used to evaluate elementary transformations of a constraint satisfaction problem as well as sequences of transformations. We extend the notion of transformations to include constrained optimization problems. We discuss how this new framework can inform the evolution of planning models, automated planning algorithms, and mixed-initiative planning.

scholarly journals Exploring Lifted Planning Encodings in Essence Prime

2021 ◽  
Author(s):  
Joan Espasa ◽  
Jordi Coll ◽  
Ian Miguel ◽  
Mateu Villaret
Keyword(s):  
State Space ◽  
Programming Language ◽  
Constraint Programming ◽  
Community Planning ◽  
Automated Planning ◽  
Search Method ◽  
Compact Representation ◽  
Space Planning ◽  
International Planning ◽  
Planning Problems

State-space planning is the de-facto search method of the automated planning community. Planning problems are typically expressed in the Planning Domain Definition Language (PDDL), where action and variable templates describe the sets of actions and variables that occur in the problem. Typically, a planner begins by generating the full set of instantiations of these templates, which in turn are used to derive useful heuristics that guide the search. Thanks to this success, there has been limited research in other directions. We explore a different approach, keeping the compact representation by directly reformulating the problem in PDDL into ESSENCE PRIME, a Constraint Programming language with support for distinct solving technologies including SAT and SMT. In particular, we explore two different encodings from PDDL to ESSENCE PRIME, how they represent action parameters, and their performance. The encodings are able to maintain the compactness of the PDDL representation, and while they differ slightly, they perform quite differently on various instances from the International Planning Competition.

A GIS-Based Decision-Support Tool for Public Facility Planning

10.1068/b1281 ◽  
2002 ◽  
Vol 29 (4) ◽  
pp. 553-569 ◽  
Author(s):  
Alexandra Ribeiro ◽  
António Pais Antunes
Keyword(s):  
Decision Support ◽  
Decision Support Tool ◽  
Optimization Methods ◽  
Facility Planning ◽  
Public Facility ◽  
Support Tool ◽  
Public Facilities ◽  
Solution Methods ◽  
User Friendly ◽  
Planning Problems

The installation and operation of public facilities, such as schools or hospitals, involve important amounts of public spending, and therefore need to be carefully planned. Research efforts made since the early 1960s led to the development of a rich collection of optimization models and solution methods for public facility planning problems. It must be recognized, however, that the practical impact of the efforts made up to now is rather weak. This paper presents an interactive, user-friendly decision-support tool for public facility planning where the capabilities of geographic information systems and advanced optimization methods are put together. We hope that it will contribute to bridge the gap between research and practice that characterizes the way public facility planning is made at present. The application of the decision-support tool is illustrated for a real-world setting.

scholarly journals Log yard logistics

Silva Fennica ◽  
2018 ◽  
Vol 52 (4) ◽  
Author(s):  
Maria Huka ◽  
Manfred Gronalt
Keyword(s):  
Oriented Strand Board ◽  
Raw Materials ◽  
Real Life ◽  
Movement Planning ◽  
Raw Material ◽  
Paper Mills ◽  
Solution Methods ◽  
Operational Improvement ◽  
Planning Problems ◽  
Vehicle Movement

For sawmills, paper mills, particleboard, oriented strand board (OSB), fiberboard and other wood production factories, the log yard is the first step, where raw materials are sorted and stored before production begins. Due to the size of these production sites great potential exists for the optimisation of internal logistics. In this paper the different planning problems of the log yard are introduced and existing literature examined. Beginning with the tactical problems of structure, such as assessing material flow, planning facility layout and assigning storage areas, it continues with operational problems such as vehicle movement planning within the log yard, empty trip minimisation and the seasonality of raw material availability. Data derived from this study reveals a variety of possible solution methods, the applicability of which depends on the precise nature of the log yard operations. Additionally, several real life examples are provided which illustrate the potential for operational improvement.

scholarly journals On Succinct Groundings of HTN Planning Problems

2020 ◽  
Vol 34 (06) ◽  
pp. 9775-9784 ◽  
Author(s):  
Gregor Behnke ◽  
Daniel Höller ◽  
Alexander Schmid ◽  
Pascal Bercher ◽  
Susanne Biundo
Keyword(s):  
Planning Systems ◽  
New Approach ◽  
Planning Models ◽  
Htn Planning ◽  
Description Languages ◽  
Planning Problems

Both search-based and translation-based planning systems usually operate on grounded representations of the problem. Planning models, however, are commonly defined using lifted description languages. Thus, planning systems usually generate a grounded representation of the lifted model as a preprocessing step. For HTN planning models, only one method to ground lifted models has been published so far. In this paper we present a new approach for grounding HTN planning problems that produces smaller groundings in a shorter timespan than the previously published method.

Review on Transmission Expansion Planning Models

2016 ◽  
Vol 818 ◽  
pp. 129-133
Author(s):  
Ibrahim Alhamrouni ◽  
Azhar Khairuddin ◽  
Mohamed Salem ◽  
Abdelrahman Alnajjar
Keyword(s):  
Rapid Growth ◽  
Planning Horizon ◽  
The Other ◽  
Transmission Networks ◽  
Expansion Planning ◽  
Transmission Expansion Planning ◽  
Transmission Expansion ◽  
Planning Models ◽  
Solution Methods ◽  
Feasible Algorithm

Transmission expansion planning has become a complicated procedure more than any time it was with the rapid growth of the transmission networks, therefore, this work summarizes the works had been done before regarding this topic. This review classifies the existing works from many sides such as, solution methods, planning horizon and from the modeling prospective in order to facilitate the other researcher’s works in this hot area to get a feasible algorithm academically and commercially. The drawbacks of the TEP procedure and some recommendations are also included.

Sign in / Sign up

Export Citation Format

Share Document