Online complete coverage path planning using two-way proximity search

Amna Khan; Iram Noreen; Hyejeong Ryu; Nakju Lett Doh; Zulfiqar Habib

doi:10.1007/s11370-017-0223-z

Online complete coverage path planning using two-way proximity search

Amna Khan, Iram Noreen, Hyejeong Ryu, Nakju Lett Doh, Zulfiqar Habib

Department of Life Sciences

Research output: Contribution to journal › Article › peer-review

19 Citations (Scopus)

Abstract

This paper presents an efficient online approach for complete coverage path planning of mobile robots in an unknown workspace based on online boustrophedon motion and an optimized backtracking mechanism. The presented approach first performs a single continuous boustrophedon motion until a critical point is reached. In order to completely cover the environment, next starting point is decided by using the accumulated knowledge of the environment map. An efficient backtracking technique based on proposed Two-way Proximity Search algorithm is used to plan a path from the critical point to the new starting point. Simulation results show the efficiency of proposed backtracking approach with improved total coverage time, coverage path length and memory requirements.

Original language	English
Pages (from-to)	229-240
Number of pages	12
Journal	Intelligent Service Robotics
Volume	10
Issue number	3
DOIs	https://doi.org/10.1007/s11370-017-0223-z
Publication status	Published - 2017 Jul 1

Keywords

Boustrophedon motions
Complete coverage path
Mobile robots
Two-way proximity search

ASJC Scopus subject areas

Computational Mechanics
Engineering (miscellaneous)
Mechanical Engineering
Artificial Intelligence

Access to Document

10.1007/s11370-017-0223-z

Cite this

@article{a24fc628b026498e8a9cd4c07490ac75,

title = "Online complete coverage path planning using two-way proximity search",

abstract = "This paper presents an efficient online approach for complete coverage path planning of mobile robots in an unknown workspace based on online boustrophedon motion and an optimized backtracking mechanism. The presented approach first performs a single continuous boustrophedon motion until a critical point is reached. In order to completely cover the environment, next starting point is decided by using the accumulated knowledge of the environment map. An efficient backtracking technique based on proposed Two-way Proximity Search algorithm is used to plan a path from the critical point to the new starting point. Simulation results show the efficiency of proposed backtracking approach with improved total coverage time, coverage path length and memory requirements.",

keywords = "Boustrophedon motions, Complete coverage path, Mobile robots, Two-way proximity search",

author = "Amna Khan and Iram Noreen and Hyejeong Ryu and Doh, {Nakju Lett} and Zulfiqar Habib",

note = "Funding Information: This study is supported by the research grant of Higher Education Commission (HEC) of Pakistan (No. 20-2359/NRPU/R&D/HEC/12-6779) and partly supported by a project of Korean government (No. 10073166). Publisher Copyright: {\textcopyright} 2017, Springer-Verlag Berlin Heidelberg.",

year = "2017",

month = jul,

day = "1",

doi = "10.1007/s11370-017-0223-z",

language = "English",

volume = "10",

pages = "229--240",

journal = "Intelligent Service Robotics",

issn = "1861-2776",

publisher = "Springer Verlag",

number = "3",

}

TY - JOUR

T1 - Online complete coverage path planning using two-way proximity search

AU - Khan, Amna

AU - Noreen, Iram

AU - Ryu, Hyejeong

AU - Doh, Nakju Lett

AU - Habib, Zulfiqar

N1 - Funding Information: This study is supported by the research grant of Higher Education Commission (HEC) of Pakistan (No. 20-2359/NRPU/R&D/HEC/12-6779) and partly supported by a project of Korean government (No. 10073166). Publisher Copyright: © 2017, Springer-Verlag Berlin Heidelberg.

PY - 2017/7/1

Y1 - 2017/7/1

N2 - This paper presents an efficient online approach for complete coverage path planning of mobile robots in an unknown workspace based on online boustrophedon motion and an optimized backtracking mechanism. The presented approach first performs a single continuous boustrophedon motion until a critical point is reached. In order to completely cover the environment, next starting point is decided by using the accumulated knowledge of the environment map. An efficient backtracking technique based on proposed Two-way Proximity Search algorithm is used to plan a path from the critical point to the new starting point. Simulation results show the efficiency of proposed backtracking approach with improved total coverage time, coverage path length and memory requirements.

AB - This paper presents an efficient online approach for complete coverage path planning of mobile robots in an unknown workspace based on online boustrophedon motion and an optimized backtracking mechanism. The presented approach first performs a single continuous boustrophedon motion until a critical point is reached. In order to completely cover the environment, next starting point is decided by using the accumulated knowledge of the environment map. An efficient backtracking technique based on proposed Two-way Proximity Search algorithm is used to plan a path from the critical point to the new starting point. Simulation results show the efficiency of proposed backtracking approach with improved total coverage time, coverage path length and memory requirements.

KW - Boustrophedon motions

KW - Complete coverage path

KW - Mobile robots

KW - Two-way proximity search

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

U2 - 10.1007/s11370-017-0223-z

DO - 10.1007/s11370-017-0223-z

M3 - Article

AN - SCOPUS:85015710407

VL - 10

SP - 229

EP - 240

JO - Intelligent Service Robotics

JF - Intelligent Service Robotics

SN - 1861-2776

IS - 3

ER -

Online complete coverage path planning using two-way proximity search

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this