Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • 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
Collision detection algorithm in a linear motion: for electrical height adjustable tables
Jönköping University, School of Engineering, JTH, Department of Computer Science and Informatics.
Jönköping University, School of Engineering, JTH, Department of Computer Science and Informatics.
2021 (English)Independent thesis Basic level (degree of Bachelor), 10 credits / 15 HE creditsStudent thesisAlternative title
Algorithm för kollisionsdetektering i en linjär rörelse : för höj- och sänkbara skrivbord (Swedish)
Abstract [en]

The current collision detection system (CDS) that ROL Ergo AB is using for their height adjustable tables can be improved. The manufacturing process of the legs makes today's CDS not accurate enough to detect collisions, because the metal that is used in manufacturing has slight variations between them. This causes frictions across the leg, which leads to current surges and that could trigger a false positives collision.

This study proposes different methods to solve this problem and methods that could be used as a new CDS for a height adjustable table, or any other linear moving object. The proposed methods are: one traditional algorithm with two different thresholds, and two different AIs.  

The two thresholds for the traditional algorithm where one based on a calibration phase that is static, and one based on shifting all values and comparing against itself. The algorithm that used the static threshold could not find light collisions in the middle of the table, but could find all heavy collisions across the table. The algorithm that used the shifted threshold could find all collisions across the table, both light collisions and heavy collisions.  

The second method based on AI was decision tree and random forest. For this binary classification problem, the random forest performed better. Both AI algorithms could find all collisions, however, it had a few false positives that might result in the table stopping when there is not a collision. While both the traditional algorithm and AI manage to find all simulated collisions, more testing is required to determine which of the solutions performs best. 

Place, publisher, year, edition, pages
2021. , p. 44
National Category
Engineering and Technology
Identifiers
URN: urn:nbn:se:hj:diva-54230ISRN: JU-JTH-DTA-1-20210142OAI: oai:DiVA.org:hj-54230DiVA, id: diva2:1584989
External cooperation
ROL Ergo
Subject / course
JTH, Computer Engineering
Supervisors
Examiners
Available from: 2021-08-19 Created: 2021-08-15 Last updated: 2025-10-13Bibliographically approved

Open Access in DiVA

fulltext(1722 kB)478 downloads
File information
File name FULLTEXT01.pdfFile size 1722 kBChecksum SHA-512
e74c4204a04b360470833236a8660ebc4830cc531e3ada630c2f2c6d0661c5316a0221b7f490a406d1cf2b44fef71f0bc037e52c7ef659ac9af8b97edf7c16f9
Type fulltextMimetype application/pdf

Search in DiVA

By author/editor
Nissan, RamsenÅhnström, Jimmi
By organisation
JTH, Department of Computer Science and Informatics
Engineering and Technology

Search outside of DiVA

GoogleGoogle Scholar
Total: 480 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: 739 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • 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