Staying-alive and energy-efficient path planning for mobile robots

Tianmiao Wang; Bin Wang; Hongxing Wei; Yunan Cao; Meng Wang; Zili Shao

doi:10.1109/ACC.2008.4586602

Staying-alive and energy-efficient path planning for mobile robots

Tianmiao Wang, Bin Wang, Hongxing Wei, Yunan Cao, Meng Wang, Zili Shao

Research output: Chapter in book / Conference proceeding › Conference article published in proceeding or book › Academic research › peer-review

27 Citations (Scopus)

Abstract

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.

Original language	English
Title of host publication	2008 American Control Conference, ACC
Pages	868-873
Number of pages	6
DOIs	https://doi.org/10.1109/ACC.2008.4586602
Publication status	Published - 30 Sept 2008
Event	2008 American Control Conference, ACC - Seattle, WA, United States Duration: 11 Jun 2008 → 13 Jun 2008

Conference

Conference	2008 American Control Conference, ACC
Country/Territory	United States
City	Seattle, WA
Period	11/06/08 → 13/06/08

ASJC Scopus subject areas

Electrical and Electronic Engineering

UN SDGs

This output contributes to the following UN Sustainable Development Goals (SDGs)

More information

10.1109/ACC.2008.4586602

Cite this

@inproceedings{b5f28f3d57a8450880c2b1f19fdb5dc7,

title = "Staying-alive and energy-efficient path planning for mobile robots",

abstract = "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.",

author = "Tianmiao Wang and Bin Wang and Hongxing Wei and Yunan Cao and Meng Wang and Zili Shao",

year = "2008",

month = sep,

day = "30",

doi = "10.1109/ACC.2008.4586602",

language = "English",

isbn = "9781424420797",

pages = "868--873",

booktitle = "2008 American Control Conference, ACC",

note = "2008 American Control Conference, ACC ; Conference date: 11-06-2008 Through 13-06-2008",

}

TY - GEN

T1 - Staying-alive and energy-efficient path planning for mobile robots

AU - Wang, Tianmiao

AU - Wang, Bin

AU - Wei, Hongxing

AU - Cao, Yunan

AU - Wang, Meng

AU - Shao, Zili

PY - 2008/9/30

Y1 - 2008/9/30

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=52449110085&partnerID=8YFLogxK

U2 - 10.1109/ACC.2008.4586602

DO - 10.1109/ACC.2008.4586602

M3 - Conference article published in proceeding or book

SN - 9781424420797

SP - 868

EP - 873

BT - 2008 American Control Conference, ACC

T2 - 2008 American Control Conference, ACC

Y2 - 11 June 2008 through 13 June 2008

ER -

Staying-alive and energy-efficient path planning for mobile robots

Abstract

Conference

ASJC Scopus subject areas

UN SDGs

More information

Other files and links

Fingerprint

Cite this