Our system is currently under heavy load due to increased usage. We're actively working on upgrades to improve performance. Thank you for your patience.
2015 2nd International Conference on Information Science and Security (ICISS) 2015
DOI: 10.1109/icissec.2015.7371031
|View full text |Cite
|
Sign up to set email alerts
|

Robotic Indoor Path Planning Using Dijkstra's Algorithm with Multi-Layer Dictionaries

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
11
0
1

Year Published

2017
2017
2023
2023

Publication Types

Select...
4
4

Relationship

0
8

Authors

Journals

citations
Cited by 39 publications
(17 citation statements)
references
References 4 publications
0
11
0
1
Order By: Relevance
“…FA is known to work well in solving engineering optimization problems with avoidance of local minima situations. 2,3 To compare the suitability of FA in generating the required turning angle (TA) based on the above mentioned objective function, it has been compared against Dijkstra's algorithm (DA), 48 A* algorithm (AA), 49 particle swarm optimization (PSO) 50 and ant colony optimization (ACO). 51 Table 1 represents a comparison of FA against other metaheuristic approaches in generation of the required TA.…”
Section: Global Fitness Functionmentioning
confidence: 99%
See 1 more Smart Citation
“…FA is known to work well in solving engineering optimization problems with avoidance of local minima situations. 2,3 To compare the suitability of FA in generating the required turning angle (TA) based on the above mentioned objective function, it has been compared against Dijkstra's algorithm (DA), 48 A* algorithm (AA), 49 particle swarm optimization (PSO) 50 and ant colony optimization (ACO). 51 Table 1 represents a comparison of FA against other metaheuristic approaches in generation of the required TA.…”
Section: Global Fitness Functionmentioning
confidence: 99%
“…However, it is simultaneously important to validate the proposed controller against other existing navigational models. To do the same, the proposed FA based approach has been compared against Dijkstra's algorithm, 48 A* algorithm, 49 particle swarm optimization 50 and ant colony optimization. 51 Here, the simulations scenes represented in the current work are considered as graphs and each algorithm has been run separately on the same.…”
Section: Validation Of Fa-hsv Controller Against Other Existing Navigational Modelmentioning
confidence: 99%
“…According to [58], Dijkstra's algorithm is typically used in the indoor environment because it is easy to implement for various environments. Dijkstra's algorithm is a special form of dynamic programming and a breadth-first-search algorithm for finding the shortest paths from a single source vertex to all other vertices [59]. The Fig.…”
Section: Path Planning Using Dijkstra's Algorithmmentioning
confidence: 99%
“…Path planning is one of the key technologies in navigation system, which usually includes the global as well as local planners [ 6 , 7 ]. The global planner searches the global map to obtain a feasible path by means of planning algorithms, such as Dijkstra, A-star (A*), PRM, Rapidly Exploring Random Tree (RRT) algorithms, and so on [ 8 , 9 , 10 , 11 , 12 ]. The Dijkstra is a classic algorithm for finding the shortest path between two points due to its optimal capability for global planning.…”
Section: Introductionmentioning
confidence: 99%