About: Geometric Data Structures Approximations for Network Optimisation

Facets (new session)
Description
Metadata
Settings
- owl:sameAs
- Inference Rule:

About: Geometric Data Structures Approximations for Network Optimisation Goto Sponge NotDistinct Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

Attributes	Values
rdf:type	skos:Concept http://linked.opendata.cz/ontology/domain/vavai/Vysledek
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 find a 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. 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 find a 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. (en)
Title	Geometric Data Structures Approximations for Network Optimisation Geometric Data Structures Approximations for Network Optimisation (en)
skos:prefLabel	Geometric Data Structures Approximations for Network Optimisation Geometric Data Structures Approximations for Network Optimisation (en)
skos:notation	RIV/00216305:26210/09:PU86334!RIV10-MSM-26210___
http://linked.open...avai/riv/aktivita	P Z
http://linked.open...avai/riv/aktivity	P(GA102/09/1680), Z(MSM0021630518)
http://linked.open...vai/riv/dodaniDat	2010
http://linked.open...aciTvurceVysledku	Šeda, Miloš Březina, Tomáš
http://linked.open.../riv/druhVysledku	D - Článek ve sborníku
http://linked.open...iv/duvernostUdaju	S - Úplné a pravdivé údaje nepodléhající ochraně podle zvláštních právních předpisů
http://linked.open...titaPredkladatele	Vysoké učení technické v Brně / Fakulta strojního inženýrství
http://linked.open...dnocenehoVysledku	316324
http://linked.open...ai/riv/idVysledku	RIV/00216305:26210/09:PU86334
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	motion planning, spanning tree, Steiner tree, Delaunay triangulation, Voronoi diagram (en)
http://linked.open.../riv/klicoveSlovo	Voronoi diagram spanning tree Delaunay triangulation Steiner tree motion planning
http://linked.open...ontrolniKodProRIV	[E0BDA1C116F9]
http://linked.open...v/mistoKonaniAkce	La Laguna, Tenerife, Canary Islands
http://linked.open...i/riv/mistoVydani	La Laguna
http://linked.open...i/riv/nazevZdroje	Proceedings of the 11th WSEAS International Conference on Mathematical Methods, Computational Techniques & Intelligent Systems MAMECTIS '09
http://linked.open...in/vavai/riv/obor	BB
http://linked.open...ichTvurcuVysledku	2 (xsd:int)
http://linked.open...cetTvurcuVysledku	2 (xsd:int)
http://linked.open...vavai/riv/projekt	Control Algorithm Design by Means of Evolutionary Approach
http://linked.open...UplatneniVysledku	2009
http://linked.open...iv/tvurceVysledku	Březina, Tomáš Šeda, Miloš
http://linked.open...vavai/riv/typAkce	WRD - Světová
http://linked.open.../riv/zahajeniAkce	2009-07-01 (xsd:date)
http://linked.open...n/vavai/riv/zamer	Simulation modelling of mechatronics systems
number of pages	6 (xsd:int)
http://purl.org/ne...btex#hasPublisher	WSEAS Press
https://schema.org/isbn	978-960-474-094-9
http://localhost/t...ganizacniJednotka	26210
is http://linked.open...avai/riv/vysledek of	Geometric Data Structures Approximations for Network Optimisation Geometric Data Structures Approximations for Network Optimisation Geometric Data Structures Approximations for Network Optimisation Geometric Data Structures Approximations for Network Optimisation

Faceted Search & Find service v1.16.118 as of Jun 21 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 58 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software