An Action-Based Constraint Satisfaction Algorithm for Planning Problems

2017 ◽  
pp. 412-417
Author(s):  
Xiao Jiang ◽  
Yuting Zhao ◽  
Rui Xu ◽  
Wenming Xu
Keyword(s):  
Constraint Satisfaction ◽  
Planning Problems

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.

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.

T-SATPLAN: A SAT-BASED TEMPORAL PLANNER

2006 ◽  
Vol 15 (05) ◽  
pp. 779-802 ◽  
Author(s):  
AMOL DATTATRAYA MALI ◽  
YING LIU
Keyword(s):  
Constraint Satisfaction ◽  
Heuristic Search ◽  
Constraint Satisfaction Problems ◽  
Optimal Planning ◽  
Encoding Scheme ◽  
Temporal Planning ◽  
Sat Encoding ◽  
Csp Solving ◽  
Planning Problems ◽  
True False

Recent advances in solving constraint satisfaction problems (CSPs) and heuristic search have made it possible to solve classical planning problems significantly faster. There is an increasing amount of work on extending these advances to solving planning problems in more expressive languages. These problems and languages contain metric time, quantifiers and resource quantities. SAT-based approaches are very effective at optimal planning. In this paper we report on SAT-based temporal planner T-SATPLAN. One key challenge in the development of planners casting planning as SAT or CSP is the identification of constraints which are satisfied if and only if there is a plan of k steps. In this paper we show how such a SAT encoding can be synthesized for temporal planning. As part of this, we generalize explanatory frame axioms for two states of fluents (true, false) to three states of fluents (true, false and undefined). We show how this SAT encoding can be simplified. We discuss two additional SAT encodings of temporal planning. The encoding schemes make it easier to exploit progress in SAT and CSP solving to solve temporal planning problems. We also report on an experimental evaluation of T-SATPLAN using one such encoding scheme. The evaluation shows that significantly large SAT encodings of temporal planning problems can be solved extremely fast.

Production management of standardized products using electronic process automation — single window

2020 ◽  
Keyword(s):  
Programming Languages ◽  
Production Management ◽  
Work Place ◽  
Web Interface ◽  
Process Automation ◽  
Control Programs ◽  
New Information ◽  
Shift Report ◽  
Planning Problems ◽  
Registration Card

A non-standard approach to solving the activation planning problems of the standardized products in a multinomenclature workshop is considered. This approach is caused by writing control programs and developing new information systems without changing previously developed workstations, which were created by using an outdated programming languages, in particular Clipper applications. The concept of creating a single information space — a set of databases and software tools integrated at the software level is proposed. Keywords standardized product; normal; software; web interface; single window; automatic work place; production task; shift task; order-shift report; control and registration card

Recreation and Urban Park Planning: Problems and Prospects

1981 ◽  
Vol 11 (4) ◽  
pp. 315-323 ◽  
Author(s):  
Mike Moore ◽  
Woodrow Jones
Keyword(s):  
Urban Park ◽  
Park Planning ◽  
Planning Problems
Sign in / Sign up

Export Citation Format

Share Document