Detail publikace

Computing Paths Using Computational Geometry Data Structures

ŠEDA, M.

Originální název

Computing Paths Using Computational Geometry Data Structures

Typ

článek ve sborníku ve WoS nebo Scopus

Jazyk

angličtina

Originální abstrakt

Finding the shortest path from a specified starting position to a target position is a fundamental problem in transportation, routing, and communications applications. In robot motion planning, the robot should pass around the obstacles touching none of them, i.e. the goal is to find a collision-free path from the starting to the target position. This task has many specific formulations depending on the shape of obstacles, allowable directions of movements, knowledge of the scene, etc. Research on of path planning has yielded many fundamentally different approaches to its solution, mainly based on various decomposition and roadmap methods. In this paper, we investigate a possible use of visibility graphs and Voronoi diagrams in point-to-point motion planning and propose a method for solving this problem on in the Euclidean plane.

Klíčová slova v angličtině

planning, computational geometry, visibility graph, Voronoi diagram

Autoři

ŠEDA, M.

Rok RIV

2005

Vydáno

26. 9. 2005

Nakladatel

Bachcesehir University Istanbul

Místo

Antalya (Turkey)

ISBN

9958-617-28-5

Kniha

Proceedings of the 9th International Research/Expert Conference Trends in the Development of Machinery and Associated Technology TMT 2005

Strany od

685

Strany do

688

Strany počet

4

BibTex

@inproceedings{BUT15917,
  author="Miloš {Šeda}",
  title="Computing Paths Using Computational Geometry Data Structures",
  booktitle="Proceedings of the 9th International Research/Expert Conference Trends in the Development of Machinery and Associated Technology TMT 2005",
  year="2005",
  pages="4",
  publisher="Bachcesehir University Istanbul",
  address="Antalya (Turkey)",
  isbn="9958-617-28-5"
}