论文信息 - An Introduction to the Decomposition of Task Representations in Autonomous Systems

An Introduction to the Decomposition of Task Representations in Autonomous Systems

We describe the need for representation change and problem decomposition in autonomous systems, and outline our algebraic approach to reasoning about actions. We describe how a problem, represented as a machine, can be decomposed into hierarchical machines with reduced search complexity, and illustrate our techniques with examples.

Leo Dorst | Paul Benjamin | Indur B. Mandhyan | Madeleine Rosar

[1] Tadahiro Kitahashi,et al. A Problem-Decomposition Method Using Differences or Equivalence Relations Between States , 1985, Artif. Intell..

[2] J. McCarthy. A Tough Nut for Proof Procedures , 1964 .

[3] David A. Plaisted,et al. Using Examples, Case Analysis, and Dependency Graphs in Theorem Proving , 1984, CADE.

[4] J. P. E. Hodgson. Solving Problems by Subproblem Classification , 1988, ISMIS.

[5] Michael R. Lowry. The Abstraction/Implementation Model of Problem Reformulation , 1987, IJCAI.

[6] G. Sawatzky,et al. Using An Efficient Collision Detector In The Solution Of The Find-Path Problem Of Industrial Robots , 1985, Other Conferences.

[7] Saul Amarel,et al. On representations of problems of reasoning about actions , 1968 .

[8] R.B. Banerji. Theory of problem solving: A branch of artificial intelligence , 1982, Proceedings of the IEEE.

[9] Jonathan P.E. Hodgson. Pushouts and Problem Solving , 1989 .

[10] R. Korf. Learning to solve problems by searching for macro-operators , 1983 .