About: THE WALKING POLICIES AUTOMATIC GENERATION USING BEAM SEARCH     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)

AttributesValues
rdf:type
Description
  • This contribution deals with the problem of automatic generation of different styles of statically stable walking gait of a four-legged robot. The search for appropriate strategies is based on the scanning of state space using an informed search algorithm called A* and an algorithm of beam search. This article compares these two methods and considers the suitability of their use. A tree is used to represent and describe the state space. The tree is generated using a set of elementary production rules chhosen in order to obtain an acceptable complexity of the tree and algorithm response. Policies are continuously generated as short-time plans of robot movements. Verification of the discussed algorithms and proposed rules is provided using software simulation.
  • This contribution deals with the problem of automatic generation of different styles of statically stable walking gait of a four-legged robot. The search for appropriate strategies is based on the scanning of state space using an informed search algorithm called A* and an algorithm of beam search. This article compares these two methods and considers the suitability of their use. A tree is used to represent and describe the state space. The tree is generated using a set of elementary production rules chhosen in order to obtain an acceptable complexity of the tree and algorithm response. Policies are continuously generated as short-time plans of robot movements. Verification of the discussed algorithms and proposed rules is provided using software simulation. (en)
  • This contribution deals with the problem of automatic generation of different styles of statically stable walking gait of a four-legged robot. The search for appropriate strategies is based on the scanning of state space using an informed search algorithm called A* and an algorithm of beam search. This article compares these two methods and considers the suitability of their use. A tree is used to represent and describe the state space. The tree is generated using a set of elementary production rules chhosen in order to obtain an acceptable complexity of the tree and algorithm response. Policies are continuously generated as short-time plans of robot movements. Verification of the discussed algorithms and proposed rules is provided using software simulation. (cs)
Title
  • THE WALKING POLICIES AUTOMATIC GENERATION USING BEAM SEARCH
  • THE WALKING POLICIES AUTOMATIC GENERATION USING BEAM SEARCH (en)
  • THE WALKING POLICIES AUTOMATIC GENERATION USING BEAM SEARCH (cs)
skos:prefLabel
  • THE WALKING POLICIES AUTOMATIC GENERATION USING BEAM SEARCH
  • THE WALKING POLICIES AUTOMATIC GENERATION USING BEAM SEARCH (en)
  • THE WALKING POLICIES AUTOMATIC GENERATION USING BEAM SEARCH (cs)
skos:notation
  • RIV/00216305:26210/06:PU62237!RIV06-MSM-26210___
http://linked.open.../vavai/riv/strany
  • 145-150
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • Z(MSM0021630518)
http://linked.open...vai/riv/dodaniDat
http://linked.open...aciTvurceVysledku
http://linked.open.../riv/druhVysledku
http://linked.open...iv/duvernostUdaju
http://linked.open...titaPredkladatele
http://linked.open...dnocenehoVysledku
  • 508816
http://linked.open...ai/riv/idVysledku
  • RIV/00216305:26210/06:PU62237
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • beam search, walking gait, A star, four-legged (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...ontrolniKodProRIV
  • [D4830C2A2052]
http://linked.open...v/mistoKonaniAkce
  • Brno University of Technology
http://linked.open...i/riv/mistoVydani
  • Brno
http://linked.open...i/riv/nazevZdroje
  • Mendel 2006
http://linked.open...in/vavai/riv/obor
http://linked.open...ichTvurcuVysledku
http://linked.open...cetTvurcuVysledku
http://linked.open...UplatneniVysledku
http://linked.open...iv/tvurceVysledku
  • Březina, Tomáš
  • Krejsa, Jiří
  • Ondroušek, Vít
http://linked.open...vavai/riv/typAkce
http://linked.open.../riv/zahajeniAkce
http://linked.open...n/vavai/riv/zamer
number of pages
http://purl.org/ne...btex#hasPublisher
  • Neuveden
https://schema.org/isbn
  • 80-214-3195-4
http://localhost/t...ganizacniJednotka
  • 26210
is http://linked.open...avai/riv/vysledek of
Faceted Search & Find service v1.16.118 as of Jun 21 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
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