arrow
Return

Door-Density-Aware Path Planning

delete2024-01-01
delete0
delete
OA
AI
C
C. S. Vikram
M
M. K. Dojitha M. Mirihagalla
M
Matthew S. K. Yeo
Z
Zimou Zeng
C
Charan Satya Chandra Sairam Borusu
M
M. A. Viraj J. Muthugala *
M
Mohan Rajesh Elara
DOI:10.1109/ACCESS.2024.3463876delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
Doors are part of the building infrastructure that mobile robots have to pass through to reach zones on the other side. If robots were to clear these obstacles, they would require human assistance, advanced end-effectors, and complex control systems, making it challenging for robots. Therefore, a robot deployed in an environment should be capable of minimizing the passing through doors as well as path distance to improve overall efficiency. This paper proposes a novel Door-Density-Aware (DDA) path planning method. A vision-based door-detecting framework based on YOLOv8 has been developed to tag the door locations in a robot's navigation map. The proposed DDA path planner uses a door-tagged map to plan an efficient path considering the cost of moving through doors and the path distance. Genetic Algorithm (GA) and Gray Wolf Optimization (GWO) have been considered for solving this optimization problem. According to the experimental results, the proposed method can effectively detect and tag doors in the navigation map and plan efficient paths. In summary, the proposed DDA path planner with GA outperformed other approaches, achieving cost reductions of 66%, 34%, 49%, and 60% compared to random selection, DDA with GWO, GA minimizing only distance, and GWO minimizing only distance, respectively.
Keywords:
Robot sensing systems
Robot kinematics
Navigation
Path planning
Optimization
Genetic algorithms
Computer vision
Door density
path planning
optimization
vision-based detection

Journal

IEEE Access cover
IEEE Access
IF:
3.6
Papers:
9.8W
Citations:
29.4W

Organization

S
singapore university of technology & design
Scholars:
2.8K
Papers: 3.6K
Citations: 5