Lee path replanner for partially-known environments

0Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

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. © 2012 Springer-Verlag.

Cite

CITATION STYLE

APA

Polańczyk, M., Barański, P., Strzelecki, M., & Ślot, K. (2012). Lee path replanner for partially-known environments. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7208 LNAI, pp. 332–342). https://doi.org/10.1007/978-3-642-28942-2_30

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free