All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Geometric Data Structures Approximations for Network Optimisation

The result's identifiers

  • Result code in 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>

  • Result on the web

  • DOI - Digital Object Identifier

Alternative languages

  • Result language

    angličtina

  • Original language name

    Geometric Data Structures Approximations for Network Optimisation

  • Original language description

    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.

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

    BB - Applied statistics, operational research

  • OECD FORD branch

Result continuities

  • Project

    <a href="/en/project/GA102%2F09%2F1680" target="_blank" >GA102/09/1680: Control Algorithm Design by Means of Evolutionary Approach</a><br>

  • Continuities

    Z - Vyzkumny zamer (s odkazem do CEZ)

Others

  • Publication year

    2009

  • Confidentiality

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

Data specific for result type

  • Article name in the collection

    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

  • Number of pages

    6

  • Pages from-to

  • Publisher name

    WSEAS Press

  • Place of publication

    La Laguna

  • Event location

    La Laguna, Tenerife, Canary Islands

  • Event date

    Jul 1, 2009

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article