Repository logo
  • English
  • Català
  • Čeština
  • Deutsch
  • Español
  • Français
  • Gàidhlig
  • Italiano
  • Latviešu
  • Magyar
  • Nederlands
  • Polski
  • Português
  • Português do Brasil
  • Suomi
  • Svenska
  • Türkçe
  • Tiếng Việt
  • Қазақ
  • বাংলা
  • हिंदी
  • Ελληνικά
  • Yкраї́нська
  • Log In
    New user? Click here to register.Have you forgotten your password?
Repository logo
  • Communities & Collections
  • All of DSpace
  • English
  • Català
  • Čeština
  • Deutsch
  • Español
  • Français
  • Gàidhlig
  • Italiano
  • Latviešu
  • Magyar
  • Nederlands
  • Polski
  • Português
  • Português do Brasil
  • Suomi
  • Svenska
  • Türkçe
  • Tiếng Việt
  • Қазақ
  • বাংলা
  • हिंदी
  • Ελληνικά
  • Yкраї́нська
  • Log In
    New user? Click here to register.Have you forgotten your password?
  1. Home
  2. Browse by Author

Browsing by Author "Lachouri Abderazzak"

Now showing 1 - 1 of 1
Results Per Page
Sort Options
  • Loading...
    Thumbnail Image
    Item
    FDA*: A FOCUSED SINGLE‐QUERY GRID BASED PATH PLANNING ALGORITHM
    (Journal of Automation, Mobile Robotics and Intelligent Systems, 2022-02-09) Boumediene Mouad; Mehennaoui Lamine; Lachouri Abderazzak
    Square grid representations of the state‐space are a com‐ monly used tool in path planning. With applications in a variety of disciplines, including robotics, computatio‐ nal biology, game development, and beyond. However, in large‐scale and/or high dimensional environments the creation and manipulation of such structures become too expensive, especially in applications when an accurate re‐ presentation is needed. In this paper, we present a method for reducing the cost of single‐query grid‐based path planning, by focu‐ sing the search to a smaller subset, that contains the optimal solution. This subset is represented by a hyper‐ rectangle, the location, and dimensions of which are cal‐ culated departing from an initial feasible path found by a fast search using the RRT* algorithm. We also present an implementation of this focused discretization method cal‐ led FDA*, a resolution optimal algorithm, where the A* algorithm is employed in searching the resulting graph for an optimal solution. We also demonstrate through si‐ mulation results, that the FDA* algorithm uses less me‐ mory and has a shorter run‐time compared to the classic A* and thus other graph‐based planning algorithms, and at the same time, the resulting path cost is less than that of regular RRT based algorithms.

DSpace software copyright © 2002-2025 LYRASIS

  • Cookie settings
  • Privacy policy
  • End User Agreement
  • Send Feedback