2017
DOI: 10.18178/ijmerr.6.5.366-372
|View full text |Cite
|
Sign up to set email alerts
|

Optimization Maze Robot Using A* and Flood Fill Algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
2
0
1

Year Published

2019
2019
2023
2023

Publication Types

Select...
4
4

Relationship

0
8

Authors

Journals

citations
Cited by 8 publications
(3 citation statements)
references
References 4 publications
0
2
0
1
Order By: Relevance
“…Discretised potential field variants such as modified CFill and Flood-Field Methods (FFMs) have been shown to have greater time efficiency in comparison to Potential Field Methods (PFMs) [22,23]. FFAs have gained interest in the context of optimal path planning for 2D platforms [24,25], that has demonstrated flexibility through effective integration with optimal motion planners such as the A* algorithm [26]. These concepts have evolved in application to optimal motion planning in 3D space for UAVs with an exhaustive search pattern [27].…”
Section: First Iterationmentioning
confidence: 99%
“…Discretised potential field variants such as modified CFill and Flood-Field Methods (FFMs) have been shown to have greater time efficiency in comparison to Potential Field Methods (PFMs) [22,23]. FFAs have gained interest in the context of optimal path planning for 2D platforms [24,25], that has demonstrated flexibility through effective integration with optimal motion planners such as the A* algorithm [26]. These concepts have evolved in application to optimal motion planning in 3D space for UAVs with an exhaustive search pattern [27].…”
Section: First Iterationmentioning
confidence: 99%
“…Portanto, essas funções deverão estar disponíveis no modelo final do Doogie Mouse. [6], busca em profundidade [8], Flood Fill [9-10] e A* [11]. Ademais, a modularidade do sistema permite que o desenvolvedor implemente outros algoritmos de inteligência.…”
Section: Matriz De Comparaçãounclassified
“…The maze type variation will give insight into how a robot with a particular algorithm interacts with obstruction in the maze. Another algorithm, i.e., flood filling, is similar to our variation in the maze for dead ends and loop [23], [24].…”
Section: Introductionmentioning
confidence: 99%