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.

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.

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.

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.

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 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.

Cooperative path planning for multi-AUV in time-varying ocean flows

For low-speed underwater vehicles, the ocean currents has a great influence on them, and the changes in ocean currents is complex and continuous, thus whose impact must be taken into consideration in the path planning. There are still lack of authoritative indicator and method for the cooperating path planning. The calculation of the voyage time is a difficult problem in the time-varying ocean, for the existing methods of the cooperating path planning, the computation time will increase exponentially as the autonomous underwater vehicle（AUV） counts increase, rendering them unfeasible. A collaborative path planning method is presehted for multi-AUV under the influence of time-varying ocean currents based on the dynamic programming algorithm. Each AUV cooperates with the one who has the longest estimated time of sailing, enabling the arrays of AUV to get their common goal in the shortest time with minimum timedifference. At the same time, they could avoid the obstacles along the way to the target. Simulation results show that the proposed method has a promising applicability.

Variable dimensional state space based global path planning for mobile robot

A variable dimensional state space（VDSS） has been proposed to improve the re-planning time when the robotic systems operate in large unknown environments.VDSS is constructed by uniforming lattice state space and grid state space.In VDSS,the lattice state space is only used to construct search space in the local area which is a small circle area near the robot,and grid state space elsewhere.We have tested VDSS with up to 80 indoor and outdoor maps in simulation and on segbot robot platform.Through the simulation and segbot robot experiments,it shows that exploring on VDSS is significantly faster than exploring on lattice state space by Anytime Dynamic A＊（AD＊） planner and VDSS is feasible to be used on robotic systems.

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.

A Distributed Cooperative Dynamic Task Planning Algorithm for Multiple Satellites Based on Multi-agent Hybrid Learning

Traditionally, heuristic re-planning algorithms are used to tackle the problem of dynamic task planning for multiple satellites. However, the traditional heuristic strategies depend on the concrete tasks, which often affect the result’s optimality. Noticing that the historical information of cooperative task planning will impact the latter planning results, we propose a hybrid learning algorithm for dynamic multi-satellite task planning, which is based on the multi-agent reinforcement learning of policy iteration and the transfer learning. The reinforcement learning strategy of each satellite is described with neural networks. The policy neural network individuals with the best topological structure and weights are found by applying co-evolutionary search iteratively. To avoid the failure of the historical learning caused by the randomly occurring observation requests, a novel approach is proposed to balance the quality and efficiency of the task planning, which converts the historical learning strategy to the current initial learning strategy by applying the transfer learning algorithm. The simulations and analysis show the feasibility and adaptability of the proposed approach especially for the situation with randomly occurring observation requests.

Real-time trajectory planning for UCAV air-to-surface attack using inverse dynamics optimization method and receding horizon control

This paper presents a computationally efficient real-time trajectory planning framework for typical unmanned combat aerial vehicle （UCAV） performing autonomous air-to-surface （A/S） attack. It combines the benefits of inverse dynamics optimization method and receding horizon optimal control technique. Firstly, the ground attack trajectory planning problem is mathematically formulated as a receding horizon optimal control problem （RHC-OCP）. In particular, an approximate elliptic launch acceptable region （LAR） model is proposed to model the critical weapon delivery constraints. Secondly, a planning algorithm based on inverse dynamics optimization, which has high computational efficiency and good convergence properties, is developed to solve the RHCOCP in real-time. Thirdly, in order to improve robustness and adaptivity in a dynamic and uncer- tain environment, a two-degree-of-freedom （2-DOF） receding horizon control architecture is introduced and a regular real-time update strategy is proposed as well, and the real-time feedback can be achieved and the not-converged situations can be handled. Finally, numerical simulations demon- strate the efficiency of this framework, and the results also show that the presented technique is well suited for real-time implementation in dynamic and uncertain environment.

Dynamic Trajectory Planning of Autonomous Lane Change at Medium and Low Speeds Based on Elastic Soft Constraint of the Safety Domain

Most current research on the trajectory planning of the autonomous lane change focuses on high-speed scenarios and assumes that the states of the surrounding vehicles keep stable during the lane change.The methods based on geometric-curve are mostly used for trajectory planning.In this paper,considering the inevitable development of the autonomous driving,the surrounding vehicles are assumed to be driven by human drivers,while the ego vehicles are able to autonomously change lanes.Representative local lane-change scenarios are then designed and analyzed in detail aiming at medium-and low-speed lane-change conditions.Additionally,in contrast with most research,dynamic trajectory planning which considers the possible state variations of the surrounding vehicles and the driver characteristics is studied and described by a fifth-order polynomial function.The safety and comfort of the dynamic trajectory planning are validated through simulation.Moreover,the elastic soft constraint of the safety domain is designed,whereby the sensitivity of the studied dynamic trajectory planning system is reduced under the premise of ensuring safety.The effectiveness of the elastic soft constraint in terms of improving comfort during the lane change is verified through simulation.The availability of the dynamic trajectory planning system with the elastic soft constraint is demonstrated with the addition of trajectory tracking based on model predictive control,showing its potential in practical applications.

Intelligent and Autonomous Flight Technology for Launch Vehicles

This paper proposes the architecture of an intelligent flight launcher system as well as fundamental solutions to capability prediction and dynamic planning. This effort reflects the latest progress in the applications of intelligent and autonomous technology for launcher flights. The paper first describes the characteristics and capabilities of intelligent and autonomous systems and classifies various related technologies. In the context of intelligent and autonomous technology in aerospace engineering, it then focuses on technical difficulties involved with intelligent flight and reviews developments in the field. An E^3 classification model of an intelligent flight launcher is then proposed and its application scenarios are discussed. Based on an intelligent flight system configuration of the launcher, the online trajectory planning and initial value guess are examined, and vertical landing is provided as an example to explain the effects of the implementation of computational intelligence to flight systems.

Mechanical Design and Dynamic Compliance Control of Lightweight Manipulator

In the existing modular joint design and control methods of collaborative robots, the inertia of the manipulator link is large,the dynamic trajectory planning ability is weak, the collision stop safety strategy is dependent, and the adaptability and safety to the changing environment are limited. This paper develops a six-degree-of-freedom lightweight collaborative manipulator with real-time dynamic trajectory planning and active compliance control. Firstly, a novel motor installation, joint transmission, and link design method is put forward to reduce the inertia of the links and improve intrinsic safety. At the same time, to enhance the dynamic operation capability and quick response of the manipulator, a smooth planning of position and orientation under initial/end pose and velocity constraints is proposed. The adaptability to the environment is improved by the active compliance control. Finally, experiments are carried out to verify the effectiveness of the proposed design, planning, and control methods.

Neuro-fuzzy and model-based motion control for mobile manipulator among dynamic obstacles

This paper focuses on autonomous motion control of a nonholonomic platform with a robotic arm, which is called mobile manipulator. It serves in transportation of loads in imperfectly known industrial environments with unknown dynamic obstacles. A union of both procedures is used to solve the general problems of collision-free motion. The problem of collision-free motion for mobile manipulators has been approached from two directions, Planning and Reactive Control. The dynamic path planning can be used to solve the problem of locomotion of mobile platform, and reactive approaches can be employed to solve the motion planning of the arm. The execution can generate the commands for the servo-systems of the robot so as to follow a given nominal trajectory while reacting in real-time to unexpected events. The execution can be designed as an Adaptive Fuzzy Neural Controller. In real world systems, sensor-based motion control becomes essential to deal with model uncertainties and unexpected obstacles.

Design and performance evaluation of a parking management system for automated, multi-story and robotic parking structure

Purpose–The purpose of this paper is to present design and performance evaluation through simulation of a parking management system(PMS)for a fully automated,multi-story,puzzle-type and robotic parking structure with the overall objective of minimizing customer wait times while maximizing the space utilization.Design/methodology/approach–The presentation entails development and integration of a complete suite of path planning,elevator scheduling and resource allocation algorithms.The PMS aims to manage multiple concurrent requests,in real time and in a dynamic context,for storage and retrieval of vehicles loaded onto robotic carts for a fully automated,multi-story and driving-free parking structure.The algorithm suite employs the incremental informed search algorithm D*Lite with domain-specific heuristics and the uninformed search algorithm Uniform Cost Search for path search and planning.An optimization methodology based on nested partitions and Genetic algorithm is adapted for scheduling of a group of elevators.The study considered a typical business day scenario in the center of a metropolis.Findings–The simulation study indicates that the proposed design for the PMS is able to serve concurrent storage-retrieval requests representing a wide range of Poisson distributed customer arrival rates in real time while requiring reasonable computing resources under realistic scenarios.The customer waiting times for both storage andretrievalrequestsare withinacceptable bounds,whichare set as nomore than 5min,evenin the presence of up to 100 concurrent storage and retrieval requests.The design is able to accommodate a variety of customer arrival rates and presence of immobilized vehicles which are assumed to be scattered across the floors of the structure to make it possible for deployment in real-time environments.Originality/value–The intelligent system design is novel as the fully automated robotic parking structures are just in the process of being matured from a technology standpoint.