Medical image segmentation is a critical application of computer vision in the analysis of medical images. Its primary objective is to isolate regions of interest in medical images from the background, thereby assisting clinicians in accurately identifying lesions, their sizes, locations, and their relationships with surrounding tissues. However, compared to natural images, medical images present unique challenges, such as low resolution, poor contrast, inconsistency, and scattered target regions. Furthermore, the accuracy and stability of segmentation results are subject to more stringent requirements. In recent years, with the widespread application of Convolutional Neural Networks (CNNs) in computer vision, deep learning-based methods for medical image segmentation have become a focal point of research. This paper categorizes, reviews, and summarizes the current representative methods and research status in the field of medical image segmentation. A comparative analysis of relevant experiments is presented, along with an introduction to commonly used public datasets, performance evaluation metrics, and loss functions in medical image segmentation. Finally, potential future research directions and development trends in this field are predicted and analyzed.

With the continuous development of technology, blockchain has been widely used in various fields by virtue of its decentralization, data integrity, traceability, and anonymity. However, blockchain still faces many challenges, such as scalability and security issues. Artificial intelligence, with its powerful data processing capability, pattern recognition ability, and adaptive optimization algorithms, can improve the transaction processing efficiency of blockchain, enhance the security mechanism, and optimize the privacy protection strategy, thus effectively alleviating the limitations of blockchain in terms of scalability and security. Most of the existing related reviews explore the application of AI in blockchain as a whole but lack in-depth classification and discussion on how AI can empower the core aspects of blockchain. This paper explores the application of artificial intelligence technologies in addressing core challenges of blockchain systems, specifically in terms of scalability, security, and privacy protection. Instead of claiming a deep theoretical integration, we focus on how AI methods, such as machine learning and deep learning, have been effectively adopted to optimize blockchain consensus algorithms, improve smart contract vulnerability detection, and enhance privacy-preserving mechanisms like federated learning and differential privacy. Through comprehensive classification and discussion, this paper provides a structured overview of the current research landscape and identifies potential directions for further technical collaboration between AI and blockchain technologies.

With the rapid development of blockchain technology, consensus algorithms have become a significant research focus. Practical Byzantine Fault Tolerance (PBFT), as a widely used consensus mechanism in consortium blockchains, has undergone numerous enhancements in recent years. However, existing review studies primarily emphasize broad comparisons of different consensus algorithms and lack an in-depth exploration of PBFT optimization strategies. The lack of such a review makes it challenging for researchers and practitioners to identify the most effective optimizations for specific application scenarios. In this paper, we review the improvement schemes of PBFT from three key directions: communication complexity optimization, dynamic node management, and incentive mechanism integration. Specifically, we explore hierarchical networking, adaptive node selection, multi-leader view switching, and a hybrid consensus model incorporating staking and penalty mechanisms. Finally, this paper presents a comparative analysis of these optimization strategies, evaluates their applicability across various scenarios, and offers insights into future research directions for consensus algorithm design.

In recent years, rapid progress in autonomous driving has been achieved through advances in sensing, control, and earning. However, as the complexity of traffic scenarios increases, ensuring safe interaction among vehicles remains a formidable challenge. Recent works combining artificial potential fields (APFs) with game-theoretic methods have shown promise in modeling vehicle interactions and avoiding collisions. However, these approaches often suffer from overly conservative decisions or fail to capture the nonlinear dynamics of real-world driving. To address these imitations, we propose a novel framework that integrates mean field game (MFG) theory with model predictive control (MPC) and quadratic programming (QP). Our approach everages the aggregate behavior of surrounding vehicles to predict interactive effects and embeds these predictions into an MPC-QP scheme for real-time control. Simulation results in complex driving scenarios demonstrate that our method achieves multiple autonomous driving tasks while ensuring collision-free operation. Furthermore, the proposed framework outperforms popular game-based benchmarks in terms of achieving driving tasks and producing fewer collisions.

Robotic navigation in complex high-dimensional environments faces great challenges, especially in achieving efficient exploration, collision-free trajectory planning, and robust performance under dynamic conditions. Traditional optimization-based methods often suffer from limited adaptability, premature convergence, or insufficient obstacle handling. To address these challenges, we propose a novel hybrid path planning framework that integrates the Ant Colony Optimizer (ACO), the Whale Optimizer (WOA), the Artificial Potential Field (APF), and a random jump mechanism. This hybrid integration is characterized by the complementary global exploration, local optimization, and smooth trajectory generation, and is supported by a relativistic potential model and quantum-inspired mutation. Experimental results in various unstructured scenarios show that our method achieves significant performance improvements over six commonly used benchmarks including genetic algorithms (GA), genetically engineered word optimization (GWO), and quantum-inspired mutation (IRRT), with a 28.3% reduction in collision frequency and a 19.6% improvement in average path smoothness after preliminary simple quantification. In addition, our algorithm achieves the highest average navigation speed while maintaining the lowest variance, indicating that planning is consistent and efficient. These advantages make this method particularly suitable for practical robotics applications involving human passengers and dynamic obstacle environments.

In recent years, metaheuristic algorithms have garnered significant attention for their efficiency in solving complex optimization problems. However, their performance critically depends on maintaining a balance between global exploration and local exploitation; a deficiency in either can result in premature convergence to local optima or low convergence efficiency. To address this challenge, this paper proposes an enhanced ivy algorithm guided by a particle swarm optimization (PSO) mechanism, referred to as IVYPSO. This hybrid approach integrates PSO’s velocity update strategy for global searches with the ivy algorithm’s growth strategy for local exploitation and introduces an ivy-inspired variable to intensify random perturbations. These enhancements collectively improve the algorithm’s ability to escape local optima and enhance the search stability. Furthermore, IVYPSO adaptively selects between local growth and global diffusion strategies based on the fitness difference between the current solution and the global best, thereby improving the solution diversity and convergence accuracy. To assess the effectiveness of IVYPSO, comprehensive experiments were conducted on 26 standard benchmark functions and three real-world engineering optimization problems, with the performance compared against 11 state-of-the-art intelligent optimization algorithms. The results demonstrate that IVYPSO outperformed most competing algorithms on the majority of benchmark functions, exhibiting superior search capability and robustness. In the stability analysis, IVYPSO consistently achieved the global optimum across multiple runs on the three engineering cases with reduced computational time, attaining a 100% success rate (SR), which highlights its strong global optimization ability and excellent repeatability.