All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Step planning algorithm for n-legged walking robot with smooth direction control

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26210%2F19%3APU133229" target="_blank" >RIV/00216305:26210/19:PU133229 - isvavai.cz</a>

  • Result on the web

    <a href="http://www.engmech.cz/im/proceedings/show/2019" target="_blank" >http://www.engmech.cz/im/proceedings/show/2019</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.21495/71-0-199" target="_blank" >10.21495/71-0-199</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Step planning algorithm for n-legged walking robot with smooth direction control

  • Original language description

    Precise step-planning algorithm is important when we want to drive an n-legged walking robot. Probably the most widely used precise control system is based on neural networks, but those require a lot of computing power. The main goal of this paper is to propose a computationally efficient method for precise and smooth movement of a robot. An algorithm capable of computing end-step position based on movement around a circle was developed. It can be driven by control vector or (with minor modification) by a radius and a tangent. It is simple to implement, adjust and debug, and needs only a small amount of computational power. The proposed algorithm only generates the end points of each step. It can be used as a basis for more complex solution and can be also used in a system with a large number of legs. The movement of body, the kinematics of mechanical parts and the manipulation of center of mass must be solved by other algorithms.

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

  • OECD FORD branch

    20204 - Robotics and automatic control

Result continuities

  • Project

  • Continuities

    S - Specificky vyzkum na vysokych skolach

Others

  • Publication year

    2019

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Article name in the collection

    ENGINEERING MECHANICS 2019

  • ISBN

    978-80-87012-71-0

  • ISSN

  • e-ISSN

  • Number of pages

    4

  • Pages from-to

    199-202

  • Publisher name

    Neuveden

  • Place of publication

    neuveden

  • Event location

    Svratka

  • Event date

    May 13, 2019

  • Type of event by nationality

    EUR - Evropská akce

  • UT code for WoS article

    000613255300044