An action guided constraint satisfaction technique for planning problem

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.

Download Full-text

Planning with Concurrency, Time and Resources

Intelligent Techniques for Planning ◽

10.4018/978-1-59140-450-7.ch008 ◽

2005 ◽

pp. 259-295 ◽

Cited By ~ 2

Author(s):

Amedeo Cesta ◽

Simone Fratini ◽

Angelo Oddi

Keyword(s):

Constraint Satisfaction ◽

Resource Availability ◽

Constraint Satisfaction Problem ◽

Satellite System ◽

Domain Model ◽

Planning Problem ◽

Planning And Scheduling ◽

Planning Framework ◽

Current Implementation ◽

Domain Description

This chapter proposes to model a planning problem (e.g., the control of a satellite system) by identifying a set of relevant components in the domain (e.g., communication channels, on-board memory or batteries), which need to be controlled to obtain a desired temporal behavior. The domain model is enriched with the description of relevant constraints with respect to possible concurrency, temporal limits and scarce resource availability. The paper proposes a planning framework based on this view that relies on a formalization of the problem as a Constraint Satisfaction Problem (CSP) and defines an algorithmic template in which the integration of planning and scheduling is a fundamental feature. In addition, the paper describes the current implementation of a constraint-based planner called OMP that is grounded on these ideas and shows the role constraints have in this planner, both at domain description level and as a guide for problem solving.

Download Full-text

Multi-Layer Distributed Constraint Satisfaction for Multi-criteria Optimization Problem

International Journal of Applied Metaheuristic Computing ◽

10.4018/ijamc.2020040107 ◽

2020 ◽

Vol 11 (2) ◽

pp. 134-155 ◽

Cited By ~ 1

Author(s):

Mouna Gargouri Mnif ◽

Sadok Bouamama

Keyword(s):

Constraint Satisfaction ◽

Optimization Problem ◽

Transportation Network ◽

Optimization Methods ◽

Planning Problem ◽

Scheduling Problems ◽

Present Contribution ◽

Multimodal Transportation ◽

New Approach ◽

Distributed Constraint Satisfaction

This article introduces a new approach to solve the multimodal transportation network planning problem (MTNP). In this problem, the commodities must be transported from an international network by at least two different transport modes. The main purpose is to identify the best multimodal transportation strategy. The present contribution focuses on efficient optimization methods to solve MTNP. This includes the assignment and the scheduling problems. The authors split the MTNP into layered. Each layer is presented by an agent. These agents interact, collaborate, and communicate together to solve the problem. This article defines MTNP as a distributed constraint satisfaction multi-criteria optimization problem (DCSMOP). This latter is a description of the constraint optimization problem (COP), where variables and constraints are distributed among a set of agents. Each agent can interact with other agents to share constraints and to distribute complementary tasks. Experimental results are the proof of this work efficiently.

Download Full-text

A Constraint Satisfaction Problem Model and Its Symbolic OBDD Solving for Assembly Sequence Planning Problem

Journal of Computer-Aided Design & Computer Graphics ◽

10.3724/sp.j.1089.2010.10800 ◽

2010 ◽

Vol 22 (5) ◽

pp. 803-810 ◽

Cited By ~ 3

Author(s):

Zhoubo Xu ◽

Tianlong Gu

Keyword(s):

Constraint Satisfaction ◽

Constraint Satisfaction Problem ◽

Assembly Sequence Planning ◽

Planning Problem ◽

Assembly Sequence ◽

Problem Model ◽

Sequence Planning

Download Full-text

An Action Guided Constraint Satisfaction Technique for Planning Problem

International Journal of Software Science and Computational Intelligence ◽

10.4018/ijssci.2016070103 ◽

2016 ◽

Vol 8 (3) ◽

pp. 39-53

Author(s):

Xiao Jiang ◽

Pingyuan Cui ◽

Rui Xu ◽

Ai Gao ◽

Shengying Zhu

Keyword(s):

Theoretical Analysis ◽

Constraint Satisfaction ◽

Constraint Satisfaction Problems ◽

Planning Problem ◽

Simulation Experiments ◽

Running Time ◽

Standard Version ◽

Planning Procedure ◽

Heuristic Technique ◽

Order Of Magnitude

This paper presents an action guided constraint satisfaction technique for planning problem. Different from the standard algorithms which are almost domain independence and cannot reflect the characteristics of the planning progress, this paper discusses how the action rules in planning act in constraint satisfaction problems. Based on the conclusion, an action directed constraint is proposed to guide the variable selected procedure in constraint satisfaction problems. Through theoretical analysis, this technique is prior an order of magnitude in variable select procedure over the ordinary heuristic technique and can be used in constraint-programmed planning problem generally. With the simulation experiments it shows that the algorithm with action guided constraint can effectively reduce the number of constraint checks during the planning procedure and has a better performance on total running time over the standard version.

Download Full-text