About: Simulation-Based Goal-Selection for Autonomous Exploration

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

About: Simulation-Based Goal-Selection for Autonomous Exploration 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	High-level planning can be defined as the process of selection of an appropriate solution from a set of possible candidates. This process typically evaluates each candidate according to some reward function consisting of (1) cost, i.e., effort needed to accomplish the candidate and (2) the utility of accomplishing it and then selects the best one according to this evaluation.The key problem lies in the fact that the reward function can be rarely evaluated precisely. At the example of the problem of exploration of an unknown environment by a modular robot we show that precise simulation-based estimation of the cost function leads to better decisions of high-level planning and thus improves exploration process performance. State-of-the-art techniques compute the cost function in goal-selection as a length of the path from the current robot position to a goal-candidate. This is sufficient for robots with simple kinematics for which time to reach a candidate highly correlates with a path length. As this does not hold for complex (modular) robots, we introduce the approach that generates a feasible trajectory to each goal-candidate (taking into account kinematic constrains of the robot) and determines the cost function as time needed to perform this trajectory in a simulator. The experimental results with a robot consisting of eight modules operating in several environments show that the proposed simulation-based solution outperforms standard solutions. High-level planning can be defined as the process of selection of an appropriate solution from a set of possible candidates. This process typically evaluates each candidate according to some reward function consisting of (1) cost, i.e., effort needed to accomplish the candidate and (2) the utility of accomplishing it and then selects the best one according to this evaluation.The key problem lies in the fact that the reward function can be rarely evaluated precisely. At the example of the problem of exploration of an unknown environment by a modular robot we show that precise simulation-based estimation of the cost function leads to better decisions of high-level planning and thus improves exploration process performance. State-of-the-art techniques compute the cost function in goal-selection as a length of the path from the current robot position to a goal-candidate. This is sufficient for robots with simple kinematics for which time to reach a candidate highly correlates with a path length. As this does not hold for complex (modular) robots, we introduce the approach that generates a feasible trajectory to each goal-candidate (taking into account kinematic constrains of the robot) and determines the cost function as time needed to perform this trajectory in a simulator. The experimental results with a robot consisting of eight modules operating in several environments show that the proposed simulation-based solution outperforms standard solutions. (en)
Title	Simulation-Based Goal-Selection for Autonomous Exploration Simulation-Based Goal-Selection for Autonomous Exploration (en)
skos:prefLabel	Simulation-Based Goal-Selection for Autonomous Exploration Simulation-Based Goal-Selection for Autonomous Exploration (en)
skos:notation	RIV/68407700:21230/14:00225215!RIV15-TA0-21230___
http://linked.open...avai/riv/aktivita	P
http://linked.open...avai/riv/aktivity	P(TE01020197)
http://linked.open...vai/riv/dodaniDat	2015
http://linked.open...aciTvurceVysledku	Kulich, Miroslav Přeučil, Libor Vonásek, Vojtěch
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	České vysoké učení technické v Praze / Fakulta elektrotechnická
http://linked.open...dnocenehoVysledku	45018
http://linked.open...ai/riv/idVysledku	RIV/68407700:21230/14:00225215
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	Mobile Robotics; Search and Rescue; Planning (en)
http://linked.open.../riv/klicoveSlovo	Mobile Robotics Planning Search and Rescue
http://linked.open...ontrolniKodProRIV	[9C155FEEA8A6]
http://linked.open...v/mistoKonaniAkce	Rome
http://linked.open...i/riv/mistoVydani	Cham
http://linked.open...i/riv/nazevZdroje	Modelling and Simulation for Autonomous Systems
http://linked.open...in/vavai/riv/obor	JC
http://linked.open...ichTvurcuVysledku	3 (xsd:int)
http://linked.open...cetTvurcuVysledku	3 (xsd:int)
http://linked.open...vavai/riv/projekt	Centre for Applied Cybernetics 3
http://linked.open...UplatneniVysledku	2014
http://linked.open...iv/tvurceVysledku	Kulich, Miroslav Přeučil, Libor Vonásek, Vojtěch
http://linked.open...vavai/riv/typAkce	WRD - Světová
http://linked.open.../riv/zahajeniAkce	2014-05-05 (xsd:date)
issn	0302-9743
number of pages	11 (xsd:int)
http://purl.org/ne...btex#hasPublisher	Springer-Verlag
https://schema.org/isbn	978-3-319-13822-0
http://localhost/t...ganizacniJednotka	21230

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, 48 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software