Skip to main navigation Skip to search Skip to main content

Path Optimization for D-Star Algorithm Modification

  • Beirut Arab University
  • St. Petersburg State University

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

9 Scopus citations

Abstract

The main task of mobile robots is to follow the route quickly and without damage. For this reason, it is important to solve the problem of navigation for mobile robots. There are some methods. One of the most effective is the method of constructing a navigation system based on the simultaneous localization and mapping algorithm and obstacle avoidance algorithms. The D-star algorithm of ten used for obstacles avoidance, but despite its effectiveness, it has some drawbacks. Previously a modification was described that allows to eliminate some problems arising during the implementation of the navigation system. In this article we presented the optimization of the path for that modification which allows to avoid wasting time on stopping and turning in the right direction.

Original languageEnglish
Title of host publicationInternational Conference on Numerical Analysis and Applied Mathematics, ICNAAM 2020
EditorsT.E. Simos, T.E. Simos, T.E. Simos, T.E. Simos, Ch. Tsitouras
PublisherAmerican Institute of Physics Inc.
ISBN (Electronic)9780735441828
DOIs
StatePublished - 6 Apr 2022
Externally publishedYes
EventInternational Conference on Numerical Analysis and Applied Mathematics 2020, ICNAAM 2020 - Rhodes, Greece
Duration: 17 Sep 202023 Sep 2020

Publication series

NameAIP Conference Proceedings
Volume2425
ISSN (Print)0094-243X
ISSN (Electronic)1551-7616

Conference

ConferenceInternational Conference on Numerical Analysis and Applied Mathematics 2020, ICNAAM 2020
Country/TerritoryGreece
CityRhodes
Period17/09/2023/09/20

Fingerprint

Dive into the research topics of 'Path Optimization for D-Star Algorithm Modification'. Together they form a unique fingerprint.

Cite this