Online complete coverage path planning using two-way proximity search

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

Research output: Contribution to journalArticle

10 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 languageEnglish
Pages (from-to)1-12
Number of pages12
JournalIntelligent Service Robotics
DOIs
Publication statusAccepted/In press - 2017 Mar 16

Fingerprint

Motion planning
Mobile robots
Data storage equipment

Keywords

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

ASJC Scopus subject areas

  • Computational Mechanics
  • Engineering (miscellaneous)
  • Mechanical Engineering
  • Artificial Intelligence

Cite this

Online complete coverage path planning using two-way proximity search. / Khan, Amna; Noreen, Iram; Ryu, Hyejeong; Doh, Nakju; Habib, Zulfiqar.

In: Intelligent Service Robotics, 16.03.2017, p. 1-12.

Research output: Contribution to journalArticle

Khan, Amna ; Noreen, Iram ; Ryu, Hyejeong ; Doh, Nakju ; Habib, Zulfiqar. / Online complete coverage path planning using two-way proximity search. In: Intelligent Service Robotics. 2017 ; pp. 1-12.
@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 Nakju Doh and Zulfiqar Habib",
year = "2017",
month = "3",
day = "16",
doi = "10.1007/s11370-017-0223-z",
language = "English",
pages = "1--12",
journal = "Intelligent Service Robotics",
issn = "1861-2776",
publisher = "Springer Verlag",

}

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

AU - Habib, Zulfiqar

PY - 2017/3/16

Y1 - 2017/3/16

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

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

U2 - 10.1007/s11370-017-0223-z

DO - 10.1007/s11370-017-0223-z

M3 - Article

AN - SCOPUS:85015710407

SP - 1

EP - 12

JO - Intelligent Service Robotics

JF - Intelligent Service Robotics

SN - 1861-2776

ER -