Efficient planning for a miniature assembly line

This paper presents a provably correct and efficient, polynomial time, planning tool and its application to a miniature assembly line for toy cars. Although somewhat limited, this process has many similarities with real industrial processes. One of our previous polynomial-time planning algorithms has been extended and adapted to work for a larger class of planning problems, including this particular process. The plans produced by the planner are then translated into GRAFCET charts, which are compiled into code for a programmable logic controller. Although capable of producing ordinary assembly plans, the system is mainly intended for producing plans in error recovery situations.

[1]  David Chapman,et al.  Planning for Conjunctive Goals , 1987, Artif. Intell..

[2]  Craig A. Knoblock.  Automatically Generating Abstractions for Planning , 1994, Artif. Intell..

[3]  József Váncza,et al.  Inference and Optimization Methods for Manufacturing Process Planning , 1994, ECAI.

[4]  Panos J. Antsaklis,et al.  A system and control theoretic perspective on artificial intelligence planning systems , 1989, Appl. Artif. Intell..

[5]  Satyandra K. Gupta,et al.  AI Planning Versus Manufacturing-Operation Planning: A Case Study , 1995, IJCAI.

[6]  Bernhard Nebel,et al.  COMPLEXITY RESULTS FOR SAS+ PLANNING , 1995, Comput. Intell..

[7]  Rangasami L. Kashyap,et al.  Using dynamic memory structures in planning and its application to manufacturing , 1987 .

[8]  Tamás Kis,et al.  Computational complexity of manufacturing process planning , 1996 .

[9]  Hector Muñoz-Avila,et al.  Planning for Manufacturing Workpieces by Storing, Indexing and Replaying Planning Decisions , 1996, AIPS.

[10]  Christer Bäckström.  Equivalence and Tractability Results for SAS+ Planning , 1992, KR.

[11]  Stephen V. Chenoweth.  On the NP-Hardness of Blocks World , 1991, AAAI.

[12]  Karl Johan Åström,et al.  Meeting the challenge of computer science in the industrial applications of control: An introductory discussion to the special issue, , 1993, Autom..

[13]  Christer Bäckström.  Finding Least Constrained Plans and Optimal Parallel Executions is Harder than We Thought , 1994 .

[14]  Earl D. Sacerdoti,et al.  Planning in a Hierarchy of Abstraction Spaces , 1974, IJCAI.

[15]  Christer Bäckström,et al.  Incremental planning , 1996 .

[16]  Christer Bäckström,et al.  Tractable Planning with State Variables by Exploiting Structural Restrictions , 1994, AAAI.

[17]  Christer Bäckström,et al.  State-Variable Planning Under Structural Restrictions: Algorithms and Complexity , 1998, Artif. Intell..

[18]  I. Klein,et al.  Automatic synthesis of control programs in polynomial time for an assembly line , 1996, Proceedings of 35th IEEE Conference on Decision and Control.

[19]  Christer Bäckström,et al.  Tractable planning for an assembly line , 1995 .

[20]  Rangasami L. Kashyap,et al.  Artificial Intelligence: Manufacturing Theory and Practice , 1988 .

[21]  Christer Bäckström,et al.  Parallel Non-Binary Planning in Polynomial Time , 1991, IJCAI.

[22]  James Madden,et al.  Preparation of function charts for control systems , 1988 .

[23]  René David,et al.  Petri nets and grafcet - tools for modelling discrete event systems , 1992 .

[24]  Stephen V. Chenoweth.  On the NP-ardness of blocks world , 1991 .

[25]  C. Backstrom,et al.  On the planning problem in sequential control , 1991, [1991] Proceedings of the 30th IEEE Conference on Decision and Control.

[26]  Bernhard Nebel,et al.  Five Years of Tractable Planning , 1995 .

[27]  Christer Bäckström,et al.  Planning in polynomial time: the SAS‐PUBS class , 1991, Comput. Intell..

[28]  Tom Bylander,et al.  The Computational Complexity of Propositional STRIPS Planning , 1994, Artif. Intell..

[29]  Christer Bäckström,et al.  Five years of tractable planning , 1996 .

[30]  Christer Bäckström,et al.  Expressive Equivalence of Planning Formalisms , 1995, Artif. Intell..

[31]  Christer Bäckström,et al.  Planning with Abstraction Hierarchies can be Exponentially Less Efficient , 1995, IJCAI.

[32]  V. S. Subrahmanian,et al.  Complexity, Decidability and Undecidability Results for Domain-Independent Planning , 1995, Artif. Intell..

[33]  Richard Fikes,et al.  STRIPS: A New Approach to the Application of Theorem Proving to Problem Solving , 1971, IJCAI.

[34]  Dana S. Nau,et al.  On the Complexity of Blocks-World Planning , 1992, Artif. Intell..