2015 Fifth National Conference on Computer Vision, Pattern Recognition, Image Processing and Graphics (NCVPRIPG) 2015
DOI: 10.1109/ncvpripg.2015.7490000
|View full text |Cite
|
Sign up to set email alerts
|

A novel floor segmentation algorithm for mobile robot navigation

Abstract: The task of detection of floor area for mobile robot navigation has received immense importance over the years. The main challenging problem as long as the path planning of robots is concerned, is the obstacle avoidance. Obstacle detection and avoidance in real time is a complex and computationally expensive process as a result of which the robotics researchers opted to segment out floors, which is comparatively easier process and at the same time very much feasible in real time applications. The proposed floo… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2017
2017
2022
2022

Publication Types

Select...
4
3

Relationship

0
7

Authors

Journals

citations
Cited by 7 publications
(2 citation statements)
references
References 17 publications
0
2
0
Order By: Relevance
“…Procedure data collection. BFS is a common path planning algorithm for navigation [77,78,79,80], which we use to generate expert trajectories for training an imitation learning agent. To compute the optimal action at each time step, BFS keeps track of a visited 2D array (colored cells in Figure 3) that marks whether each position (1) has been visited by the search, (2) if so, which action visited it, and (3) has a position been backtracked.…”
Section: Proof Of Concept: Synthetic Maze Navigationmentioning
confidence: 99%
“…Procedure data collection. BFS is a common path planning algorithm for navigation [77,78,79,80], which we use to generate expert trajectories for training an imitation learning agent. To compute the optimal action at each time step, BFS keeps track of a visited 2D array (colored cells in Figure 3) that marks whether each position (1) has been visited by the search, (2) if so, which action visited it, and (3) has a position been backtracked.…”
Section: Proof Of Concept: Synthetic Maze Navigationmentioning
confidence: 99%
“…However, since pixel-based evaluation and edge filters were emphasized in the study, objects that were very similar to the floor, such as the wall could be indistinguishable. Bhowmick et al [18] relied on floor detection using a conventional breadth-first search-based region-growing technique to detect obstacles. However, they stated that the process was slow because of the many conditions in the study.…”
Section: Literature Reviewmentioning
confidence: 99%