Close category search window
 

A nonlinear programming method for 3D localization of mobile robots

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Li-Chun Lai ; Graduate Sch. of Eng. Sci. & Technol., National Yunlin Univ. of Sci. & Technol. ; Tsong-Li Lee ; Han-Tai Fan ; Chia-Ju Wu

This paper presents a system, which is composed of a laser range finder and four artificial reflectors, for the three-dimensional (3D) localization of a mobile robot. In this system, it will be proved that the position and the heading angle of a mobile robot in a 3D space with respect to a reference frame can be determined provided that the four artificial reflectors are not installed in the same plane. Since the artificial reflectors cannot be treated as points in practice, the proposed localization procedure will be formulated as a nonlinear programming problem to account for the actual sizes of the artificial reflectors. To show the feasibility of the proposed method, experiments will be given for illustration

Published in:
Advanced Robotics, 2005. ICAR '05. Proceedings., 12th International Conference on

Date of Conference: 18-20 July 2005

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.