Path Planning of UAV by Combing Improved Ant Colony System and Dynamic Window Algorithm

A fusion algorithm is proposed to enhance the search speed of an ant colony system(ACS)for the global path planning and overcome the challenges of the local path planning in an unmanned aerial vehicle(UAV).The ACS search efficiency is enhanced by adopting a 16-direction 24-neighborhood search way,a safety grid search way,and an elite hybrid strategy to accelerate global convergence.Quadratic planning is performed using the moving average(MA)method.The fusion algorithm incorporates a dynamic window approach(DWA)to deal with the local path planning,sets a retracement mechanism,and adjusts the evaluation function accordingly.Experimental results in two environments demonstrate that the improved ant colony system(IACS)achieves superior planning efficiency.Additionally,the optimized dynamic window approach(ODWA)demonstrates its ability to handle multiple dynamic situations.Overall,the fusion optimization algorithm can accomplish the mixed path planning effectively.

Efficient Route Planning for Real-Time Demand-Responsive Transit

Demand Responsive Transit (DRT) responds to the dynamic users’ requests without any fixed routes and timetablesand determines the stop and the start according to the demands. This study explores the optimization of dynamicvehicle scheduling and real-time route planning in urban public transportation systems, with a focus on busservices. It addresses the limitations of current shared mobility routing algorithms, which are primarily designedfor simpler, single origin/destination scenarios, and do not meet the complex demands of bus transit systems. Theresearch introduces an route planning algorithm designed to dynamically accommodate passenger travel needsand enable real-time route modifications. Unlike traditional methods, this algorithm leverages a queue-based,multi-objective heuristic A∗ approach, offering a solution to the inflexibility and limited coverage of suburbanbus routes. Also, this study conducts a comparative analysis of the proposed algorithm with solutions based onGenetic Algorithm (GA) and Ant Colony Optimization Algorithm (ACO), focusing on calculation time, routelength, passenger waiting time, boarding time, and detour rate. The findings demonstrate that the proposedalgorithmsignificantly enhances route planning speed, achieving an 80–100-fold increase in efficiency over existingmodels, thereby supporting the real-time demands of Demand-Responsive Transportation (DRT) systems. Thestudy concludes that this algorithm not only optimizes route planning in bus transit but also presents a scalablesolution for improving urban mobility.

Path Planning of Multi-Axis Robotic Arm Based on Improved RRT*

An improved RRT∗algorithm,referred to as the AGP-RRT∗algorithm,is proposed to address the problems of poor directionality,long generated paths,and slow convergence speed in multi-axis robotic arm path planning.First,an adaptive biased probabilistic sampling strategy is adopted to dynamically adjust the target deviation threshold and optimize the selection of random sampling points and the direction of generating new nodes in order to reduce the search space and improve the search efficiency.Second,a gravitationally adjustable step size strategy is used to guide the search process and dynamically adjust the step-size to accelerate the search speed of the algorithm.Finally,the planning path is processed by pruning,removing redundant points and path smoothing fitting using cubic B-spline curves to improve the flexibility of the robotic arm.Through the six-axis robotic arm path planning simulation experiments on the MATLAB platform,the results show that the AGP-RRT∗algorithm reduces 87.34%in terms of the average running time and 40.39%in terms of the average path cost;Meanwhile,under two sets of complex environments A and B,the average running time of the AGP-RRT∗algorithm is shortened by 94.56%vs.95.37%,and the average path cost is reduced by 55.28%vs.47.82%,which proves the effectiveness of the AGP-RRT∗algorithm in improving the efficiency of multi-axis robotic arm path planning.

Trajectory planning for multi-robot coordinated towing system based on stability

Given the unconstrained characteristics of the multi-robot coordinated towing system,the rope can only provide a unidirectional constraint force to the suspended object,which leads to the weak ability of the system to resist external disturbances and makes it difficult to control the trajectory of the suspended object.Based on the kinematics and statics of the multi-robot coordinated towing system with fixed base,the dynamic model of the system is established by using the Newton-Euler equations and the Udwadia-Kalaba equations.To plan the trajectories with high stability and strong control,trajectory planning is performed by combining the dynamics and stability of the towing system.Based on the dynamic stability of the motion trajectory of the suspended object,the stability of the suspended object is effectively improved through online real-time planning and offline manual adjustment.The effectiveness of the proposed method is verified by comparing the motion stability of the suspended object before and after planning.The results provide a foundation for the motion planning and coordinated control of the towing system.

Dynamic Scheduling and Path Planning of Automated Guided Vehicles in Automatic Container Terminal

The uninterrupted operation of the quay crane(QC)ensures that the large container ship can depart port within laytime,which effectively reduces the handling cost for the container terminal and ship owners.The QC waiting caused by automated guided vehicles(AGVs)delay in the uncertain environment can be alleviated by dynamic scheduling optimization.A dynamic scheduling process is introduced in this paper to solve the AGV scheduling and path planning problems,in which the scheduling scheme determines the starting and ending nodes of paths,and the choice of paths between nodes affects the scheduling of subsequent AGVs.This work proposes a two-stage mixed integer optimization model to minimize the transportation cost of AGVs under the constraint of laytime.A dynamic optimization algorithm,including the improved rule-based heuristic algorithm and the integration of the Dijkstra algorithm and the Q-Learning algorithm,is designed to solve the optimal AGV scheduling and path schemes.A new conflict avoidance strategy based on graph theory is also proposed to reduce the probability of path conflicts between AGVs.Numerical experiments are conducted to demonstrate the effectiveness of the proposed model and algorithm over existing methods.

Seam-tracking based on dynamic trajectory planning for a mobile welding robot

A new seam-tracking method based on dynamic trajectory planning for a mobile welding robot is proposed in order to improve the response lag of the mobile robot and the high frequency oscillation in seam-tracking.By using a front-placed laser-based vision sensor to dynamically extract the location of the weld seam in front of torch,the trend and direction of the weld line is roughly obtained.The robot system autonomously and dynamically performs trajectory planning based on the isometric approximation model.Arc sensor technology is applied to detect the offset during welding process in real time.The dynamic compensation of the weld path is done in combination with the control of the mobile robot and the executive body installed on it.Simulated and experimental results demonstrate that the method effectively increases the stability of welding speed and smoothness of the weld track,and hence the weld formation in curves and corners is improved.

Weighted Time-Based Global Hierarchical Path Planning in Dynamic Environment

A weighted time-based global hierarchical path planning method is proposed to obtain the global optimal path from the starting point to the destination with time optimal control. First, the grid-or graph-based modeling is performed and the environment is divided into a set of grids or nodes. Then two time-based features of time interval and time cost are presented. The time intervals for each grid are built, during each interval the condition of the grid remains stable, and a time cost of passing through the grid is defined and assigned to each interval. Furthermore, the weight is introduced for taking both time and distance into consideration, and thus a sequence of multiscale paths with total time cost can be achieved. Experimental results show that the proposed method can handle the complex dynamic environment, obtain the global time optimal path and has the potential to be applied to the autonomous robot navigation and traffic environment.

Genetic algorithm-fuzzy based dynamic motion planning approach for a mobile robot

Presents the mobile robots dynamic motion planning problem with a task to find an obstacle free route that requires minimum travel time from the start point to the destination point in a changing environment, due to the obstacle’s moving. An Genetic Algorithm fuzzy (GA Fuzzy) based optimal approach proposed to find any obstacle free path and the GA used to select the optimal one, points out that using this learned knowledge off line, a mobile robot can navigate to its goal point when it faces new scenario on line. Concludes with the optimal rule base given and the simulation results showing its effectiveness.

On-line real-time path planning of mobile robots in dynamic uncertain environment

A new path planning method for mobile robots in globally unknown environment with moving obstacles is pre- sented. With an autoregressive (AR) model to predict the future positions of moving obstacles, and the predicted position taken as the next position of moving obstacles, a motion path in dynamic uncertain environment is planned by means of an on-line real-time path planning technique based on polar coordinates in which the desirable direction angle is taken into consideration as an optimization index. The effectiveness, feasibility, high stability, perfect performance of obstacle avoidance, real-time and optimization capability are demonstrated by simulation examples.

HEURISTIC MODELING FOR A DYNAMIC AND GOAL PROGRAMMING IN PRODUCTION PLANNING OF CONTINUOUS MANUFACTURING SYSTEMS

At the first sight it seems that advanced operation research is not used enough in continuous production systems as comparison with mass production, batch production and job shop systems, but really in a comprehensive evaluation the advanced operation research techniques can be used in continuous production systems in developing countries very widely, because of initial inadequate plant layout, stage by stage development of production lines, the purchase of second hand machineries from various countries, plurality of customers. A case of production system planning is proposed for a chemical company in which the above mentioned conditions are almost presented. The goals and constraints in this issue are as follows： （1） Minimizing deviation of customer＇s requirements. （2） Maximizing the profit. （3） Minimizing the frequencies of changes in formula production. （4） Minimizing the inventory of final products. （5） Balancing the production sections with regard to rate in production. （6） Limitation in inventory of raw material. The present situation is in such a way that various techniques such as goal programming, linear programming and dynamic programming can be used. But dynamic production programming issues are divided into two categories, at first one with limitation in production capacity and another with unlimited production capacity. For the first category, a systematic and acceptable solution has not been presented yet. Therefore an innovative method is used to convert the dynamic situation to a zero- one model. At last this issue is changed to a goal programming model with non-linear limitations with the use of GRG algorithm and that＇s how it is solved.

DYNAMIC ADVANCED PLANNING AND SCHEDULING WITH FROZEN INTERVAL FOR NEW ORDERS

A dynamic advanced planning and scheduling （DAPS） problem is addressed where new orders arrive on a continuous basis. A periodic policy with frozen interval is adopted to increase stability on the shop floor. A genetic algorithm is developed to find a schedule at each rescheduling point for both original orders and new orders that both production idle time and penalties on tardiness and earliness of orders are minimized. The proposed methodology is tested on a small example to illustrate the effect of the frozen interval. The results indicate that the suggested approach can improve the schedule stability while retaining efficiency.

Dynamic path planning strategy based on improved RRT^(*)algorithm

In order to solve the problem of path planning of mobile robots in a dynamic environment,an improved rapidly-exploring random tree^(*)(RRT^(*))algorithm is proposed in this paper.First,the target bias sampling is introduced to reduce the randomness of the RRT^(*)algorithm,and then the initial path planning is carried out in a static environment.Secondly,apply the path in a dynamic environment,and use the initially planned path as the path cache.When a new obstacle appears in the path,the invalid path is clipped and the path is replanned.At this time,there is a certain probability to select the point in the path cache as the new node,so that the new path maintains the trend of the original path to a greater extent.Finally,MATLAB is used to carry out simulation experiments for the initial planning and replanning algorithms,respectively.More specifically,compared with the original RRT^(*)algorithm,the simulation results show that the number of nodes used by the new improved algorithm is reduced by 43.19%on average.

Research on the Collision-Free Path Planning of Multi-AGVs System Based on Improved A* Algorithm

Path planning problem is the core and hot research topic of multiple Automatic Guided Vehicles (multi-AGVs) system. Although there are many research results, they do not solve the path planning problem from the perspective of reducing traffic congestion. A collision-free path planning method based on improved A* Algorithm for multi-AGVs logistics sorting system is proposed in this paper. In the method, the environment of warehouse operation for AGVs is described by using grid method. The estimated cost of A* algorithm is improved by adding the penalty value of the paths that AGVs share with each other to alleviate traffic congestion and collision resolution rules are made according to different types of collisions. Then the collision-free path planning is done by combing the improved A* algorithm and collision resolution rules. The sorting efficiency of the method is compared with that of original A* algorithm. Simulation results show that the new collision-free path planning method can improve the sorting efficiency of multi-AGVs system and relieve traffic congestion.

Development of a Strategic Planning Model for a Municipal Water Supply Scheme Using System Dynamics

This paper reports the development of a system dynamics model for the strategic planning of a municipal water supply scheme. The model is capable of handling the critical variables that impact on the operations of a water supply scheme. The model was developed using the dynamo programming software to handle the process dynamics. Other supporting softwares—Fortran, Clipper 5, and Epiglue are used to handle data input, analysis and presentation of results in a user-friendly environment. The model was validated by applying it to the simulation of the University of Ibadan Water Supply Scheme for which extensive data of operations were collected over a period of ten years. The results obtained were found to be realistic and useful for the planning of plant operations. It is concluded that the model developed is sensitive to variable changes and has the capability of answering various operational “what-if” questions. As a strategic planning tool, the present model generates, for different scenarios, important operational information for the management of the water supply scheme. It is concluded that SD model is a useful tool to assist water managers and policy makers in making decisions and evolving strategic planning for water supply.

Cooperative Path Dynamic Planning Model of UCAV Team Based on Global Optimization Method

Cooperative path dynamic planning of a UCAV （unmanned combat air vehicle） team not only considers the capability of task requirement of single UCAV, but also considers the cooperative dynamic connection among members of the UCAV team. A cooperative path dynamic planning model of the UCAV team by applying a global optimization method is discussed in this paper and the corresponding model is built and analyzed. By the example simulation, the reasonable result acquired indicates that the model could meet dynamic planning demand under the circumstance of membership functions. The model is easy to be realized and has good practicability.

The collision-free trajectory planning for the space robot to capture a target based on the wavelet interpolation algorithm

In the research of path planning for manipulators with many DOF, generally there is a problem in most traditional methods, which is that their computational cost (time and memory space) increases exponentially as DOF or resolution of the discrete configuration space increases. So this paper presents the collision-free trajectory planning for the space robot to capture a target based on the wavelet interpolation algorithm. We made wavelet sample on the desired trajectory of the manipulator’s end-effector to do trajectory planning by use of the proposed wavelet interpolation formula, and then derived joint vectors from the trajectory information of the end-effector based on the fixed-attitude-restrained generalized Jacobian matrix of multi-arm coordinated motion, so as to control the manipulator to capture a static body along the desired collision-free trajectory. The method overcomes the shortcomings of the typical methods, and the desired trajectory of the end-effector can be any kind of complex nonlinear curve. The algorithm is simple and highly effective and the real trajectory is close to the desired trajectory. In simulation, the planar dual-arm three DOF space robot is used to demonstrate the proposed method, and it shows that the algorithm is feasible.

Dynamic Protection Planning and Industrial Upgrading of Shengjinta Historic Block in Nanchang City, Jiangxi Province

Starting with cultural context of historic block, this paper investigated current situation of Shengjinta Historic Block in Nanchang City, Jiangxi Province, proposed dynamic protection planning and sustainable industrial upgrading strategies, specifically, by repairing, clearing, preserving and restoring historic streets and lanes, courtyards and folk dwel ings from six perspectives of planar layout, traffic pattern, spatial texture, facade decoration, landscape planning, and characteristic culture. In view of the specifi c geographical location, food shops and leisure green spaces are constructed to build a modern urban living system for residents in the ancient block.

Interactive Heuristic D* Path Planning Solution Based on PSO for Two-Link Robotic Arm in Dynamic Environment

This paper is devoted to find an intelligent and safe path for two-link robotic arm in dynamic environment. This paper focuses on computational part of motion planning in completely changing dynamic environment at every motion sample domains,?since the local minima and sharp edges are the most common problems in all path planning algorithms. In addition, finding a path solution in a dynamic environment represents a challenge for the robotics researchers,?so in this paper, a proposed mixing approach was suggested to overcome all these obstructions. The proposed approach methodology?for obtaining robot interactive path planning solution in known dynamic environment utilizes?the use of modified heuristic D-star (D*) algorithm based on the full free Cartesian space analysis at each motion sample with the Particle Swarm Optimization (PSO) technique.?Also, a modification on the?D* algorithm has been done to match the dynamic environment requirements by adding stop and return backward cases which is not included in the original D* algorithm theory. The resultant interactive path solution was computed by taking into consideration the time and position changes of the moving obstacles. Furthermore, to insure the enhancement of the?final path length optimality, the PSO technique was used.?The simulation results are given to show the effectiveness of the proposed method.

Path Planning of Quadrotors in a Dynamic Environment Using a Multicriteria Multi-Verse Optimizer

Paths planning of Unmanned Aerial Vehicles(UAVs)in a dynamic environment is considered a challenging task in autonomous flight control design.In this work,an efficient method based on a Multi-Objective MultiVerse Optimization(MOMVO)algorithm is proposed and successfully applied to solve the path planning problem of quadrotors with moving obstacles.Such a path planning task is formulated as a multicriteria optimization problem under operational constraints.The proposed MOMVO-based planning approach aims to lead the drone to traverse the shortest path from the starting point and the target without collision with moving obstacles.The vehicle moves to the next position from its current one such that the line joining minimizes the total path length and allows aligning its direction towards the goal.To choose the best compromise solution among all the non-dominated Pareto ones obtained for compromise objectives,the modified Technique for Order Preference by Similarity to Ideal Solution(TOPSIS)is investigated.A set of homologous metaheuristics such as Multiobjective Salp Swarm Algorithm(MSSA),Multi-Objective Grey Wolf Optimizer(MOGWO),Multi-Objective Particle Swarm Optimization(MOPSO),and Non-Dominated Genetic Algorithm II(NSGAII)is used as a basis for the performance comparison.Demonstrative results and statistical analyses show the superiority and effectiveness of the proposed MOMVO-based planning method.The obtained results are satisfactory and encouraging for future practical implementation of the path planning strategy.

Study on Gait Planning of Dynamic Walking of Biped Robots Based on Optimization Theory

In this paper, two important problems in the gait planning of dynamic walking of biped robot, i.e., finding inverse kinematic solution and constructing joint trajectories, are studied in detail by adopting complex optimization theory. The optimization algorithm for finding the inverse kinematic solution is developed, the construction method of joint trajectories is given, and the gait planning method of dynamic walking of biped robots is proposed.