Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
COMPLEXITY RESULTS FOR SAS+ PLANNING
C Bäckström, B Nebel - Computational Intelligence, 1995 - Wiley Online Library
We have previously reported a number of tractable planning problems defined in the SAS+
formalism. This article complements these results by providing a complete map over the …
formalism. This article complements these results by providing a complete map over the …
[PDF][PDF] Parallel non-binary planning in polynomial time
I Klein - 12th International Joint Conference on Artificial …, 1991 - academia.edu
This paper formally presents a class of planning problems which allows non-binary state
variables and parallel execution of actions. The class is proven to be tractable, and we …
variables and parallel execution of actions. The class is proven to be tractable, and we …
[BOK][B] On the planning problem in sequential control
I Klein, C Bäckström - 1991 - ida.liu.se
Sequential control is a common control problem in industry. Despite its importance fairly little
theoretical research has been devoted to this problem. We study a subclass of sequential …
theoretical research has been devoted to this problem. We study a subclass of sequential …
Representation and parallelization techniques for classical planning
TC Schmidt - 2012 - mediatum.ub.tum.de
Artificial Intelligence as a field concerns itself with the study and design of intelligent agents.
Such agents or systems perceive their environment, reason over their accumulated …
Such agents or systems perceive their environment, reason over their accumulated …
A Feedback Transformation of the Planning Problems
I Sierocki - Applicable Algebra in Engineering, Communication …, 1998 - Springer
This paper proposes a problem transformation method, called feedback transformation
method, for solving the planning problems. Some basic notions from the theory of problem …
method, for solving the planning problems. Some basic notions from the theory of problem …