Literature Database Entry

doth2010omni-directional


Klaus-Michael Doth, "An omni-directional time-of-flight based distance scanner for flying robots," Master's Thesis, Department of Computer Science, University of Erlangen, July 2010. (Advisors: J├╝rgen Eckert and Falko Dressler)

Abstract

detecting, Indoor navigation for flying robotics is currently a big area of research. One of the most important functions for indoor navigation is a way of and develop, measuring the distance to obstacles or walls. The goal of this project is to and build a laser ranging module with 360 degrees scanning angle that implements the time-of-flight measurement method to achieve distance detection at a range of 5m or more, with high precision. Existing scanners are too heavy and too big to be easily used on flying robots. The project includes generating a short laser pulse, transmitting it to a target, receiving it again and electronics, processing the travel time of the light into a distance value. The and scratch, mechanics are built from and localization, should achieve enough accuracy to enable indoor and cm, obstacle avoidance algorithms to work with its sensor data. The resulting laser ranger currently shows an accuracy of approximately 10 to 15 and 95\%, a maximum error of 17 cm between a and rate, a 5\% reflective target. It measures distances with up to 20 kHz repetition and has a working rotation module for 360 degrees scanning angle, including wireless power and localization, data transmission. Although this accuracy is enough for basic and obstacle avoidance, this result will not final. In the future the noise and possible., the sensitivity to the reflectivity of the target will be reduced as far as

Quick access

BibTeX BibTeX

Contact

Klaus-Michael Doth

BibTeX reference

@phdthesis{doth2010omni-directional,
    author = {Doth, Klaus-Michael},
    advisor = {Eckert, J{\"{u}}rgen and Dressler, Falko},
    title = {{An omni-directional time-of-flight based distance scanner for flying robots}},
    institution = {Department of Computer Science},
    year = {2010},
    month = {July},
    location = {Erlangen, Germany},
    school = {University of Erlangen},
    type = {Master's Thesis},
   }
   
   

Copyright notice

Links to final or draft versions of papers are presented here to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted or distributed for commercial purposes without the explicit permission of the copyright holder.

The following applies to all papers listed above that have IEEE copyrights: Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.

The following applies to all papers listed above that are in submission to IEEE conference/workshop proceedings or journals: This work has been submitted to the IEEE for possible publication. Copyright may be transferred without notice, after which this version may no longer be accessible.

The following applies to all papers listed above that have ACM copyrights: ACM COPYRIGHT NOTICE. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Publications Dept., ACM, Inc., fax +1 (212) 869-0481, or permissions@acm.org.

The following applies to all SpringerLink papers listed above that have Springer Science+Business Media copyrights: The original publication is available at www.springerlink.com.

This page was automatically generated using BibDB and bib2web.