2020
DOI: 10.1017/s0263574720000818
|View full text |Cite
|
Sign up to set email alerts
|

One Way to Fill All the Concave Region in Grid-Based Map

Abstract: SUMMARY The search space of the path planning problem can greatly affect the running time and memory consumption, for example, the concave obstacle in grid-based map usually leads to the invalid search space. In this paper, the filling container algorithm is proposed to alleviate the concave area problem in 2D map space, which is inspired from the scenario of pouring water into a cup. With this method, concave areas can be largely excluded by scanning the map repeatedly. And the effectiveness has been prove… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2021
2021
2022
2022

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 25 publications
(29 reference statements)
0
1
0
Order By: Relevance
“…However, dealing with a huge number of cells may exponentially increase traversal time, therefore it will bring performance and scalability problems [17]. Quadtrees [18], PR quadtrees [19], skip quadtrees [20] and concave areas elimination [21] are the current solutions to solve the performance problems.…”
Section: Grid-based Mapmentioning
confidence: 99%
“…However, dealing with a huge number of cells may exponentially increase traversal time, therefore it will bring performance and scalability problems [17]. Quadtrees [18], PR quadtrees [19], skip quadtrees [20] and concave areas elimination [21] are the current solutions to solve the performance problems.…”
Section: Grid-based Mapmentioning
confidence: 99%