Inverse Kinematic Problem Solved By New Heuristic Algorithm Length Relaxation Method

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F46747885%3A24220%2F17%3A00004142" target="_blank" >RIV/46747885:24220/17:00004142 - isvavai.cz</a>
Alternative codes found
RIV/46747885:24620/17:00004142
Result on the web
—
DOI - Digital Object Identifier
—

Result language
angličtina
Original language name
Inverse Kinematic Problem Solved By New Heuristic Algorithm Length Relaxation Method
Original language description
The paper describes a new iteration heuristic algorithm for solving an inverse kinematic problem. The length relaxationmethod is based on cyclic iteration of a kinematic chain and systematic adaption of the distance between links. The length relaxation method is very easy to implement and ultimately extremely fast. The method also offers a numerically stable solution. The paper discusses the implementation of the algorithm with an example of a model solution on a simple kinematic chain. Besides, the paper makes a comparison of the algorithm properties with the most popular heuristic method for solving inverse kinematic problems, the CCD (Cyclic Coordinate Descent).
Czech name
—
Czech description
—

Project
—
Continuities
S - Specificky vyzkum na vysokych skolach<br>I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

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

Article name in the collection
Proceedings of the 2017 18th International Carpathian Control Conference (ICCC)
ISBN
978-150904862-5
ISSN
—
e-ISSN
—
Number of pages
5
Pages from-to
507-511
Publisher name
—
Place of publication
—
Event location
Sinaia
Event date
Jan 1, 2017
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—

Similar results(10)