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”

Computational Geometry Data Structures in Logistics and Navigation Tasks

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26210%2F20%3APU137480" target="_blank" >RIV/00216305:26210/20:PU137480 - isvavai.cz</a>

  • Result on the web

    <a href="https://ieeexplore.ieee.org/document/9222453" target="_blank" >https://ieeexplore.ieee.org/document/9222453</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1109/ICUMT51630.2020.9222453" target="_blank" >10.1109/ICUMT51630.2020.9222453</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Computational Geometry Data Structures in Logistics and Navigation Tasks

  • Original language description

    Computational geometry data structures have many applications, such as network optimisation, location tasks, but they can also be used in robot motion planning when a path of the shortest length must be found between the start and target positions that guarantee movements without the risk of collisions with obstacles. The paper deals with visibility graphs, strip and cell decompositions, Voronoi diagrams and compares their properties and efficiency in the investigated area. Since cell decomposition-based approaches give exponential complexity depending on the number of cells, and the knowledge base makes it possible to reduce it mostly only insignificantly, Voronoi diagrams with their polynomial complexity are more efficient for large instances. In addition, their generalized version allows them to generate smooth trajectories.

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

  • OECD FORD branch

    10102 - Applied mathematics

Result continuities

  • Project

  • Continuities

    S - Specificky vyzkum na vysokych skolach

Others

  • Publication year

    2020

  • 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

    2020 12th International Congress on Ultra Modern Telecommunications and Control Systems and Workshops (ICUMT)

  • ISBN

    978-1-7281-9281-9

  • ISSN

  • e-ISSN

  • Number of pages

    6

  • Pages from-to

    179-184

  • Publisher name

    IEEE

  • Place of publication

    online

  • Event location

    Online

  • Event date

    Oct 5, 2020

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article

    000627398300032