10 research outputs found

    Sleepiness and stress among long-haul truck drivers : An educational intervention to promote safe and economic truck driving

    Get PDF
    Sleepiness and stress at the wheel are known to be common among professional drivers. Given the safety-sensitive nature of the job, it would be essential for neither of these conditions to reach levels compromising safe driving. The current field study examined the levels of sleepiness and stress at the wheel in a group of Finnish long-haul truck drivers, and the potential factors contributing to the sub-optimal levels of arousal. Over and above, the study examined whether driver alertness could be amended by short one-time alertness management training. The results revealed that driver sleepiness reaches potentially risky levels, especially during the first night shift in the beginning of a shift spell. No clear evidence was found to support the idea that educating professional drivers on alertness management would be sufficient for mitigating their sleepiness on the road

    Design Considerations of Dedicated and Aerial 5G Networks for Enhanced Positioning Services

    Get PDF
    Dedicated and aerial fifth generation (5G) networks, here called 5G overlay networks, are envisaged to enhance existing positioning services, when combined with global navigation satellite systems (GNSS) and other sensors. There is a need for accurate and timely positioning in safety-critical automotive and aerial applications, such as advanced warning systems or in urban air mobility (UAM). Today, these high-accuracy demands can partially be satisfied by GNSS, though not in dense urban conditions or under GNSS threats (e.g. interference, jamming or spoofing). Temporary and on-demand 5G network deployments using ground and flying base stations (BSs) are indeed a novel solution to exploit hybrid GNSS, 5G and sensor algorithms for the provision of accurate three-dimensional (3D) position and motion information, especially for challenging urban and suburban scenarios. Thus, this paper first analyzes the positioning technologies available, including signals, positioning methods, algorithms and architectures. Then, design considerations of 5G overlay networks are discussed, by including simulation results on the 5G signal bandwidth, antenna array and network deployment.Peer reviewe

    MAT-45806 Mathematics for positioning & MAT-45807 Mathematics for positioning

    Get PDF
    Positioning techniques and algorithms have been studied for some years at the Tampere University of Technology within several research groups. The objective of this course hand-out has been to collect together the most important algorithms and mathematical tools used in positioning including examples and starting from the basics. We do not go into details of specialized techniques and equipment, but after this course student should be able to solve application dependent problems without having to “re-invent the wheel” again and again. This hand-out and course provide a strong basis for the course TKT-2546 Methods for Positioning. During the previous years courses MAT-45806 Mathematics for Positioning and TKT- 2546 Methods for Positioning had a common hand-out. For practical reasons, the earlier hand-out has been divided into two parts so that both courses now have their own hand-out. Still the courses in question are tightly connected and it is strongly recommended to take both courses the same school year. Prerequisites are first-year engineering mathematics and basics of probability. Additionally, the course TKT-2536 Introduction to Satellite Positioning is a useful but not compulsory prerequi- site. There is no official course text book in addition to this hand-out, mostly because the authors have not managed to find a single book to cover all the material on the level of abstraction we need. The arsenal of positioning computation methods is collected from different areas of mathematics and engineering sciences, and there are often discipline and interpretation differences between them, so we have tried to use common notations and represent connections between different ways of thinking as best as we could. The homepage of the course is http://math.tut.fi/courses/MAT-45806/ which contains additional information about the course and if necessary errata of this hand-out. The authors would like to thank Sami Tiainen for the initial translation of the manuscript, and professor Robert Piché, Helena Leppäkoski, Henri Pesonen, Hanna Sairo, Martti Kirkko-Jaakkola and others who have contributed to the hand-out. The sections excluded from this year’s implementation have been marked with an asterisk (*)

    Gaussian mixture filters in hybrid positioning

    No full text
    ABSTRACT This paper presents, develops and compares Gaussian Mixture Filter (GMF) methods for hybrid positioning. The key idea of the developed method is to approximate the prior density as a Gaussian mixture with a small number of mixture components. We show why it is sometimes reasonable to approximate a Gaussian prior with a multicomponent Gaussian mixture. We also present both simulated and real data tests of different filters in different scenarios. Simulations show that GMF gives better accuracy than Extended Kalman Filter with lower computational requirements than Particle Filter, making it a reasonable algorithm for the hybrid positioning problem

    Moving Grid Filter in Hybrid Local Positioning

    No full text
    A novel moving grid filter, a generalization of the point-mass filter, is given for the hybrid local positioning problem. Preliminary test results are given to show that the algorithm is computationally feasible, and produces accuracy of the same order as the grid separation.

    MAT-45806 Mathematics for positioning & MAT-45807 Mathematics for positioning

    Get PDF
    Positioning techniques and algorithms have been studied for some years at the Tampere University of Technology within several research groups. The objective of this course hand-out has been to collect together the most important algorithms and mathematical tools used in positioning including examples and starting from the basics. We do not go into details of specialized techniques and equipment, but after this course student should be able to solve application dependent problems without having to “re-invent the wheel” again and again. This hand-out and course provide a strong basis for the course TKT-2546 Methods for Positioning. During the previous years courses MAT-45806 Mathematics for Positioning and TKT- 2546 Methods for Positioning had a common hand-out. For practical reasons, the earlier hand-out has been divided into two parts so that both courses now have their own hand-out. Still the courses in question are tightly connected and it is strongly recommended to take both courses the same school year. Prerequisites are first-year engineering mathematics and basics of probability. Additionally, the course TKT-2536 Introduction to Satellite Positioning is a useful but not compulsory prerequi- site. There is no official course text book in addition to this hand-out, mostly because the authors have not managed to find a single book to cover all the material on the level of abstraction we need. The arsenal of positioning computation methods is collected from different areas of mathematics and engineering sciences, and there are often discipline and interpretation differences between them, so we have tried to use common notations and represent connections between different ways of thinking as best as we could. The homepage of the course is http://math.tut.fi/courses/MAT-45806/ which contains additional information about the course and if necessary errata of this hand-out. The authors would like to thank Sami Tiainen for the initial translation of the manuscript, and professor Robert Piché, Helena Leppäkoski, Henri Pesonen, Hanna Sairo, Martti Kirkko-Jaakkola and others who have contributed to the hand-out. The sections excluded from this year’s implementation have been marked with an asterisk (*)

    MAT-45800 Paikannuksen matematiikka 2010

    No full text
    Paikannustekniikoita ja niihin liittyviä algoritmeja on tutkittu Tampereen teknillisellä yliopistolla usean laitoksen ja tutkimusryhmän voimin jo vuosikymmenen ajan. Tähän kurssin MAT- 45800 Paikannuksen matematiikka monisteeseen on kerätty paikannuksessa tarvittavia algoritmeja ja matemaattisia työkaluja esimerkkien kera. Eri tekniikoiden ja laitteistojen yksityiskohtiin ei mennä, vaan kurssin jälkeen opiskelijan pitäisi pystyä ratkomaan sovelluskohtaisia ongelmia tarvitsematta montaakaan kertaa keksiä pyörää uudelleen. Tämä moniste ja kurssi antavat vahvan pohjan kurssille TKT-2540 Paikannuksen menetelmät, jonka kanssa aikaisempina vuosina on ollut yhteinen moniste. Käytännön syiden vuoksi aikai- sempi moniste on nyt jaettu kahteen osaan siten, että molemmilla kursseilla on oma moniste. Silti ko. kurssit liittyvät tiiviisti toisiinsa ja on erittäin suositeltavaa suorittaa molemmat kurssit samana lukuvuonna. Esitietoina tälle kurssille oletetaan Insinöörimatematiikan tai Laajan matematiikan kokonaisuus sekä perustiedot todennäköisyyslaskennasta. Lisäksi kurssi TKT-2530 Satellittipaikannuksen perusteet on hyödyllinen, muttei suinkaan pakollinen esitieto. ”Virallista” kurssikirjaa ei tämän monisteen lisäksi ole. Kurssi on hyvin tiivis suhteessa asiasisältöön, ja käsittelemiämme asioita sivutaan lukuisissa lähteissä, joista olemme pyrkineet viittaamaan lähinnä verkosta tai TTY:n kirjastosta löytyviin teoksiin. Käytännön paikannuslaskuissa tarvittava menetelmäpankki on koottu eri matematiikan ja insinööritieteiden aloilta. Niiden välillä on usein koulukunta- ja tulkintaeroja, joten olemme parhaamme mukaan koettaneet käyttää yhtenäisehköjä merkintöjä ja esittää yhteyksiä eri ajattelutapojen välillä. Kurssin kotisivuille http://math.tut.fi/courses/MAT-45800/ tulee (toivottavasti erittäin lyhyt) lista monisteesta löytyneistä virheistä. Kiitokset prof. Robert Pichélle, Helena Leppäkoskelle, Henri Pesoselle, Hanna Sairolle, Martti Kirkko-Jaakkolalle ja muille tähän tai edellisiin versioihin myötävaikuttaneille. Luvut, joita ei vuoden 2010 toteutuskerralla käsitellä, on merkitty tähdellä (*)
    corecore