Path Planning Strategy Research Articles

A new path planning strategy driven by geometric features and tensile properties for 3D printing of continuous fiber reinforced thermoplastic composites

Three-dimensional (3D) printing technology for continuous fiber reinforced thermoplastic composites (C-FRTP), capable of rapid manufacturing of lightweight components with intricate geometric features, has emerged as one of the most promising technologies in the field of advanced composite manufacturing. Path planning is a crucial step for determining the fabrication quality of C-FRTP components. This study proposed a new 3D printing path planning strategy driven by the geometric features and tensile properties of C-FRTP components. The strategy employed the properties of the Euler graph to generate the continuous full-field filling paths, ensuring the geometric features of the target components. The intersections were scattered along the printing path to enhance the tensile strength. The feasibility and advantages of the new path planning strategy were validated by comparative experiments with different printing paths. The results indicated that the new strategy not only achieved the geometric features of the target components but significantly enhanced their tensile strength. Using the printing path generated by the new path planning strategy, the tensile strength of specimens featuring mounting holes reached 349.4 MPa, which was only about 4.1 % lower than the tensile strength of continuous fibers at straight paths. Compared to the existing contour-parallel path, the new strategy in this work improved the tensile properties by about 40.9 %. The new path planning strategy proposed in this study shows great potential to design and fabricate C-FRTP components with enhanced mechanical properties for practical applications.

A combined strategy for path planning of tensegrity manipulators considering structural stability

Abstract A strategy combining an improved rapidly-exploring random tree (RRT) method with the artificial potential field (APF) method is proposed for the path planning of flexible tensegrity manipulators considering typical complex constraints, such as structural stability, obstacle avoidance, and cable no-slackening. The relationship between the node displacements and the elongations of active members is established for the kinematic analysis of tensegrity manipulators. The rest lengths of active members are taken as the design variables for the generation of random tree. The guide node is utilized for goal-biased samplings to expedite the exploration toward the final configuration, while the APF method is introduced to ensure that the obtained elongations of active members can satisfy the constraint of obstacle avoidance. The proportion of random and goal-biased samplings is adaptively adjusted based on the sampling success rate. Futile random samplings can be significantly reduced by dynamically modifying the random sampling range according to the obtained configuration nearest to the final configuration. The computational procedure of the proposed method is presented. An illustrative flexible tensegrity manipulator is employed to demonstrate the adaptability of the proposed path planning method to complex constraints, especially structural stability.

Hybrid Mobile Robot Path Planning Using Safe JBS-A*B Algorithm and Improved DWA Based on Monocular Camera

This paper addresses the formidable challenge of enabling autonomous navigation in Mobile Robots (MRs), focusing on the development of advanced path planning strategies. Despite their pivotal role in diverse applications, they face challenges in dynamic settings due to limitation in existing Global Path Planning (GPP) and Local Path Planning (LPP) techniques. In response to this, we propose an innovative hybrid path planning approach that enhances the A* algorithm with a risk-aware heuristic function and integrates the Jump Point Search (JPS) technique for route optimization. Additionally, B-spline smoothing is employed for perceptually global trajectory refinement. Our approach also includes an innovative improvement to the Dynamic Window Approach (DWA) to align with the proposed enhanced A* algorithm for effective local navigation. Acknowledging the importance of high-quality input in path planning, we present substantial improvements to the IRDC-Net, a monocular-image semantic-segmentation model that we studied previously. Novel improvements include the integration of quantization and the Adam optimizer, along with the implementation of the Balanced Cross-Entropy loss function. These enhancements not only elevate the output quality of IRDC-Net but also reduce the model’s training parameters. The experimental results demonstrate the performance and viability of the proposed algorithm. Ultimately, the hybrid MR’s path planning algorithm exhibits proficiency across various tasks, particularly in addressing the challenge of evading moving obstacles to ensure the robot’s safety while adhering to the global path.

State Analysis and Emergency Control of Planetary Rover with Faulty Drive Wheel

Wheel failure is one of the worst problems for a planetary rover working on Mars or the Moon, which may lead to the interruption of the exploration mission and even the loss of mobility. In this study, a driving test of a planetary rover prototype with a faulty drive wheel was conducted, and state analysis and dynamics modeling were carried out. The drag motion relationship between the faulty drive wheel and the normal wheels on the same suspension was established based on the targeted single wheel test (faulty wheel-soil bin). In order to maintain the subsequent basic detection capability of the planetary rover, an emergency control system is proposed that integrates the path planning strategy with faulty wheel priority and the motion control method of correcting heading and coordinating allocation. The experimental results and emergency strategies of this study on simulating Martian soil and terrain can provide researchers with ideas to solve such problems.

Joint Approach for Vehicle Routing Problems Based on Genetic Algorithm and Graph Convolutional Network

The logistics demands of industries represented by e-commerce have experienced explosive growth in recent years. Vehicle path-planning plays a crucial role in optimization systems for logistics and distribution. A path-planning scheme suitable for an actual scenario is the key to reducing costs and improving service efficiency in logistics industries. In complex application scenarios, however, it is difficult for conventional heuristic algorithms to ensure the quality of solutions for vehicle routing problems. This study proposes a joint approach based on the genetic algorithm and graph convolutional network for solving the capacitated vehicle routing problem with multiple distribution centers. First, we use the heuristic method to modularize the complex environment and encode each module based on the constraint conditions. Next, the graph convolutional network is adopted for feature embedding for the graph representation of the vehicle routing problem, and multiple decoders are used to increase the diversity of the solution space. Meanwhile, the REINFORCE algorithm with a baseline is employed to train the model, ensuring quick returns of high-quality solutions. Moreover, the fitness function is calculated based on the solution to each module, and the genetic algorithm is employed to seek the optimal solution on a global scale. Finally, the effectiveness of the proposed framework is validated through experiments at different scales and comparisons with other algorithms. The experimental results show that, compared to the single decoder GCN-based solving method, the method proposed in this paper improves the solving success rate to 100% across 15 generated instances. The average path length obtained is only 11% of the optimal solution produced by the GCN-based multi-decoder method.

Research on AGV Path Planning Based on Improved Directed Weighted Graph Theory and ROS Fusion

This article addresses the common issues of insufficient computing power and path congestion for automated guided vehicles (AGVs) in real-world production environments, as well as the shortcomings of traditional path-planning algorithms that mainly consider the shortest path while ignoring vehicle turning time and stability. We propose a secondary path-planning method based on an improved directed weighted graph theory integrated with an ROS. Firstly, the production environment is modeled in detail to identify the initial position of the AGV. Secondly, the operational area is systematically divided, key nodes are selected and optimized, and a directed weighted graph is constructed with optimized weights. It is integrated with the ROS for path planning, using the Floyd algorithm to find the optimal path. The effectiveness and superiority of this method have been demonstrated through simulation verification and actual AGV operation testing. The path planning strategy and fusion algorithm proposed in this article that comprehensively considers distance and angle steering are simple and practical, effectively reducing production costs for enterprises. This method is suitable for logistics sorting and small transport AGVs with a shorter overall path-planning time, higher stability, and limited computing power, and it has reference significance and practical value.

A hybrid formation path planning based on the velocity-virtual spring method in dynamic environments

Purpose The purpose of this study is to propose a path-planning strategy based on the velocity-virtual spring method to realize collision-free tasks in dynamic environments and further improve the effect. Design/methodology/approach By considering factors such as the relative velocity and direction of dynamic obstacles, the repulsive force of the robot is improved, thereby enhancing the adaptability of the strategy and achieving flexible and effective avoidance against dynamic obstacles. The attraction formula has been designed to allow the robot to have better smooth changes and higher gradients near the target, helping robots better reach the target and follow formations. Moreover, to meet the demands of the various stages during the driving process, the null space behavioral control is used to solve multi-task conflict problems and strengthen formation coordination and control. Findings Comparison of the planning path and formation effects through simulation and physical experiments, the results of this study show that the algorithm proposed can successfully maintain formation stability and plan smooth and safe paths in static or dynamic environments. Originality/value This paper proposes a path-planning strategy based on the velocity-virtual spring method to plan collision-free paths for formation in dynamic environments.

Path Planning Method and Control of Mobile Robot with Uncertain Dynamics Based on Improved Artificial Potential Field and Its Application in Health Monitoring

To enhance the navigation and control efficiency of mobile robots in the field of health monitoring, a novel path planning and control strategy for mobile robots with uncertain dynamics based on improved artificial potential fields is proposed in this paper. Specifically, we propose an attractive potential field rotation method to overcome the limitation that traditional artificial potential fields tend to fall into local minima. Then, we define a new class of attractive potential fields to address the goals non-reachable with obstacles nearby (GNRON) and collisions caused by excessive attractive force at long distances from the target point. Furthermore, a control law is proposed for the mobile robot with uncertain dynamics, and the stability of the closed-loop system is rigorously proven using the Lyapunov method. Finally, the feasibility and effectiveness of the proposed method are verified by simulations and experiments.

Path planning of manure-robot cleaners using grid-based reinforcement learning

The use of a robot cleaner for manure removal improves housing conditions for dairy cows in the face of labor shortages. However, current robot cleaners follow programmed fixed routes without considering the dynamic behaviors of cows. This cleaning approach is less efficient and leads to more cow-robot encounters or collisions, thus affecting animal welfare. To address these issues, this paper (1) developed heatmap models for cow locations and defecation behaviors; (2) proposed a dynamic path planning approach for the manure robot cleaner using Grid-based Reinforcement Learning; (3) incorporated cow location information and defecation behavior into the path planning process; (4) compared the performance of the proposed approach with two different cleaning methods: the current fixed programmed cleaning in practice and the ideal path produced by simulated annealing for traveling salesman problem. The simulations mimic the situation in a barn at Dairy Campus of Wageningen Livestock Research located in Leeuwarden (the Netherlands). Obviously, the best performance was achieved when the route was executed without cows present, resulting in no cow-robot collision. However, with cows present, the proposed dynamic path planning strategy achieved a 67.6% reduction in cow-robot encounters while maintaining 85.4% of the cleaning performance compared to the current programmed fixed routes. Compared to the ideal path produced by simulated annealing for traveling salesman problem, the proposed dynamic path planning approach achieved 5% better cleaning performance, at the cost of 25% more cow-robot encounters due to its longer working path. We conclude the proposed grid-based Reinforcement Learning solution for manure robots in barns cleaned most efficient with the least interference with cow traffic.

Enhancing safety feedback to the design of small, unmanned aircraft by joint assessment of impact area and human fatality.

Advantages of commercial UAS-based services come with the disadvantage of posing third party risk (TPR) to overflown population on the ground. Especially challenging is that the imposed level of ground TPR tends to increase linearly with the density of potential customers of UAS services. This challenge asks for the development of complementary directions in reducing ground TPR. The first direction is to reduce the rate of a UAS crash to the ground. The second direction is to reduce overflying in more densely populated areas by developing risk-aware UAS path planning strategies. The third direction is to develop UAS designs that reduce the product in case of a crashing UAS, where is the size of the crash impact area on the ground, and is the probability of fatality for a person in the crash impact area. Because small UAS accident and incident data are scarce, each of these three developments is in need of predictive models regarding their contribution to ground TPR. Such models have been well developed for UAS crash event rate and risk-aware UAS path planning. The objective of this article is to develop an improved model and assessment method for the product In literature, the model development and assessment of the latter two terms is accomplished along separate routes. The objective of this article is to develop an integrated approach. The first step is the development of an integrated model for the product . The second step is to show that this integrated model can be assessed by conducting dynamical simulations of Finite Element (FE) or Multi-Body System (MBS) models of collision between a UAS and a human body. Application of this novel method is illustrated and compared to existing methods for a DJI Phantom III UAS crashing to the ground.

Large area kidney imaging for pre-transplant evaluation using real-time robotic optical coherence tomography

Optical coherence tomography (OCT) can be used to image microstructures of human kidneys. However, current OCT probes exhibit inadequate field-of-view, leading to potentially biased kidney assessment. Here we present a robotic OCT system where the probe is integrated to a robot manipulator, enabling wider area (covers an area of 106.39 mm by 37.70 mm) spatially-resolved imaging. Our system comprehensively scans the kidney surface at the optimal altitude with preoperative path planning and OCT image-based feedback control scheme. It further parameterizes and visualizes microstructures of large area. We verified the system positioning accuracy on a phantom as 0.0762 ± 0.0727 mm and showed the clinical feasibility by scanning ex vivo kidneys. The parameterization reveals vasculatures beneath the kidney surface. Quantification on the proximal convoluted tubule of a human kidney yields clinical-relevant information. The system promises to assess kidney viability for transplantation after collecting a vast amount of whole-organ parameterization and patient outcomes data.

Evaluation of metaheuristic optimization algorithms applied to path planning

The development of autonomous ground vehicles is a topic widely discussed by the international scientific community. Path planning for these robots is an essential element to achieving a satisfactory fulfillment of missions without human intervention. This work adopts and improves the metaheuristic optimization methods harmony search and ant colony optimization, developing strategies based on the enhanced harmony search and improved ant colony optimization to achieve short, collision-free paths for robot movement. A description of the original methods and improvement procedures is presented, and their performance in path planning is compared through simulation. Theoretical results are supported by simulated experiments, which highlight the situations in which each metaheuristic algorithm is preferable and the benefits they bring to the path planning strategy.

Investigating the effect of path planning strategies on 3D metallic structure deposited using robotic WAAM

Wire Arc Additive Manufacturing (WAAM) is an advanced technique for producing medium-to-large-sized components, offering high deposition rates and low equipment costs. Path planning strategies are critical in determining grain growth direction and achieving isotropic properties in the components. This study introduces a novel path planning strategy, the switchback mode, to mitigate unidirectional grain growth and enhance the mechanical properties of WAAM-deposited components. ER-4043 aluminium alloy walls were deposited using the switchback mode and compared with the conventional bi-directional path planning strategy. The findings reveal that different path planning strategies result in variations in layer size, surface morphology, microstructure, residual stress, microhardness, wear resistance, and tensile properties. Notably, the switchback mode demonstrated superior mechanical strength compared to the bi-directional mode, with yield strength (YS) increasing from 90.2 MPa to 113.9 MPa, ultimate tensile strength (UTS) from 148.8 MPa to 178.7 MPa, and elongation percentages from 18.4 % to 21.3 %. Furthermore, the residual stress changed from tensile to compressive when switching from bi-directional to switchback mode.

Software Based Designing System for Laser Cutting Machine(CNC) : Revolutionizing Material Utilization and Increasing Efficiency

Laser cutting is a highly accurate and adaptable method frequently employed in manufacturing to cut various materials, especially sheet metal. Nonetheless, challenges such as optimizing material use and enhancing cutting efficiency are significant concerns. This paper introduces a new splitting technique aimed at tackling these by reducing the amount of sheet material needed and improving cutting efficiency. The method consists of carefully dividing intricate cutting designs into smaller, more manageable parts, which can be rearranged to decrease waste and lower overall material consumption. This approach utilizes advanced algorithms to optimize the arrangement of these parts on the material sheet, maximizing material utilization. Moreover, the method integrates an efficient path planning strategy that reduces the laser head's travel distance, thus minimizing cutting time and energy use. Experimental findings indicate that this splitting technique substantially cuts down on material waste while boosting cutting speed, presenting a viable solution for industries seeking to improve productivity and sustainability in their laser cutting processes. KEYWORDS: Laser Cutting; Optimizing material; Cutting Efficiency; Material Consumption; Utilization; productivity; sustainability.

Obstacle Avoidance Path Planning Strategy for Autonomous Vehicles Based on Genetic Algorithm

In order to enhance the driving ability of autonomous vehicles on structured roads and enable them to plan safe and comfortable paths, we propose an obstacle avoidance path strategy for autonomous vehicles based on genetic algorithm. The use of Frenet-Serret enhances the adaptability of the algorithm in complex environments. In order to improve the generation and optimisation of obstacle avoidance trajectory, we establish an anti-collision model. When the vehicle faces a potential collision with an obstacle, the genetic algorithm quickly iterates and selects the first nine genes to generate the rough solution and convex space of the path. Combined with convex space, the quadratic programming method will numerically optimise the generated rough solution to generate an accurate path that satisfies the constraints. In addition, in order to ensure the safety and comfort in the process of obstacle avoidance, based on the dynamic constraints of the vehicle, the speed planning is used to determine the speed curve. We simulate in various scenarios involving moving obstacles. The real-time simulation based on the HIL platform proves that the proposed path planning strategy is effective in various driving scenarios.

Multi-UAV path planning using DMGWO ensuring 4D collision avoidance and simultaneous arrival

PurposeMulti-unmanned aerial vehicle (UAV) systems have succeeded in gaining the attention of researchers in diversified fields, especially in the past decade, owing to their capability to operate in complex scenarios in a coordinated manner. Path planning for UAV swarms is a challenging task depending upon the environmental conditions, the limitations of fixed-wing UAVs and the swarm constraints. Multiple optimization techniques have been studied for path-planning problems. However, there are local optimum and convergence rate problems. This study aims to propose a multi-UAV cooperative path planning (CoPP) scheme with four-dimensional collision avoidance and simultaneous arrival time.Design/methodology/approachA new two-step optimization algorithm is developed based on multiple populations (MP) of disturbance-based modified grey-wolf optimizer (DMGWO). The optimization is performed based on the objective function subject to multi constraints, including collision avoidance, same minimum time of flight and threat and obstacle avoidance in the terrain while meeting the UAV constraints. Comparative simulations using two different algorithms are performed to authenticate the proposed DMGWO.FindingsThe critical features of the proposed MP-DMGWO-based CoPP algorithm are local optimum avoidance and rapid convergence of the solution, i.e. fewer iterations as compared to the comparative algorithms. The efficiency of the proposed method is evident from the comparative simulation results.Originality/valueA new algorithm DMGWO is proposed for the CoPP problem of UAV swarm. The local best position of each wolf is used in addition to GWO. Besides, a disturbance is introduced in the best solutions for faster convergence and local optimum avoidance. The path optimization is performed based on a newly designed objective function that depends upon multiple constraints.

Multi-Agent Collaborative Path Planning Algorithm with Multiple Meeting Points

Traditional multi-agent path planning algorithms often lead to path overlap and excessive energy consumption when dealing with cooperative tasks due to the single-agent-single-task configuration. For this reason, the “many-to-one” cooperative planning method has been proposed, which, although improved, still faces challenges in the vast search space for meeting points and unreasonable task handover locations. This paper proposes the Cooperative Dynamic Priority Safe Interval Path Planning with a multi-meeting-point and single-meeting-point solving mode switching (Co-DPSIPPms) algorithm to achieve multi-agent path planning with task handovers at multiple or single meeting points. First, the initial priority is set based on the positional relationships among agents within the cooperative group, and the improved Fermat point method is used to locate multiple meeting points quickly. Second, considering that agents must pick up sub-tasks or conduct task handovers midway, a segmented path planning strategy is proposed to ensure that cooperative agents can efficiently and accurately complete task handovers. Finally, an automatic switching strategy between multi-meeting-point and single-meeting-point solving modes is designed to ensure the algorithm’s success rate. Tests show that Co-DPSIPPms outperforms existing algorithms in 1-to-1 and m-to-1 cooperative tasks, demonstrating its efficiency and practicality.

3D Composite Bioprinting for Fabrication of Artificial Biological Tissues.

Three-dimensional (3D) bioprinting is an important technology for fabricating artificial tissue. To effectively reconstruct the multiscale structure and multi-material gradient of natural tissues and organs, 3D bioprinting has been increasingly developed into multi-process composite mode. The current 3D composite bioprinting is a combination of two or more printing processes, and oftentimes, physical field regulation that can regulate filaments or cells during or after printing may be involved. Correspondingly, both path planning strategy and process control all become more complex. Hence, the computer-aided design and computer-aided manufacturing (CAD/CAM) system that is traditionally used in 3D printing system is now facing challenges. Thus, the scale information that cannot be modeled in the CAD process should be considered in the design of CAM by adding a process management module in the traditional CAD/CAM system and add more information reflecting component gradient in the path planning strategy.

An Integrated Route and Path Planning Strategy for Skid–Steer Mobile Robots in Assisted Harvesting Tasks with Terrain Traversability Constraints

This article presents a combined route and path planning strategy to guide Skid–Steer Mobile Robots (SSMRs) in scheduled harvest tasks within expansive crop rows with complex terrain conditions. The proposed strategy integrates: (i) a global planning algorithm based on the Traveling Salesman Problem under the Capacitated Vehicle Routing approach and Optimization Routing (OR-tools from Google) to prioritize harvesting positions by minimum path length, unexplored harvest points, and vehicle payload capacity; and (ii) a local planning strategy using Informed Rapidly-exploring Random Tree (IRRT*) to coordinate scheduled harvesting points while avoiding low-traction terrain obstacles. The global approach generates an ordered queue of harvesting locations, maximizing the crop yield in a workspace map. In the second stage, the IRRT* planner avoids potential obstacles, including farm layout and slippery terrain. The path planning scheme incorporates a traversability model and a motion model of SSMRs to meet kinematic constraints. Experimental results in a generic fruit orchard demonstrate the effectiveness of the proposed strategy. In particular, the IRRT* algorithm outperformed RRT and RRT* with 96.1% and 97.6% smoother paths, respectively. The IRRT* also showed improved navigation efficiency, avoiding obstacles and slippage zones, making it suitable for precision agriculture.

Ship Autonomous Berthing Strategy Based on Improved Linear-Quadratic Regulator

There has been significant interest in the research field of ship automatic navigation, particularly in the area of autonomous berthing. To address the key challenges of path planning and control during ship berthing, we propose an enhanced Linear−Quadratic Regulator (LQR) control approach, reinforced by the Covariance Matrix Adaptation Evolution Strategy (CMA−ES), along with an adaptive berthing strategy decision model. This integrated framework encompasses ship motion control, path planning, and berthing strategy selection to facilitate adaptive and autonomous ship berthing. Initially, a dynamic mathematical model of ship motion is established, taking into account wind and current interference effects. Subsequently, an adaptive environment−aware berthing strategy model is introduced to enable automatic selection of berthing strategies based on spatial relationships between environmental factors and the berth. By utilizing the refined LQR method, autonomous motion control for ship berthing is achieved. To validate the effectiveness of our controller, comprehensive simulation analyses are conducted under varying operating conditions to encompass crucial factors such as large drift angle characteristics of ships, shallow water effects, and bank effects across seven diverse working conditions. The simulation results underscore the robustness of our proposed method in responding to environmental interference while demonstrating its capability to select appropriate berthing strategies based on varying operational scenarios.