Není k dispozici

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F06%3A03123806" target="_blank" >RIV/68407700:21230/06:03123806 - isvavai.cz</a>

Výsledek na webu

—

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

Elliptic Net - A Path Planning Algorithm for Dynamic Environments

Popis výsledku v původním jazyce

Robot path planning and obstacle avoidance problems play an important role in mobile robotics. The standard algorithms assume that a working environment is static or changing slowly. Moreover, computation time and time needed for realization of the planned path is usually not crucial. The paper describes a novel algorithm that is focused especially to deal with these two issues: the presented algorithm - Elliptic Net is fast and robust and therefore usable in highly dynamic environments. The main idea of the algorithm is to cover an interesting part of the working environment by a set of nodes and to construct a graph where the nodes are connected by edges. Weights of the edges are then determined according to their lengths and distance to obstacles. This allows to choose whether a generated path will be safe (far from obstacles), short, or weigh these two criterions.

Název v anglickém jazyce

Elliptic Net - A Path Planning Algorithm for Dynamic Environments

Popis výsledku anglicky

Robot path planning and obstacle avoidance problems play an important role in mobile robotics. The standard algorithms assume that a working environment is static or changing slowly. Moreover, computation time and time needed for realization of the planned path is usually not crucial. The paper describes a novel algorithm that is focused especially to deal with these two issues: the presented algorithm - Elliptic Net is fast and robust and therefore usable in highly dynamic environments. The main idea of the algorithm is to cover an interesting part of the working environment by a set of nodes and to construct a graph where the nodes are connected by edges. Weights of the edges are then determined according to their lengths and distance to obstacles. This allows to choose whether a generated path will be safe (far from obstacles), short, or weigh these two criterions.

Druh

D - Stať ve sborníku

CEP obor

JC - Počítačový hardware a software

OECD FORD obor

—

Projekt

<a href="/cs/project/1M0567" target="_blank" >1M0567: Centrum aplikované kybernetiky</a><br>

Návaznosti

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

Rok uplatnění

2006

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

ICINCO 2006 - PROCEEDINGS

ISBN

972-8865-61-9

ISSN

—

e-ISSN

—

Počet stran výsledku

6

Strana od-do

372-377

Název nakladatele

Institute for Systems and Technologies of Information, Control and Communication

Místo vydání

Setúbal

Místo konání akce

Setúbal

Datum konání akce

1. 8. 2006

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

WRD - Celosvětová akce

Kód UT WoS článku

—