About: Motion Planning in the Plane with Obstacles

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

About: Motion Planning in the Plane with Obstacles 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	The task of planning trajectories plays an important role in transportation, robotics, even in information systems (sending messages). In robot motion planning the robot should pass around the obstacles, from a given starting position to a given target position, touching none of them, i.e. the goal is to find a collision-free path from the starting to the target position. This task has many specific formulations depending on the shape of obstacles, allowable directions of movements, knowledge of the scene, etc. Research on path planning has yielded many fundamentally different approaches to its solution, e.g. visibility graph method or the shortest path map method. Assuming movements only in a restricted number of directions (eight directional, horizontal/vertical) the task, with respect to its combinatorial nature, can be solved by heuristic techniques (genetic algorithms, simulated annealing, tabu-search). We present a framework of such approach and show its drawbacks (combinatorial explosion, limi The task of planning trajectories plays an important role in transportation, robotics, even in information systems (sending messages). In robot motion planning the robot should pass around the obstacles, from a given starting position to a given target position, touching none of them, i.e. the goal is to find a collision-free path from the starting to the target position. This task has many specific formulations depending on the shape of obstacles, allowable directions of movements, knowledge of the scene, etc. Research on path planning has yielded many fundamentally different approaches to its solution, e.g. visibility graph method or the shortest path map method. Assuming movements only in a restricted number of directions (eight directional, horizontal/vertical) the task, with respect to its combinatorial nature, can be solved by heuristic techniques (genetic algorithms, simulated annealing, tabu-search). We present a framework of such approach and show its drawbacks (combinatorial explosion, limi (en)
Title	Motion Planning in the Plane with Obstacles Motion Planning in the Plane with Obstacles (en)
skos:prefLabel	Motion Planning in the Plane with Obstacles Motion Planning in the Plane with Obstacles (en)
skos:notation	RIV/00216305:26210/04:PU47001!RIV11-MSM-26210___
http://linked.open...avai/riv/aktivita	V Z
http://linked.open...avai/riv/aktivity	V, Z(MSM 260000013), Z(MSM 261100009), Z(MSM 262100024)
http://linked.open...vai/riv/dodaniDat	2011
http://linked.open...aciTvurceVysledku	Šeda, Miloš
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	574643
http://linked.open...ai/riv/idVysledku	RIV/00216305:26210/04:PU47001
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	Motion planning, genetic algorithm, case-based reasoning, Voronoi diagram, rectilinear metric (en)
http://linked.open.../riv/klicoveSlovo	Voronoi diagram case-based reasoning genetic algorithm Motion planning rectilinear metric
http://linked.open...ontrolniKodProRIV	[4B3FE740DFA4]
http://linked.open...v/mistoKonaniAkce	Graz
http://linked.open...i/riv/mistoVydani	Graz (Austria)
http://linked.open...i/riv/nazevZdroje	Abstracts of Summer School on Control Theory and Applications
http://linked.open...in/vavai/riv/obor	JD
http://linked.open...ichTvurcuVysledku	1 (xsd:int)
http://linked.open...cetTvurcuVysledku	1 (xsd:int)
http://linked.open...UplatneniVysledku	2004
http://linked.open...iv/tvurceVysledku	Šeda, Miloš
http://linked.open...vavai/riv/typAkce	EUR - Evropská
http://linked.open.../riv/zahajeniAkce	2004-09-01 (xsd:date)
http://linked.open...n/vavai/riv/zamer	http://linked.opendata.cz/resource/domain/vavai/zamer/MSM%20262100024 http://linked.opendata.cz/resource/domain/vavai/zamer/MSM%20260000013 http://linked.opendata.cz/resource/domain/vavai/zamer/MSM%20261100009
number of pages	12 (xsd:int)
http://purl.org/ne...btex#hasPublisher	Graz University of Technology
http://localhost/t...ganizacniJednotka	26210

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