Motion Planning Using Voronoi Diagrams

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26210%2F03%3APU40464" target="_blank" >RIV/00216305:26210/03:PU40464 - isvavai.cz</a>

Result on the web

—

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

Motion Planning Using Voronoi Diagrams

Original language description

A Voronoi diagram of a set of sites in the Euclidean plane is a collection of regions that divide up the plane. Each region corresponds to one of the sites and all the points in one region are closer to the site representing the region than to any othersite. Voronoi diagrams have a surprising variety of uses, e.g. nearest neighbour search, facility location, path planning, etc. In this paper, we investigate the problem of point-to-point eightdirectional motion planning in the 2D space containing pointand rectangular obstacles. and propose a method for solving this problem using rectilinear Voronoi diagrams.

Czech name

—

Czech description

—

Type

D - Article in proceedings

CEP classification

JD - Use of computers, robotics and its application

OECD FORD branch

—

Project

—

Continuities

Z - Vyzkumny zamer (s odkazem do CEZ)

Publication year

2003

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection

Proceedings of the 4th International Carpathian Control Conference ICCC '20003

ISBN

80-7099-509-2

ISSN

—

e-ISSN

—

Number of pages

632

Pages from-to

629-1260

Publisher name

TU Košice

Place of publication

Tatranská Lomnica (Slovakia)

Event location

Tatranská Lomnice

Event date

May 26, 2003

Type of event by nationality

EUR - Evropská akce

UT code for WoS article

—