Lee path replanner for partially-known environments

  • Authors:
  • Maciej Polańczyk;Przemysław Barański;Michał Strzelecki;Krzysztof Ślot

  • Affiliations:
  • Institute of Electronics, Technical University of Lodz, Lodz, Poland;Institute of Electronics, Technical University of Lodz, Lodz, Poland;Institute of Electronics, Technical University of Lodz, Lodz, Poland;Institute of Electronics, Technical University of Lodz, Lodz, Poland

  • Venue:
  • HAIS'12 Proceedings of the 7th international conference on Hybrid Artificial Intelligent Systems - Volume Part I
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper presents a new routing algorithm based on Lee's algorithm. The latter was developed with view to designing printed circuit boards (PCB). It can also be adapted for seeking collisionless routes for unmanned vehicles moving in an unknown environment. Such routes need to be updated on-the-fly, taking into account changes in the environment, e.g. moving obstacles, newly detected objects. The proposed algorithm uses results from the calculations carried out in the previous steps. Hence, computations in the following steps are only required for the areas that were subject to change. Tests showed that the presented route replanner is, on average, twice as fast as Lee's algorithm.