Path planning of 3D solid objects using approximate solutions

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F19%3A00335535" target="_blank" >RIV/68407700:21230/19:00335535 - isvavai.cz</a>

Výsledek na webu

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

DOI - Digital Object Identifier

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

Jazyk výsledku

angličtina

Název v původním jazyce

Path planning of 3D solid objects using approximate solutions

Popis výsledku v původním jazyce

Path planning of 3D solid objects has many practical applications. Sampling-based planners like Rapidly-exploring Random Tree (RRT) tackle the problem by the randomized sampling of the configuration space. The well-known issue of the sampling-based planners is the narrow passage problem. Narrow passages are small collision-free regions in the configuration space that are, due to their low volume, difficult to cover by the random samples, which prevents the sampling-based planners from finding a path leading through the passages. To increase the success rate of the planners, the search in the configuration space can be guided using an approximate solution. An approximate solution is found, for example, considering a smaller object (robot). The performance of this planning concept depends on the way of reducing the size of the object and the ability to find an initial solution. In this paper, we propose a novel technique to reduce the geometry of the object by a combination of triangulation and iterative removal of surface triangles. This technique is suitable for both convex and non-convex objects. In many real-world applications, narrow passages can also contain the initial or goal configurations. We thus propose the extension of the goal region to increase the probability of finding the initial approximate solution. Experiments have shown that the proposed modification outperforms the simple guiding using approximate solutions, as well as other related state-of-the-art planners.

Název v anglickém jazyce

Path planning of 3D solid objects using approximate solutions

Popis výsledku anglicky

Path planning of 3D solid objects has many practical applications. Sampling-based planners like Rapidly-exploring Random Tree (RRT) tackle the problem by the randomized sampling of the configuration space. The well-known issue of the sampling-based planners is the narrow passage problem. Narrow passages are small collision-free regions in the configuration space that are, due to their low volume, difficult to cover by the random samples, which prevents the sampling-based planners from finding a path leading through the passages. To increase the success rate of the planners, the search in the configuration space can be guided using an approximate solution. An approximate solution is found, for example, considering a smaller object (robot). The performance of this planning concept depends on the way of reducing the size of the object and the ability to find an initial solution. In this paper, we propose a novel technique to reduce the geometry of the object by a combination of triangulation and iterative removal of surface triangles. This technique is suitable for both convex and non-convex objects. In many real-world applications, narrow passages can also contain the initial or goal configurations. We thus propose the extension of the goal region to increase the probability of finding the initial approximate solution. Experiments have shown that the proposed modification outperforms the simple guiding using approximate solutions, as well as other related state-of-the-art planners.

Druh

D - Stať ve sborníku

CEP obor

—

OECD FORD obor

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

Projekt

<a href="/cs/project/GJ19-22555Y" target="_blank" >GJ19-22555Y: Vzorkovací techniky plánování pohybu a akcí s využitím aproximačních řešení</a><br>

Návaznosti

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

Rok uplatnění

2019

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

24th IEEE Conference on Emerging Technologies and Factory Automation

ISBN

978-1-7281-0303-7

ISSN

—

e-ISSN

1946-0759

Počet stran výsledku

8

Strana od-do

593-600

Název nakladatele

IEEE

Místo vydání

Piscataway, NJ

Místo konání akce

Zaragoza

Datum konání akce

10. 9. 2019

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

WRD - Celosvětová akce

Kód UT WoS článku

—