paper-with-me

Papers

Multi-objective optimization via evolutionary algorithm (MOVEA) for high-definition transcranial electrical stimulation of the human brain

2022-11-10 · Mo Wang, Kexin Lou, Zeming Liu, Pengfei Wei, Quanying Liu

Designing a transcranial electrical stimulation (TES) strategy requires considering multiple objectives, such as intensity in the target area, focality, stimulation depth, and avoidance zone, which are often mutually exclusive. A computational framework for optimizing different strategies and comparing trade-offs between these objectives is currently lacking. In this paper, we propose a general framework called multi-objective optimization via evolutionary algorithms (MOVEA) to address the non-convex optimization problem in designing TES strategies without predefined direction. MOVEA enables simultaneous optimization of multiple targets through Pareto optimization, generating a Pareto front after a single run without manual weight adjustment and allowing easy expansion to more targets. This Pareto front consists of optimal solutions that meet various requirements while respecting trade-off relationships between conflicting objectives such as intensity and focality. MOVEA is versatile and suitable for both transcranial alternating current stimulation (tACS) and transcranial temporal interference stimulation (tTIS) based on high definition (HD) and two-pair systems. We performed a comprehensive comparison between tACS and tTIS in terms of intensity, focality, and steerability for targets at different depths.MOVEA facilitates the optimization of TES based on specific objectives and constraints, advancing tTIS and tACS-based neuromodulation in understanding the causal relationship between brain regions and cognitive functions and in treating diseases. The code for MOVEA is available at https://github.com/ncclabsustech/MOVEA.

📄 PDF Abstract BibTeX arXiv:2211.05658

Code (1)

ncclabsustech/MOVEA 공식 구현

Tasks

Evolutionary Algorithms

Similar Papers 제목 키워드 기반

The Hybridization of Branch and Bound with Metaheuristics for Nonconvex Multiobjective Optimization

2022-12-09 · Wei-tian Wu, Xin-min Yang

A hybrid framework combining the branch and bound method with multiobjective evolutionary algorithms is proposed for nonconvex multiobjective optimization. The hybridization exploits the complementary character of the tw…

Evolutionary AlgorithmsMultiobjective Optimization

Evolutionary Alternating Direction Method of Multipliers for Constrained Multi-Objective Optimization with Unknown Constraints

2024-01-02 · Shuang Li, Ke Li, Wei Li, Ming Yang

Constrained multi-objective optimization problems (CMOPs) pervade real-world applications in science, engineering, and design. Constraint violation has been a building block in designing evolutionary multi-objective opti…

Do We Really Need to Use Constraint Violation in Constrained Evolutionary Multi-Objective Optimization?

2022-05-28 · Shuang Li, Ke Li, Wei Li

Constraint violation has been a building block to design evolutionary multi-objective optimization algorithms for solving constrained multi-objective optimization problems. However, it is not uncommon that the constraint…

A Federated Data-Driven Evolutionary Algorithm for Expensive Multi/Many-objective Optimization

2021-06-22 · Jinjin Xu, Yaochu Jin, Wenli Du

Data-driven optimization has found many successful applications in the real world and received increased attention in the field of evolutionary optimization. Most existing algorithms assume that the data used for optimiz…

Evolutionary AlgorithmsFederated Learning

A Framework to Handle Multi-modal Multi-objective Optimization in Decomposition-based Evolutionary Algorithms

2020-09-30 · Ryoji Tanabe, Hisao Ishibuchi

Multi-modal multi-objective optimization is to locate (almost) equivalent Pareto optimal solutions as many as possible. While decomposition-based evolutionary algorithms have good performance for multi-objective optimiza…

DiversityEvolutionary Algorithms