2018 IEEE International Conference on Systems, Man, and Cybernetics (SMC) 2018
DOI: 10.1109/smc.2018.00696
|View full text |Cite
|
Sign up to set email alerts
|

Indoor Navigation with Human Assistance for Service Robots Using D*Lite

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
3

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(2 citation statements)
references
References 9 publications
0
2
0
Order By: Relevance
“…D * Lite algorithm is an improved version of the D * algorithm, which combines the advantages of the D * algorithm and the LPA * algorithm. Unlike the forward search used by LPA * , D * Lite uses the reverse search (the target point is fixed and the starting point changes with time) [33], which makes the path planning easier and faster. Due to the dynamic characteristics of the underwater environment and the uncertainty and incompleteness of environmental information, it is necessary to replan the path in time when the AUV encounters unknown static or dynamic obstacles.…”
Section: 22mentioning
confidence: 99%
“…D * Lite algorithm is an improved version of the D * algorithm, which combines the advantages of the D * algorithm and the LPA * algorithm. Unlike the forward search used by LPA * , D * Lite uses the reverse search (the target point is fixed and the starting point changes with time) [33], which makes the path planning easier and faster. Due to the dynamic characteristics of the underwater environment and the uncertainty and incompleteness of environmental information, it is necessary to replan the path in time when the AUV encounters unknown static or dynamic obstacles.…”
Section: 22mentioning
confidence: 99%
“…The presence or absence of the ability to walk along the edges in both directions distinguishes between a directed graph and an undirected graph. There are several different algorithms designed to solve the issue of the shortest path, including but not limited to Dijkstra's algorithm (P. , the Bellman-Ford algorithm (Parimala et al, 2021), the A* algorithm (Rachmawati & Gustin, 2020), the D* algorithm (Alves et al, 2019), and the Floyd-Warshall algorithm (Ramadiani et al, 2018).…”
Section: Introductionmentioning
confidence: 99%