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”

Narrow passage problem solution for motion planning

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F49777513%3A23520%2F20%3A43960101" target="_blank" >RIV/49777513:23520/20:43960101 - isvavai.cz</a>

  • Result on the web

    <a href="http://hdl.handle.net/11025/47179" target="_blank" >http://hdl.handle.net/11025/47179</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1007/978-3-030-50371-0_34" target="_blank" >10.1007/978-3-030-50371-0_34</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Narrow passage problem solution for motion planning

  • Original language description

    The paper introduces a new randomized sampling-based method of motion planning suitable for the problem of narrow passages. The proposed method was inspired by the method of exit points for cavities in protein models and is based on the Rapidly Exploring Random Tree (RRT). Unlike other methods, it can also provide locations of the exact positions of narrow passages. This information is extremely important as it helps to solve this part of space in more detail and even to decide whether a path through this bottleneck exists or not. For data with narrow passages, the proposed method finds more paths in a shorter time, for data without narrow passages, the proposed method is slower but still provides correct paths.

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

  • OECD FORD branch

    10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Result continuities

  • Project

    <a href="/en/project/GA17-07690S" target="_blank" >GA17-07690S: Methods of Identification and Visualization of Tunnels for Flexible Ligands in Dynamic Proteins</a><br>

  • Continuities

    P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

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

    Lecture Notes in Computer Science 20th International Conference on Computational Science, ICCS 2020

  • ISBN

    978-3-030-50370-3

  • ISSN

    0302-9743

  • e-ISSN

    1611-3349

  • Number of pages

    12

  • Pages from-to

    459-470

  • Publisher name

    Springer

  • Place of publication

    Cham

  • Event location

    Amsterdam

  • Event date

    Jun 3, 2020

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article