scholarly journals Relaxation of Temporal Planning Problems

2013 ◽  
Author(s):  
Martin C. Cooper ◽  
Frédéric Maris ◽  
Pierre Régnier
Keyword(s):  
Temporal Planning ◽  
Planning Problems

A Planning Algorithm with Temporal Constraints in the Working Procedures

2013 ◽  
Vol 760-762 ◽  
pp. 1786-1789
Author(s):  
Xiao Long Chai
Keyword(s):  
Ant Colony Algorithm ◽  
Convergence Acceleration ◽  
Research Area ◽  
Ant Colony ◽  
Temporal Constraints ◽  
Temporal Planning ◽  
Control Rules ◽  
Real World Applications ◽  
Planning Algorithm ◽  
Planning Problems

Temporal planning is a broad research area in automated planning. In most real-world applications such as the problems of working procedures planning, many real planning problems often require the planning goals can be satisfied in shorter time and some temporal constraints should be satisfied in the planning answer. In this paper, the ant colony algorithm under the temporal constraints is presented which with the heuristic control rules and the evaluation tactics in the framework of the ant colony planning algorithm. The searching way of the algorithm has the character of global and parallel. And it has the ability of convergence acceleration in the solution searching.

scholarly journals Monotone Temporal Planning: Tractability, Extensions and Applications

2014 ◽  
Vol 50 ◽  
pp. 447-485 ◽  
Author(s):  
M. Cooper ◽  
F. Maris ◽  
P. Régnier
Keyword(s):  
Polynomial Time ◽  
Temporal Information ◽  
Planning Problem ◽  
Temporal Planning ◽  
Concurrent Execution ◽  
Difference Constraints ◽  
Potential Applications ◽  
Polynomially Solvable ◽  
Solvable Class ◽  
Planning Problems

This paper describes a polynomially-solvable class of temporal planning problems. Polynomiality follows from two assumptions. Firstly, by supposing that each sub-goal fluent can be established by at most one action, we can quickly determine which actions are necessary in any plan. Secondly, the monotonicity of sub-goal fluents allows us to express planning as an instance of STP≠ (Simple Temporal Problem with difference constraints). This class includes temporally-expressive problems requiring the concurrent execution of actions, with potential applications in the chemical, pharmaceutical and construction industries. We also show that any (temporal) planning problem has a monotone relaxation which can lead to the polynomial-time detection of its unsolvability in certain cases. Indeed we show that our relaxation is orthogonal to relaxations based on the ignore-deletes approach used in classical planning since it preserves deletes and can also exploit temporal information.

scholarly journals ITSAT: An Efficient SAT-Based Temporal Planner

2015 ◽  
Vol 53 ◽  
pp. 541-632 ◽  
Author(s):  
Masood Feyzbakhsh Rankooh ◽  
Gholamreza Ghassem-Sani
Keyword(s):  
State Space ◽  
State Of The Art ◽  
Relation Extraction ◽  
The State ◽  
Parallel Execution ◽  
Temporal Constraints ◽  
Continuous Variables ◽  
Temporal Planning ◽  
Execution Semantics ◽  
Planning Problems

Planning as satisfiability is known as an efficient approach to deal with many types of planning problems. However, this approach has not been competitive with the state-space based methods in temporal planning. This paper describes ITSAT as an efficient SAT-based (satisfiability based) temporal planner capable of temporally expressive planning. The novelty of ITSAT lies in the way it handles temporal constraints of given problems without getting involved in the difficulties of introducing continuous variables into the corresponding satisfiability problems. We also show how, as in SAT-based classical planning, carefully devised preprocessing and encoding schemata can considerably improve the efficiency of SAT-based temporal planning. We present two preprocessing methods for mutex relation extraction and action compression. We also show that the separation of causal and temporal reasoning enables us to employ compact encodings that are based on the concept of parallel execution semantics. Although such encodings have been shown to be quite effective in classical planning, ITSAT is the first temporal planner utilizing this type of encoding. Our empirical results show that not only does ITSAT outperform the state-of-the-art temporally expressive planners, it is also competitive with the fast temporal planners that cannot handle required concurrency.

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

A CSP-Based Approach for Temporal Constraints in Temporal Planning

2012 ◽  
Vol 35 (8) ◽  
pp. 1759
Author(s):  
Li-Hua WU ◽  
Ai-Xiang CHEN ◽  
Yun-Fei JIANG ◽  
Rui BIAN
Keyword(s):  
Temporal Constraints ◽  
Temporal Planning
Sign in / Sign up

Export Citation Format

Share Document