Cart (Loading....) | Create Account
Close category search window

Staying-alive and energy-efficient path planning for 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

6 Author(s)
Tianmiao Wang ; Robot Res. Inst., Beihang Univ., Beijing ; Bin Wang ; Hongxing Wei ; Cao, Y.
more authors

As most mobile robots are powered by batteries, their energy and operation times are limited. Therefore, how to minimize energy consumption and keep mobile robots to stay alive becomes an important problem. In this paper, by applying a dynamic energy-evaluation scheme, in which we consider if a robot has enough energy to go to next location, finish the task and return to the docking station in the path planning, we propose two staying-alive and energy-efficient path planning approaches based on the greedy TSP and Tabu-search methods, respectively. The experimental results show that our Tabu-search-based approach is the best and can provide an effective path planning by which a robot can be guaranteed to stay alive and finish all tasks with the minimum energy.

Published in:

American Control Conference, 2008

Date of Conference:

11-13 June 2008

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 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.