1 resultado para recursive detrending
em Massachusetts Institute of Technology
Filtro por publicador
- Aberystwyth University Repository - Reino Unido (2)
- Acceda, el repositorio institucional de la Universidad de Las Palmas de Gran Canaria. España (1)
- AMS Tesi di Dottorato - Alm@DL - Università di Bologna (9)
- AMS Tesi di Laurea - Alm@DL - Università di Bologna (3)
- ArchiMeD - Elektronische Publikationen der Universität Mainz - Alemanha (6)
- Archimer: Archive de l'Institut francais de recherche pour l'exploitation de la mer (1)
- Archive of European Integration (2)
- Aston University Research Archive (21)
- Biblioteca de Teses e Dissertações da USP (2)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (2)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (BDPI/USP) (6)
- Biblioteca Digital de Teses e Dissertações Eletrônicas da UERJ (2)
- BORIS: Bern Open Repository and Information System - Berna - Suiça (17)
- Boston University Digital Common (19)
- Brock University, Canada (3)
- Bucknell University Digital Commons - Pensilvania - USA (5)
- Bulgarian Digital Mathematics Library at IMI-BAS (11)
- CaltechTHESIS (1)
- Cambridge University Engineering Department Publications Database (28)
- CentAUR: Central Archive University of Reading - UK (51)
- Chinese Academy of Sciences Institutional Repositories Grid Portal (30)
- Cochin University of Science & Technology (CUSAT), India (3)
- Collection Of Biostatistics Research Archive (1)
- Comissão Econômica para a América Latina e o Caribe (CEPAL) (1)
- CORA - Cork Open Research Archive - University College Cork - Ireland (2)
- Corvinus Research Archive - The institutional repository for the Corvinus University of Budapest (2)
- Deakin Research Online - Australia (49)
- Department of Computer Science E-Repository - King's College London, Strand, London (7)
- Digital Commons - Michigan Tech (5)
- Digital Commons at Florida International University (5)
- DigitalCommons@The Texas Medical Center (2)
- DigitalCommons@University of Nebraska - Lincoln (1)
- Doria (National Library of Finland DSpace Services) - National Library of Finland, Finland (1)
- DRUM (Digital Repository at the University of Maryland) (1)
- Duke University (4)
- Greenwich Academic Literature Archive - UK (4)
- Helda - Digital Repository of University of Helsinki (5)
- Illinois Digital Environment for Access to Learning and Scholarship Repository (1)
- Indian Institute of Science - Bangalore - Índia (46)
- Institutional Repository of Leibniz University Hannover (1)
- Instituto Politécnico do Porto, Portugal (1)
- Massachusetts Institute of Technology (1)
- National Center for Biotechnology Information - NCBI (5)
- Nottingham eTheses (4)
- Portal de Revistas Científicas Complutenses - Espanha (1)
- Publishing Network for Geoscientific & Environmental Data (7)
- QSpace: Queen's University - Canada (2)
- QUB Research Portal - Research Directory and Institutional Repository for Queen's University Belfast (47)
- Queensland University of Technology - ePrints Archive (40)
- RCAAP - Repositório Científico de Acesso Aberto de Portugal (1)
- Repositorio Académico de la Universidad Nacional de Costa Rica (1)
- Repositório Científico da Universidade de Évora - Portugal (2)
- Repositório digital da Fundação Getúlio Vargas - FGV (15)
- Repositório Digital da UNIVERSIDADE DA MADEIRA - Portugal (1)
- Repositório Institucional da Universidade de Aveiro - Portugal (4)
- Repositório Institucional da Universidade de Brasília (1)
- Repositório Institucional da Universidade Federal do Rio Grande - FURG (5)
- Repositório Institucional da Universidade Federal do Rio Grande do Norte (2)
- Repositório Institucional da Universidade Tecnológica Federal do Paraná (RIUT) (1)
- Repositório Institucional UNESP - Universidade Estadual Paulista "Julio de Mesquita Filho" (30)
- RUN (Repositório da Universidade Nova de Lisboa) - FCT (Faculdade de Cienecias e Technologia), Universidade Nova de Lisboa (UNL), Portugal (1)
- SAPIENTIA - Universidade do Algarve - Portugal (7)
- SerWisS - Server für Wissenschaftliche Schriften der Fachhochschule Hannover (1)
- Universidad de Alicante (6)
- Universidad del Rosario, Colombia (2)
- Universidad Politécnica de Madrid (23)
- Universidade Complutense de Madrid (2)
- Universidade de Lisboa - Repositório Aberto (2)
- Universidade Federal do Pará (7)
- Universidade Federal do Rio Grande do Norte (UFRN) (21)
- Universitat de Girona, Spain (1)
- Universitätsbibliothek Kassel, Universität Kassel, Germany (2)
- Université de Lausanne, Switzerland (2)
- Université de Montréal, Canada (19)
- University of Connecticut - USA (4)
- University of Michigan (7)
- University of Queensland eSpace - Australia (6)
- University of Washington (5)
- WestminsterResearch - UK (3)
Resumo:
This paper addresses the problem of efficiently computing the motor torques required to drive a lower-pair kinematic chain (e.g., a typical manipulator arm in free motion, or a mechanical leg in the swing phase) given the desired trajectory; i.e., the Inverse Dynamics problem. It investigates the high degree of parallelism inherent in the computations, and presents two "mathematically exact" formulations especially suited to high-speed, highly parallel implementations using special-purpose hardware or VLSI devices. In principle, the formulations should permit the calculations to run at a speed bounded only by I/O. The first presented is a parallel version of the recent linear Newton-Euler recursive algorithm. The time cost is also linear in the number of joints, but the real-time coefficients are reduced by almost two orders of magnitude. The second formulation reports a new parallel algorithm which shows that it is possible to improve upon the linear time dependency. The real time required to perform the calculations increases only as the [log2] of the number of joints. Either formulation is susceptible to a systolic pipelined architecture in which complete sets of joint torques emerge at successive intervals of four floating-point operations. Hardware requirements necessary to support the algorithm are considered and found not to be excessive, and a VLSI implementation architecture is suggested. We indicate possible applications to incorporating dynamical considerations into trajectory planning, e.g. it may be possible to build an on-line trajectory optimizer.