Detail publikace
Computing the Euclidean Shortest Path in the Plane with Polygonal Obstacles
ŠEDA, M.
Anglický název
Computing the Euclidean Shortest Path in the Plane with Polygonal Obstacles
Typ
článek ve sborníku ve WoS nebo Scopus
Jazyk
en
Originální abstrakt
In this paper, the problem of finding the shortest path in the Euclidean plane with polygonal obstacles is considered. It has many industrial applications where point-to-point motion is needed. An approach to its solution based on a visibility graph is presented
Anglický abstrakt
In this paper, the problem of finding the shortest path in the Euclidean plane with polygonal obstacles is considered. It has many industrial applications where point-to-point motion is needed. An approach to its solution based on a visibility graph is presented
Klíčová slova anglicky
computational geometry, motion planning, visibility graph
Rok RIV
2002
Vydáno
01.06.2002
Nakladatel
VUT FSI
Místo
Brno
ISBN
80-214-2135-5
Kniha
Proceedings of the 8th International Conference on Soft Computing MENDEL 2002
Počet stran
4
BIBTEX
@inproceedings{BUT10547,
author="Miloš {Šeda},
title="Computing the Euclidean Shortest Path in the Plane with Polygonal Obstacles",
booktitle="Proceedings of the 8th International Conference on Soft Computing MENDEL 2002",
year="2002",
month="June",
publisher="VUT FSI",
address="Brno",
isbn="80-214-2135-5"
}