Abstract
It is generally agreed that a planner should be able to reason with uncertain and iterative behaviours because many actions in real world have such behaviours. Some of earlier non-linear planners have approached these issues, nevertheless, the way that they handle the problem has not been logically derived. We introduce a new type of nonlinear plans, Recursive Plans, which can be used to solve a class of conditional and recursive problems. The idea, which has been implemented, is based on mathematical induction.
Cite
CITATION STYLE
Ghassem-Sani, G. R., & Steel, S. W. D. (1991). Recursive plans. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 522 LNAI, pp. 53–63). Springer Verlag. https://doi.org/10.1007/BFb0052949
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.