Scalable O(log2n) Dynamics Control for Soft Exoskeletons

被引:0
|
作者
Colorado, Julian D. [1 ]
Mendez, Diego [1 ]
Gomez-Bautista, Andres [1 ]
Bermeo, John E. [1 ]
Alvarado-Rojas, Catalina [1 ]
Cuellar, Fredy [1 ]
机构
[1] Pontificia Univ Javeriana, Sch Engn, Bogota 110231, Colombia
关键词
soft exoskeletons; parallel computing; embedded systems; HIL; dynamics control; ALGORITHM;
D O I
10.3390/act13110450
中图分类号
TH [机械、仪表工业];
学科分类号
0802 ;
摘要
Robotic exoskeletons are being actively applied to support the activities of daily living (ADL) for patients with hand motion impairments. In terms of actuation, soft materials and sensors have opened new alternatives to conventional rigid body structures. In this arena, biomimetic soft systems play an important role in modeling and controlling human hand kinematics without the restrictions of rigid mechanical joints while having an entirely deformable body with limitless points of actuation. In this paper, we address the computational limitations of modeling large-scale articulated systems for soft robotic exoskeletons by integrating a parallel algorithm to compute the exoskeleton's dynamics equations of motion (EoM), achieving a computation with O(log2n) complexity for the highly articulated n degrees of freedom (DoF) running on p processing cores. The proposed parallel algorithm achieves an exponential speedup for n=p=64 DoF while achieving a 0.96 degree of parallelism for n=p=256, which demonstrates the required scalability for controlling highly articulated soft exoskeletons in real time. However, scalability will be bounded by the n=p fraction.
引用
收藏
页数:15
相关论文
共 10 条
  • [1] Follow-the-leader Formation Marching Through a Scalable O(log2n) Parallel Architecture.
    Colorado, J.
    Barrientos, A.
    Rossi, C.
    del Cerro, J.
    IEEE/RSJ 2010 INTERNATIONAL CONFERENCE ON INTELLIGENT ROBOTS AND SYSTEMS (IROS 2010), 2010, : 5583 - 5588
  • [2] Paired quantum Fourier transform with log2N Hadamard gates
    Grigoryan, Artyom M.
    Agaian, Sos S.
    QUANTUM INFORMATION PROCESSING, 2019, 18 (07)
  • [3] An O(log2N) Fully-Balanced Resampling Algorithm for Particle Filters on Distributed Memory Architectures
    Varsi, Alessandro
    Maskell, Simon
    Spirakis, Paul G.
    ALGORITHMS, 2021, 14 (12)
  • [4] Constructing a cactus for minimum cuts of a graph in O (mn+n2 log n) time and O(m) Space
    Nagamochi, H
    Nakamura, S
    Ishii, T
    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2003, E86D (02): : 179 - 185
  • [5] AN O(N2 LOG N) ALGORITHM FOR THE HAMILTONIAN CYCLE PROBLEM ON CIRCULAR-ARC GRAPHS
    SHIH, WK
    CHERN, TC
    HSU, WL
    SIAM JOURNAL ON COMPUTING, 1992, 21 (06) : 1026 - 1046
  • [6] A simplified algorithm for the all pairs shortest path problem with O(n2 log n) expected time
    Takaoka, Tadao
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2013, 25 (02) : 326 - 337
  • [7] Parallel O(N) Stokes' solver towards scalable Brownian dynamics of hydrodynamically interacting objects in general geometries
    Zhao, Xujun
    Li, Jiyuan
    Jiang, Xikai
    Karpeev, Dmitry
    Heinonen, Olle
    Smith, Barry
    Hernandez-Ortiz, Juan P.
    de Pablo, Juan J.
    JOURNAL OF CHEMICAL PHYSICS, 2017, 146 (24)
  • [8] An O(k2 • log (n)) algorithm for computing the reliability of consecutive-k-out-of-n:F systems
    Lin, MS
    IEEE TRANSACTIONS ON RELIABILITY, 2004, 53 (01) : 3 - 6
  • [9] AN O(N.LOG(N)) ALGORITHM TO COMPUTE THE ALL-TERMINAL RELIABILITY OF (K(5), K(2),2,2) FREE NETWORKS
    POLITOF, T
    SATYANARAYANA, A
    TUNG, L
    IEEE TRANSACTIONS ON RELIABILITY, 1992, 41 (04) : 512 - 517
  • [10] An O(log2(N)) Algorithm for Reliability Evaluation of h-Extra Edge-Connectivity of Folded Hypercubes
    Zhang, Mingzu
    Zhang, Lianzhu
    Feng, Xing
    Lai, Hong-Jian
    IEEE TRANSACTIONS ON RELIABILITY, 2018, 67 (01) : 297 - 307