Abstract
In 1971 N. Nilson introduced a very smart improvement of forward search methodology in classical planning. It is commonly known as STRIPS. However, the original STRIPS is not sensitive to temporal and preferential aspects of reasoning. Unfortunately, neither temporal, nor preferential extension of STRIPS is known. This paper is just aimed at proposing such an extension, called later TP-STRIPS. In addition, some of its meta-logical properties are proved. It is also shown how TP-STRIPS may be exploited in more practical contexts.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsNotes
- 1.
We can see \(\pi \) as a functions from a set of states S and E(S) — as set of actions applicable to S.
- 2.
We assume that \((d_{i},z_{j})\not = (d_{k}, z_{l})\) are disjoint for \(i\not = k\) and \(j\not = l\).
- 3.
Because of generality of consideration, we omit possible ways of defining such a function. Anyhow, it may be defined, for example, as follows (Fig. 1):
$$\begin{aligned} f((d,z)^{a}_{n}) = {\left\{ \begin{array}{ll} A(d_{1},z_{1}) &{} \mathrm {for} (d_{1},z_{1})^{a}_{n} \\ - B(d_{k},z_{l}) &{} \mathrm {for} (d_{k},z_{l})^{a}_{n} \\ \sum X_{n, d, z,a} &{} \mathrm {otherwise} \end{array}\right. } \end{aligned}$$(1)for A(d, z) and \(-B(d,z)\) being linear functions of arguments \((d_{1},z_{1})\) and \((d_{k},z_{l})\) (resp.) for parameters \(A, B> 0\).
- 4.
We do not specify this function, we only assume a general condition of Lebesque integrability of it. It seems to be important because of the integral-based representation of preferences later. We omit, however, a detailed explanation.
- 5.
This possibility holds if all actions remain ‘good’ as respecting temporal constraints from C.
- 6.
Because of a very broad nature of the Ohlbach’s approach, we omit his explications. They might be easily found in these works.
- 7.
In order to preserve generality of considerations, we omit a detailed specification of the initial state \(s_{0}\) and a goal g. As such a pair of agents one can take, for example a pair:(crane, robot) etc.
- 8.
We can assume that h(x) represents meet(i, j)(x) Allen relation. Anyhow, this identification is redundant from the point of view of the current analysis.
- 9.
We omit its formulation. It may be easily found in each handbook of real and abstract analysis. See, for example: [5].
References
Fikes, P., Nilsson, N.: Strips: a new appraoch to the application of theorem proving to problem solving. Artif. Intell. 2(3–4), 189–208 (1971)
Fox, M., Long, D.: Pddl+: Planning with time and metric sources. Technical report, University of Durham (2001a)
Fox, M., Long, D.: Pddl2.1: an extension to pddl for expressing temporal planning domains. Technical report, University of Durham (2001b)
Fox, M., Long, D.: An extension to pddl for expressing temporal planning domains. J. Artif. Intell. Res. 20, 61–124 (2003)
Hewitt, E., Stromberg, K.: Real and Abstract Analysis. Springer, New York (1965)
Jobczyk, K., Ligeza, A.: Fuzzy-temporal approach to the handling of temporal interval relations and preferences. In: Proceeding of INISTA, pp. 1–8 (2015)
Jobczyk, K., Ligeza, A.: Multi-valued halpern-shoham logic for temporal allen’s relations and preferences. In: Proceedings of the Annual International Conference of Fuzzy Systems (FuzzIEEE) (2016, page to appear)
Jobczyk, K., Ligeza, A.: Systems of temporal logic for a use of engineering. Toward a more practical approach. In: Stýskala, V., Kolosov, D., Snášel, V., Karakeyev, T., Abraham, A. (eds.) Intelligent Systems for Computer Modelling. AISC, vol. 423, pp. 147–157. Springer, Cham (2016). doi:10.1007/978-3-319-27644-1_14
Jobczyk, K., Ligeza, A., Kluza, K.: Selected temporal logic systems: an attempt at engineering evaluation. In: Rutkowski, L., Korytkowski, M., Scherer, R., Tadeusiewicz, R., Zadeh, L.A., Zurada, J.M. (eds.) ICAISC 2016. LNCS (LNAI), vol. 9692, pp. 219–229. Springer, Cham (2016). doi:10.1007/978-3-319-39378-0_20
Jobczyk, K., Bouzid M., Ligeza, A., Karczmarczuk, J.: Fuzzy integral logic expressible by convolutions. In: Proceeding of ECAI 2014, pp. 1042–1043 (2014)
Jobczyk, K., Bouzid M., Ligeza, A., Karczmarczuk, J.: Fuzzy logic for representation of temporal verbs and adverbs ‘often’ and ‘many times’. In: Proceeding of LENSL 2011 Tokyo (2014)
Jobczyk, K., Ligęza, A., Bouzid, M., Karczmarczuk, J.: Comparative approach to the multi-valued logic construction for preferences. In: Rutkowski, L., Korytkowski, M., Scherer, R., Tadeusiewicz, R., Zadeh, L.A., Zurada, J.M. (eds.) ICAISC 2015. LNCS (LNAI), vol. 9119, pp. 172–183. Springer, Cham (2015). doi:10.1007/978-3-319-19324-3_16
Lifschitz, V.: On the semantics of strips. In: Georgeff, M.P., Lansky, A.L., (eds.) Reasoning about Actions and Plans, pp. 1–9, 523–530 (1990)
Ohlbach, H.: Fuzzy time intervals and relations-the futire library. Research Report PMS-04/04, Inst. f. Informatik, LMU Munich (2004)
Ohlbach, H.: Relations between time intervals. In: 11th Internal Symposium on Temporal Representation And Reasoning, vol. 7, pp. 47–50 (2004)
Traverso, P., Ghallab, M., Nau, D.: Automated Planning: Theory and Practice. Elsevier, Amsterdam (2004). 1997
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Jobczyk, K., Ligeza, A. (2017). STRIPS in Some Temporal-Preferential Extension. In: Rutkowski, L., Korytkowski, M., Scherer, R., Tadeusiewicz, R., Zadeh, L., Zurada, J. (eds) Artificial Intelligence and Soft Computing. ICAISC 2017. Lecture Notes in Computer Science(), vol 10245. Springer, Cham. https://doi.org/10.1007/978-3-319-59063-9_22
Download citation
DOI: https://doi.org/10.1007/978-3-319-59063-9_22
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-59062-2
Online ISBN: 978-3-319-59063-9
eBook Packages: Computer ScienceComputer Science (R0)