Biomedical subjects

Raphael T Haftka

Publications and source records attributed to Raphael T Haftka.

3 recordsLinked to original sources

PubMed2006

Parallel asynchronous particle swarm optimization.

The high computational cost of complex engineering optimization problems has motivated the development of parallel optimization algorithms. A recent example is the parallel particle swarm optimization (PSO) algorithm, which is valuable due to its global search capabilities. Unfortunately, because existing parallel implementations are synchronous (PSPSO), they do not make efficient use of computational resources when a load imbalance exists. In this study, we introduce a parallel asynchronous PSO (PAPSO) algorithm to enhance computational efficiency. The performance of the PAPSO algorithm was compared to that of a PSPSO algorithm in homogeneous and heterogeneous computing environments for small- to medium-scale analytical test problems and a medium-scale biomechanical test problem. For all problems, the robustness and convergence rate of PAPSO were comparable to those of PSPSO. However, the parallel performance of PAPSO was significantly better than that of PSPSO for heterogeneous computing environments or heterogeneous computational tasks. For example, PAPSO was 3.5 times faster than was PSPSO for the biomechanical test problem executed on a heterogeneous cluster with 20 processors. Overall, PAPSO exhibits excellent parallel performance when a large number of processors (more than about 15) is utilized and either (1) heterogeneity exists in the computational task or environment, or (2) the computation-to-communication time ratio is relatively small.

Journal Article↗

PubMed2005

Determination of patient-specific multi-joint kinematic models through two-level optimization.

Dynamic patient-specific musculoskeletal models have great potential for addressing clinical problems in orthopedics and rehabilitation. However, their predictive capability is limited by how well the underlying kinematic model matches the patient's structure. This study presents a general two-level optimization procedure for tuning any multi-joint kinematic model to a patient's experimental movement data. An outer level optimization modifies the model's parameters (joint position and orientations) while repeated inner level optimizations modify the model's degrees of freedom given the current parameters, with the goal of minimizing errors between model and experimental marker trajectories. The approach is demonstrated by fitting a 27 parameter, three-dimensional, 12 degree-of-freedom lower-extremity kinematic model to synthetic and experimental movement data for isolated joint (hip, knee, and ankle) and gait (full leg) motions. For noiseless synthetic data, the approach successfully recovered the known joint parameters to within an arbitrarily tight tolerance. When noise was added to the synthetic data, root-mean-square (RMS) errors between known and recovered joint parameters were within 10.4 degrees and 10 mm. For experimental data, RMS marker distance errors were reduced by up to 62% compared to methods that estimate joint parameters from anatomical landmarks. Optimized joint parameters found using a loaded full-leg gait motion differed significantly from those found using unloaded individual joint motions. In the future, this approach may facilitate the creation of dynamic patient-specific musculoskeletal models for predictive clinical applications.

Biomechanical Phenomena↗

PubMed2005

Evaluation of a particle swarm algorithm for biomechanical optimization.

Optimization is frequently employed in biomechanics research to solve system identification problems, predict human movement, or estimate muscle or other internal forces that cannot be measured directly. Unfortunately, biomechanical optimization problems often possess multiple local minima, making it difficult to find the best solution. Furthermore, convergence in gradient-based algorithms can be affected by scaling to account for design variables with different length scales or units. In this study we evaluate a recently-developed version of the particle swarm optimization (PSO) algorithm to address these problems. The algorithm's global search capabilities were investigated using a suite of difficult analytical test problems, while its scale-independent nature was proven mathematically and verified using a biomechanical test problem. For comparison, all test problems were also solved with three off-the-shelf optimization algorithms--a global genetic algorithm (GA) and multistart gradient-based sequential quadratic programming (SQP) and quasi-Newton (BFGS) algorithms. For the analytical test problems, only the PSO algorithm was successful on the majority of the problems. When compared to previously published results for the same problems, PSO was more robust than a global simulated annealing algorithm but less robust than a different, more complex genetic algorithm. For the biomechanical test problem, only the PSO algorithm was insensitive to design variable scaling, with the GA algorithm being mildly sensitive and the SQP and BFGS algorithms being highly sensitive. The proposed PSO algorithm provides a new off-the-shelf global optimization option for difficult biomechanical problems, especially those utilizing design variables with different length scales or units.

Algorithms↗