Repository logo

Infoscience

  • English
  • French
Log In
Logo EPFL, École polytechnique fédérale de Lausanne

Infoscience

  • English
  • French
Log In
  1. Home
  2. Academic and Research Output
  3. Journal articles
  4. An inverse kinematics architecture enforcing an arbitrary number of strict priority levels
 
research article

An inverse kinematics architecture enforcing an arbitrary number of strict priority levels

Baerlocher, P.
•
Boulic, R.  
2004
Visual Computer

An efficient inverse kinematics solver is a key element in applications targeting the on-line or off-line postural control of complex articulated figures. In the present paper we progressively describe the strategic components of a very general and robust inverse kinematics architecture. We then present an efficient recursive algorithm enforcing an arbitrary number of strict priorities to arbitrate the fulfillment of conflicting constraints. Due to its local nature, the moderate cost of the solution allows this architecture to run within an interactive environment. The algorithm is illustrated on the postural control of complex articulated figures

  • Details
  • Metrics
Type
research article
DOI
10.1007/s00371-004-0244-4
Web of Science ID

WOS:000223296100005

Author(s)
Baerlocher, P.
Boulic, R.  
Date Issued

2004

Publisher

Springer Verlag

Published in
Visual Computer
Volume

20

Issue

6

Start page

402

End page

17

Subjects

computer animation

•

kinematics

•

priority

•

posture

•

optimization

Note

NEKO Entertainment, Montreuil, France

Editorial or Peer reviewed

REVIEWED

Written at

EPFL

EPFL units
VRLAB  
SCI-IC-RB  
Available on Infoscience
January 16, 2007
Use this identifier to reference this record
https://infoscience.epfl.ch/handle/20.500.14299/239210
Logo EPFL, École polytechnique fédérale de Lausanne
  • Contact
  • infoscience@epfl.ch

  • Follow us on Facebook
  • Follow us on Instagram
  • Follow us on LinkedIn
  • Follow us on X
  • Follow us on Youtube
AccessibilityLegal noticePrivacy policyCookie settingsEnd User AgreementGet helpFeedback

Infoscience is a service managed and provided by the Library and IT Services of EPFL. © EPFL, tous droits réservés