Abstract
Traditional non-linear planners (NOAH, NONLIN, SIPE, …) construct plans of actions by progressively introducing and partially ordering actions in the initial plan to satisfy a set of constraints. On the other hand, our method, using the triangle table formalism, enables the planner to easily determine, in linear (over constrained) plans, all actions which can be executed in parallel (removing from the linear plan all the artificial order constraints). This information may then be used by a classical algorithm to optimize the resulting plan’s execution time.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Bibliography
D.Chapman, “Planning for conjunctive goals”, Artificial intelligence, nℴ32, 1987.
J.Cheng, K.B.Irani, “Ordering problem sub-goals”, IJCAI, 1989.
B.Fade, P.Regnier, “Une méthode complète de recherche du parallélisme dans les plans d’actions linéaires”, Congrès AFCET-RFIA, Paris, 1989.
S.E.Falhman, “A planning system for robot construction tasks„, Artificial intelligence nℴ 1, 1974.
R.E.Fikes, N.J.Nilsson, “STRIPS: a new approach to the application of theorem proving to problem solving”, Artificial intelligence nℴ2, 1971.
R.E.Fikes, “Monitored execution of robot plan produced by STRIPS”, IFIP, Yugoslavia, 1971.
R.E.Fikes, P.E.Hart, N.J.Nilsson, “Some new directions in robot problem solving”, Machine intelligence nℴ7, 1972.
R.E.Fikes, P.E.Hart, N.J.Nilsson, “Learning and executing generalized robot plans”, Artificial intelligence nℴ3, 1972.
R.E.Fikes, “Deductive retrievial mechanisms for state description models”, Technical note nℴ 106, AI center, SRI, 1975.
M.L.Ginsberg, D.E.Smith, “Reasoning about actions 1: a possible worlds approch”, “Reasoning about actions 2: the qualification problem”, Artificial intelligence nℴ35, 1988.
G.Gro\e, R.Waldinger, “Toward a theory of simultaneous actions”, First European workshop on planning, EWSP, 1991(à paraitre).
J.Hendler, A.Tate, M.Drummond, “AI planning: systems and techniques”, AAAI, 1990.
K.B.Irani, J.Cheng, “Sub-goal ordering and goal augmentation for heuristic problem solving”, IJCAI, 1987.
N.A.Kartam, E.D.Wilkins, “Towards a foundation for evaluating AI planners”, AI EDAM, Academic press, nℴ1, Vol.4, 1990.
V.Lifschitz, “On the semantics of STRIPS”, Proceedings of the 1986 workshop about actions and plans, 1986.
D.G.Malcolm & Col., “Application of a technique for research and development program evaluation”, Operations research, Vol.7, nℴ5, 1959.
N.J.Nilsson, “Triangle tables: a proposal for a robot programming language”, Technical note nℴ347, SRI International, February 1985.
J.F.Picardat, “ContrÔle d’exécution, compréhension et apprentissage de plans d’actions: développement de la méthode de la table triangulaire”, Thèse, IRIT, LSI, UPS-Toulouse, Juin 1987.
P.Regnier, “Optimisation temporelle des plans d’actions linéaires: une politique basée sur une méthode complète de recherche du parallélisme”, Rapport IRIT nℴ90/9/R, IRIT, UPS-Toulouse, Février 1990.
P.Regnier, “Planification: historique, principes, problèmes et méthodes (de GPS à TWEAK)”, Rapport IRIT nℴ90/22/R, IRIT, UPS-Toulouse, Juin 1990.
B.Roy, “Contribution de la théorie des graphes à l’étude des problèmes d’ordonnancement”, Actes de la 2ème conférence internationale sur la recherche opérationnelle, Aix-en-Provence, 1960.
E.D.Sacerdoti, “Planning in a hierarchy of abstraction spaces”, Artificial intelligence nℴ5, 1974.
E.D.Sacerdoti, “The non linear nature of plans”, IJCAI, 1975.
E.D.Sacerdoti, “A structure for plans and behavior”, Technical note nℴ109, Stanford research institute, AI center, 1975.
G.J.Sussman, “A computer model of skill acquisition”, MIT, Artificial intelligence laboratory, Cambridge, Report AI-TR-297, 1973. (Massachusetts Institute of Technology, American Elsevier Publishing Company, 1975).
A.Tate, “Generating project networks”, IJCAI, 1977.
S.A.Vere, “Planning in time: windows and durations for activities and goals”, Research report, Jet Propulsion Laboratory, Pasadena, 1981 (IEEE 1983).
R.Waldinger, “Achieving several goals simultaneously”, Machine Intelligence, pp. 80–136, Elcock & Michie/Ellis Horwood, Eds., Chichester, Sussex, 1977.
D.H.D.Warren, “Warplan: a system for generating plans”, Computational logic Dpt., Edinburgh, 1974.
D.E.Wilkins, “Representation in a domain independent planner”, IJCAI, 1983.
D.E.Wilkins, “Domain-independent planning: representation and plan generation”, Artificial intelligence nℴ22, April 1984.
D.E.Wilkins, “Hierarchical planning: definition, implementation”, ECAI, 1986.
D.E.Wilkins, “Practical planning: extending the classical AI planning paradigm”, Morgan Kaufmann Publishers, San Mateo, California, 1988.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Regnier, P., Fade, B. (1991). Complete determination of parallel actions and temporal optimization in linear plans of action. In: Hertzberg, J. (eds) European Workshop on Planning. EWSP 1991. Lecture Notes in Computer Science, vol 522. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0052953
Download citation
DOI: https://doi.org/10.1007/BFb0052953
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54364-0
Online ISBN: 978-3-540-47584-2
eBook Packages: Springer Book Archive