Tractable Correct Planning for an Assembly Line
1995 (English)Report (Other academic)
The industry asks for formal, efficient methods for tackling dynamic systems of combinatorial nature, eg. error recovery in industrial processes. As an application example, we have used a minituare assembly line that assembles toy cars---a process that has many similarities with real industrial processes. We have tried to apply one of our provably correct, polynomial-time planning algorithms to plan for this assembly line. Analysing why this did not work provided insight into the inherent structure of the process. This was used as feedback for modifying the theory and extending the previous theoretical results. This resulted in a new provably correct, polynomial-time planner which is sufficient for this application.
Place, publisher, year, edition, pages
Linköping: Linköping University , 1995. , 12 p.
LiTH-ISY-R, ISSN 1400-3902 ; 1746
Automated manufacturing, Assembly planning, Algorithms
Maskinelement Servomekanismer Automation, Driftsorganisation Arbetsformer
IdentifiersURN: urn:nbn:se:liu:diva-55622ISRN: LiTH-ISY-R-1746OAI: oai:DiVA.org:liu-55622DiVA: diva2:316289