Search results

The purpose of this paper is to address two major challenges faced by robotic fish when operating in underwater environments: insufficient path planning capabilities and difficulties in avoiding dynamic obstacles. To achieve this, a method is proposed that combines the Improved Rapid Randomized Tree Star (IRRT*) with the dynamic window approach (DWA).

The RRT-connect algorithm is used to determine an initial feasible path quickly. The quality of sampling points is then improved by dividing the regions and selecting each region’s probability based on its fitness value. The fitness function and roulette wheel method are introduced for region selection. Subtarget points of the DWA algorithm are extracted from the IRRT* algorithm to achieve real-time dynamic path planning.

In various maps, the iteration count for the IRRT* algorithm decreased by 61%, 35% and 51% respectively, compared to the RRT* algorithm, whereas the iteration time was reduced by 75%, 34% and 57%, respectively. In addition, the IRRT*-DWA algorithm can successfully navigate through multiple dynamic obstacles, and the average time, path length, etc. do not change much when parameters change, and the stability is high.

A novel IRRT*-DWA algorithm is proposed, which, by refining the sampling strategy and updating sub-target points in real time, not only addresses the limitations of existing algorithms in terms of path planning efficiency in complex environments but also enhances their capability to avoid dynamic obstacles. Ultimately, experimental results indicate a high level of similarity between the actual and ideal paths.

Design a novel optimal integrated control algorithm for the automotive electric steering system to improve the stability and adaptation of the system.

Simulation and calculation.

The output signals follow the reference signal with high accuracy.

The optimal integrated algorithm is established based on the combination of PID and SMC. The parameters of the PID controller are adjusted using a fuzzy algorithm. The optimal range of adjustment values is determined using a genetic algorithm.

Currently, engineering project design lacks a design framework that fully combines subjective experience and objective data. This study develops an aided design decision-making framework to automatically output the optimal design alternative for engineering projects in a more efficient and objective mode, which synthesizes the design experience.

A database of design components is first constructed to facilitate the retrieval of data and the design alternative screening algorithm is proposed to automatically select all feasible design alternatives. Then back propagation (BP) neural network algorithm is introduced to predict the cost of all feasible design alternatives. Based on the gray relational degree-particle swarm optimization (GRD-PSO) algorithm, the optimal design alternative can be selected considering multiple objectives.

The case study shows that the BP neural network-cost prediction algorithm can well predict the cost of design alternatives, and the framework can be widely used at the design stage of most engineering projects. Design components with low sensitivity to design objectives have been obtained, allowing for the consideration of disregarding their impacts on design objectives in such situations requiring rapid decisions. Meanwhile, design components with high sensitivity to design objective weights have also been obtained, drawing special attention to the effects of changes in the importance of design objectives on the selection of these components. Simultaneously, the framework can be flexibly adjusted to different design objectives and identify key design components, providing decision reference for designers.

The framework proposed in this paper contributes to the knowledge of design decision-making by emphasizing the importance of combining objective data and subjective experience, whose significance is ignored in the existing literature.

Untimely responses to emergency situations in urban areas contribute to a rising mortality rate and impact society's primary capital. The efficient dispatch and relocation of ambulances pose operational and momentary challenges, necessitating an optimal policy based on the system's real-time status. While previous studies have addressed these concerns, limited attention has been given to the optimal allocation of technicians to respond to emergency situation and minimize overall system costs.

In this paper, a bi-objective mathematical model is proposed to maximize system coverage and enable flexible movement across bases for location, dispatch and relocation of ambulances. Ambulances relocation involves two key decisions: (1) allocating ambulances to bases after completing services and (2) deciding to change the current ambulance location among existing bases to potentially improve response times to future emergencies. The model also considers the varying capabilities of technicians for proper allocation in emergency situations.

The Augmented Epsilon-Constrained (AEC) method is employed to solve the proposed model for small-sized problem. Due to the NP-Hardness of the model, the NSGA-II and MOPSO metaheuristic algorithms are utilized to obtain efficient solutions for large-sized problems. The findings demonstrate the superiority of the MOPSO algorithm.

This study can be useful for emergency medical centers and healthcare companies in providing more effective responses to emergency situations by sending technicians and ambulances.

In this study, a two-objective mathematical model is developed for ambulance location and dispatch and solved by using the AEC method as well as the NSGA-II and MOPSO metaheuristic algorithms. The mathematical model encompasses three primary types of decision-making: (1) Allocating ambulances to bases after completing their service, (2) deciding to relocate the current ambulance among existing bases to potentially enhance response times to future emergencies and (3) considering the diverse abilities of technicians for accurate allocation to emergency situations.

Nature’s evolution has shaped intelligent behaviors in creatures like insects and birds, inspiring the field of Swarm Intelligence. Researchers have developed bio-inspired algorithms to address complex optimization problems efficiently. These algorithms strike a balance between computational efficiency and solution optimality, attracting significant attention across domains.

Bio-inspired optimization techniques for feature engineering and its applications are systematically reviewed with chief objective of assessing statistical influence and significance of “Bio-inspired optimization”-based computational models by referring to vast research literature published between year 2015 and 2022.

The Scopus and Web of Science databases were explored for review with focus on parameters such as country-wise publications, keyword occurrences and citations per year. Springer and IEEE emerge as the most creative publishers, with indicative prominent and superior journals, namely, PLoS ONE, Neural Computing and Applications, Lecture Notes in Computer Science and IEEE Transactions. The “National Natural Science Foundation” of China and the “Ministry of Electronics and Information Technology” of India lead in funding projects in this area. China, India and Germany stand out as leaders in publications related to bio-inspired algorithms for feature engineering research.

The review findings integrate various bio-inspired algorithm selection techniques over a diverse spectrum of optimization techniques. Anti colony optimization contributes to decentralized and cooperative search strategies, bee colony optimization (BCO) improves collaborative decision-making, particle swarm optimization leads to exploration-exploitation balance and bio-inspired algorithms offer a range of nature-inspired heuristics.

In order to improve the computation efficiency of the four-point rainflow algorithm, a new fast four-point rainflow cycle counting algorithm (FFRA) using a novel loop iteration mode is proposed.

In this new algorithm, the loop iteration mode is simplified by reducing the number of iterations, tests and deletions. The high efficiency of the new algorithm makes it a preferable candidate in fatigue life online estimation of structural health monitoring systems.

The extensive simulation results show that the extracted cycles by the new FFRA are the same as those by the four-point rainflow cycle counting algorithm (FRA) and the three-point rainflow cycle counting algorithm (TRA). Especially, the simulation results indicate that the computation efficiency of the FFRA has improved an average of 12.4 times compared to the FRA and an average of 8.9 times compared to the TRA. Moreover, the equivalence of cycle extraction results between the FFRA and the FRA is proved mathematically by utilizing some fundamental properties of the rainflow algorithm. Theoretical proof of the efficiency improvement of the FFRA in comparison to the FRA is also given.

This merit makes the FFRA preferable in online monitoring systems of structures where fatigue life estimation needs to be accomplished online based on massive measured data. It is noticeable that the high efficiency of the FFRA attributed to the simple loop iteration, which provides beneficial guidance to improve the efficiency of existing algorithms.

To present the detailed implementation processes of the IDEAL algorithm for two-dimensional compressible flows based on Delaunay triangular mesh, and compare the performance of the SIMPLE and IDEAL algorithms for solving compressible problems. What’s more, the implementation processes of Delaunay mesh generation and derivation of the pressure correction equation are also introduced.

Programming completely in C++.

Five compressible examples are used to test the SIMPLE and IDEAL algorithms, and the comparison with measurement data shows good agreement. The IDEAL algorithm has much better performance in both convergence rate and stability over the SIMPLE algorithm.

The detail solution procedure of implementing the IDEAL algorithm for compressible flows based on Delaunay triangular mesh is presented in this work, seemingly first in the literature.

Many practical control problems require achieving multiple objectives, and these objectives often conflict with each other. The existing multi-objective evolutionary reinforcement learning algorithms cannot achieve good search results when solving such problems. It is necessary to design a new multi-objective evolutionary reinforcement learning algorithm with a stronger searchability.

The multi-objective reinforcement learning algorithm proposed in this paper is based on the evolutionary computation framework. In each generation, this study uses the long-short-term selection method to select parent policies. The long-term selection is based on the improvement of policy along the predefined optimization direction in the previous generation. The short-term selection uses a prediction model to predict the optimization direction that may have the greatest improvement on overall population performance. In the evolutionary stage, the penalty-based nonlinear scalarization method is used to scalarize the multi-dimensional advantage functions, and the nonlinear multi-objective policy gradient is designed to optimize the parent policies along the predefined directions.

The penalty-based nonlinear scalarization method can force policies to improve along the predefined optimization directions. The long-short-term optimization method can alleviate the exploration-exploitation problem, enabling the algorithm to explore unknown regions while ensuring that potential policies are fully optimized. The combination of these designs can effectively improve the performance of the final population.

A multi-objective evolutionary reinforcement learning algorithm with stronger searchability has been proposed. This algorithm can find a Pareto policy set with better convergence, diversity and density.

Currently, massive multiple-input multiple-output (m-MIMO) antennas are typically designed using complex trial-and-error methods. The purpose of this study is to determine an effective optimization method to achieve more efficient antenna design processes.

This paper presents the design stages of a m-MIMO antenna array compatible with 5G smartphones operating in long term evolution (LTE) bands 42, 43 and 46, based on a specific algorithm. Each antenna element in the designed 10-port m-MIMO antenna array is intended to perfectly cover the three specified LTE bands. The optimization methods used for this purpose include the Nelder–Mead simplex algorithm, covariance matrix adaptation evolution strategy, particle swarm optimization and trust region framework (TRF).

Among the primary optimization algorithms, the TRF algorithm met the defined objectives most effectively. The achieved antenna efficiency values exceeded 60.81% in the low band and 68.39% in the high band, along with perfect coverage of the desired bands, demonstrating the success of the design with the TRF algorithm. In addition, the potential electromagnetic field exposure caused by the designed m-MIMO antenna array is elaborated upon in detail using computational human models through specific absorption rate analysis.

The comparison of four different algorithms (two local and two global) for use in the design of a 10-element m-MIMO antenna array with a complex structural configuration and the success of the design implemented with the selected algorithm distinguish this study from others.

The present paper aims to address challenges associated with path planning and obstacle avoidance in mobile robotics. It introduces a pioneering solution called the Bi-directional Adaptive Enhanced A* (BAEA*) algorithm, which uses a new bidirectional search strategy. This approach facilitates simultaneous exploration from both the starting and target nodes and improves the efficiency and effectiveness of the algorithm in navigation environments. By using the heuristic knowledge A*, the algorithm avoids unproductive blind exploration, helps to obtain more efficient data for identifying optimal solutions. The simulation results demonstrate the superior performance of the BAEA* algorithm in achieving rapid convergence towards an optimal action strategy compared to existing methods.

The paper adopts a careful design focusing on the development and evaluation of the BAEA* for mobile robot path planning, based on the reference [18]. The algorithm has remarkable adaptability to dynamically changing environments and ensures robust navigation in the context of environmental changes. Its scale further enhances its applicability in large and complex environments, which means it has flexibility for various practical applications. The rigorous evaluation of our proposed BAEA* algorithm with the Bidirectional adaptive A* (BAA*) algorithm [18] in five different environments demonstrates the superiority of the BAEA* algorithm. The BAEA* algorithm consistently outperforms BAA*, demonstrating its ability to plan shorter and more stable paths and achieve higher success rates in all environments.

The paper adopts a careful design focusing on the development and evaluation of the BAEA* for mobile robot path planning, based on the reference [18]. The algorithm has remarkable adaptability to dynamically changing environments and ensures robust navigation in the context of environmental changes. Its scale further enhances its applicability in large and complex environments, which means it has flexibility for various practical applications. The rigorous evaluation of our proposed BAEA* algorithm with the Bi-directional adaptive A* (BAA*) algorithm [18] in five different environments demonstrates the superiority of the BAEA* algorithm.

The rigorous evaluation of our proposed BAEA* algorithm with the BAA* algorithm [18] in five different environments demonstrates the superiority of the BAEA* algorithm. The BAEA* algorithm consistently outperforms BAA*, demonstrating its ability to plan shorter and more stable paths and achieve higher success rates in all environments.

The originality of this paper lies in the introduction of the bidirectional adaptive enhancing A* algorithm (BAEA*) as a novel solution for path planning for mobile robots. This algorithm is characterized by its unique characteristics that distinguish it from others in this field. First, BAEA* uses a unique bidirectional search strategy, allowing to explore the same path from both the initial node and the target node. This approach significantly improves efficiency by quickly converging to the best paths and using A* heuristic knowledge. In particular, the algorithm shows remarkable capabilities to quickly recognize shorter and more stable paths while ensuring higher success rates, which is an important feature for time-sensitive applications. In addition, BAEA* shows adaptability and robustness in dynamically changing environments, not only avoiding obstacles but also respecting various constraints, ensuring safe path selection. Its scale further increases its versatility by seamlessly applying it to extensive and complex environments, making it a versatile solution for a wide range of practical applications. The rigorous assessment against established algorithms such as BAA* consistently shows the superior performance of BAEA* in planning shorter paths, achieving higher success rates in different environments and cementing its importance in complex and challenging environments. This originality marks BAEA* as a pioneering contribution, increasing the efficiency, adaptability and applicability of mobile robot path planning methods.