liu.seSearch for publications in DiVA
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Tractable Planning for an Assembly Line
Linköping University, Department of Electrical Engineering, Automatic Control. Linköping University, The Institute of Technology.
Linköping University, Department of Computer and Information Science, TCSLAB - Theoretical Computer Science Laboratory. Linköping University, The Institute of Technology.
Linköping University, Department of Computer and Information Science, TCSLAB - Theoretical Computer Science Laboratory. Linköping University, The Institute of Technology.
1995 (English)Report (Other academic)
Abstract [en]

The industry wants formal methods for dealing with combinatorial dynamical systems that are provably correct and fast. One example of such problems is error recovery in industrial processes. We have used a provably correct, polynomial-time planning algorithm to plan for a miniature assembly line, which assembles toy cars. Although somewhat limited, this process has many similarities with real industrial processes. By exploring the structure of this assembly line we have extended apreviously presented algorithm making the class of problems that can be handled in polynomial time larger.

Place, publisher, year, edition, pages
Linköping: Linköping University , 1995. , 12 p.
Series
LiTH-ISY-R, ISSN 1400-3902 ; 1792
National Category
Control Engineering
Identifiers
URN: urn:nbn:se:liu:diva-55283ISRN: LITH-ISY-I-1792OAI: oai:DiVA.org:liu-55283DiVA: diva2:315841
Available from: 2010-04-29 Created: 2010-04-29 Last updated: 2017-02-23Bibliographically approved

Open Access in DiVA

fulltext(224 kB)58 downloads
File information
File name FULLTEXT02.pdfFile size 224 kBChecksum SHA-512
a39dd992f921857b6bbdc2e688307be34a05aae956dec51e554353c05e72357cbea20fbc201735711bec1bb652fbc9e81abdabf3f1f1934e28d0ab719caf0797
Type fulltextMimetype application/pdf
fulltext(423 kB)66 downloads
File information
File name FULLTEXT01.psFile size 423 kBChecksum SHA-512
b7c94c73799fa2728b6fb81a01ff81f7deb1f5a82dc5e58e4374917c3524f93e57feed13ef0f779c8158ef53b12e0d4d6ba92d2b4524b2c2ea0e8a02e6593267
Type fulltextMimetype application/postscript

Authority records BETA

Klein, IngerJonsson, PeterBäckström, Christer

Search in DiVA

By author/editor
Klein, IngerJonsson, PeterBäckström, Christer
By organisation
Automatic ControlThe Institute of TechnologyTCSLAB - Theoretical Computer Science Laboratory
Control Engineering

Search outside of DiVA

GoogleGoogle Scholar
Total: 124 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

urn-nbn

Altmetric score

urn-nbn
Total: 81 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf