Geometric Data Structures Approximations for Network Optimisation

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26210%2F09%3APU86334" target="_blank" >RIV/00216305:26210/09:PU86334 - isvavai.cz</a>

Výsledek na webu

—

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

Geometric Data Structures Approximations for Network Optimisation

Popis výsledku v původním jazyce

A frequent task in transportation, routing, robotics, and communications applications is to find the shortest path between two positions. In robot motion planning, the robot should pass around the obstacles touching none of them, i.e. the goal is to finda collision-free path from a starting to a target position. Research of path planning has yielded many fundamentally different approaches to its solution, mainly based on various decomposition and roadmap methods. In this paper, we show a possible use of geometric data structures in point-to-point motion planning in the Euclidean plane and present an approach using generalised Voronoi diagrams that decreases the probability of collisions with obstacles and generate smooth trajectories. The second application area, investigated here, is focused on problems of finding minimal networks connecting a set of given points in the Euclidean plane and their approximations using the Delaunay triangulation.

Název v anglickém jazyce

Geometric Data Structures Approximations for Network Optimisation

Popis výsledku anglicky

A frequent task in transportation, routing, robotics, and communications applications is to find the shortest path between two positions. In robot motion planning, the robot should pass around the obstacles touching none of them, i.e. the goal is to finda collision-free path from a starting to a target position. Research of path planning has yielded many fundamentally different approaches to its solution, mainly based on various decomposition and roadmap methods. In this paper, we show a possible use of geometric data structures in point-to-point motion planning in the Euclidean plane and present an approach using generalised Voronoi diagrams that decreases the probability of collisions with obstacles and generate smooth trajectories. The second application area, investigated here, is focused on problems of finding minimal networks connecting a set of given points in the Euclidean plane and their approximations using the Delaunay triangulation.

Druh

D - Stať ve sborníku

CEP obor

BB - Aplikovaná statistika, operační výzkum

OECD FORD obor

—

Projekt

<a href="/cs/project/GA102%2F09%2F1680" target="_blank" >GA102/09/1680: Evoluční návrh řídicích algoritmů</a><br>

Návaznosti

Z - Vyzkumny zamer (s odkazem do CEZ)

Rok uplatnění

2009

Kód důvěrnosti údajů

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

Název statě ve sborníku

Proceedings of the 11th WSEAS International Conference on Mathematical Methods, Computational Techniques & Intelligent Systems MAMECTIS '09

ISBN

978-960-474-094-9

ISSN

—

e-ISSN

—

Počet stran výsledku

6

Strana od-do

—

Název nakladatele

WSEAS Press

Místo vydání

La Laguna

Místo konání akce

La Laguna, Tenerife, Canary Islands

Datum konání akce

1. 7. 2009

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

—