D-Star Algorithm Modification
DOI:
https://doi.org/10.3991/ijoe.v16i08.14243Keywords:
D-Star algorithm, navigation problem, obstacle avoidance.Abstract
One of the most effective methods for solving a navigation problem is the method of constructing a navigation system based on the simultaneous localization and mapping algorithm and obstacle avoidance algorithms. One of the most effective obstacles avoidance algorithms is the D-star algorithm [1, 2, 3], which, despite its effectiveness, has some drawbacks. This modification allows to eliminate some problems arising during the implementation of the navigation system.
Downloads
Published
How to Cite
Issue
Section
License
The submitting author warrants that the submission is original and that she/he is the author of the submission together with the named co-authors; to the extend the submission incorporates text passages, figures, data or other material from the work of others, the submitting author has obtained any necessary permission.
Articles in this journal are published under the Creative Commons Attribution Licence (CC-BY What does this mean?). This is to get more legal certainty about what readers can do with published articles, and thus a wider dissemination and archiving, which in turn makes publishing with this journal more valuable for you, the authors.
By submitting an article the author grants to this journal the non-exclusive right to publish it. The author retains the copyright and the publishing rights for his article without any restrictions.