Cooperative Sampling Path Planning of Underwater Glider Fleet with Simultaneous Launch and Recovery

As low-cost and highly autonomous ocean observation platforms,underwater gliders encounter risks during their launch and recovery,especially when coordinating multi-glider deployments.This work focuses on cooperative path planning of an underwater glider fleet with simultaneous launch and recovery to enhance the autonomy of sampling and reduce deployment risks.Specifically,the gliders collaborate to achieve sampling considering the specified routines of interest.The overall paths to be planned are divided into four rectangular parts with the same starting point,and each glider is assigned a local sampling route.A clipped-oriented line-of-sight algorithm is proposed to ensure the coverage of the desired edges.The pitch angle of the glider is selected as the optimizing parameter to coordinate the overall progress considering the susceptibility of gliders to currents and the randomness of paths produced by complex navigational strategies.Therefore,a multi-actuation deep-Q network algorithm is proposed to ensure simultaneous launch and recovery.Simulation results demonstrate the acceptable effectiveness of the proposed method.

Complex task planning method of space-aeronautics cooperative observation based on multi-layer interaction

With the new development trend of multi-resource coordinated Earth observation and the new goal of Earth observation application of“short response time,high observation accuracy,and wide coverage”,space-aeronautics cooperative complex task planning problem has become an urgent problem to be solved.The focus of this problem is to use multiple resources to perform collaborative observations on complex tasks.By analyzing the process from task assignment to receiving task observation results,we propose a multi-layer interactive task planning framework which is composed of a preprocessing method for complex tasks,a task allocation layer,a task planning layer,and a task coordination layer.According to the characteristics of the framework,a hybrid genetic parallel tabu(HGPT)algorithm is proposed on this basis.The algorithm uses genetic annealing algorithm(GAA),parallel tabu(PT)algorithm,and heuristic rules to achieve task allocation,task planning,and task coordination.At the same time,coding improvements,operator design,annealing operations,and parallel calculations are added to the algorithm.In order to verify the effectiveness of the algorithm,simulation experiments under complex task scenarios of different scales are carried out.Experimental results show that this method can effectively solve the problems of observing complex tasks.Meanwhile,the optimization effect and convergence speed of the HGPT is better than that of the related algorithms.

Cooperative UAV search strategy based on DMPC-AACO algorithm in restricted communication scenarios

Improvement of integrated battlefield situational awareness in complex environments involving dynamic factors such as restricted communications and electromagnetic interference(EMI)has become a contentious research problem.In certain mission environments,due to the impact of many interference sources on real-time communication or mission requirements such as the need to implement communication regulations,the mission stages are represented as a dynamic combination of several communication-available and communication-unavailable stages.Furthermore,the data interaction between unmanned aerial vehicles(UAVs)can only be performed in specific communication-available stages.Traditional cooperative search algorithms cannot handle such situations well.To solve this problem,this study constructed a distributed model predictive control(DMPC)architecture for a collaborative control of UAVs and used the Voronoi diagram generation method to re-plan the search areas of all UAVs in real time to avoid repetition of search areas and UAV collisions while improving the search efficiency and safety factor.An attention mechanism ant-colony optimization(AACO)algorithm is proposed for UAV search-control decision planning.The search strategy is adaptively updated by introducing an attention mechanism for regular instruction information,a priori information,and emergent information of the mission to satisfy different search expectations to the maximum extent.Simulation results show that the proposed algorithm achieves better search performance than traditional algorithms in restricted communication constraint scenarios.

Optimal search path planning of UUV in battlefeld ambush scene

Aiming at the practical application of Unmanned Underwater Vehicle(UUV)in underwater combat,this paper proposes a battlefield ambush scene with UUV considering ocean current.Firstly,by establishing these mathematical models of ocean current environment,target movement,and sonar detection,the probability calculation methods of single UUV searching target and multiple UUV cooperatively searching target are given respectively.Then,based on the Hybrid Quantum-behaved Particle Swarm Optimization(HQPSO)algorithm,the path with the highest target search probability is found.Finally,through simulation calculations,the influence of different UUV parameters and target parameters on the target search probability is analyzed,and the minimum number of UUVs that need to be deployed to complete the ambush task is demonstrated,and the optimal search path scheme is obtained.The method proposed in this paper provides a theoretical basis for the practical application of UUV in the future combat.

Distributed collaborative complete coverage path planning based on hybrid strategy

Collaborative coverage path planning(CCPP) refers to obtaining the shortest paths passing over all places except obstacles in a certain area or space. A multi-unmanned aerial vehicle(UAV) collaborative CCPP algorithm is proposed for the urban rescue search or military search in outdoor environment.Due to flexible control of small UAVs, it can be considered that all UAVs fly at the same altitude, that is, they perform search tasks on a two-dimensional plane. Based on the agents’ motion characteristics and environmental information, a mathematical model of CCPP problem is established. The minimum time for UAVs to complete the CCPP is the objective function, and complete coverage constraint, no-fly constraint, collision avoidance constraint, and communication constraint are considered. Four motion strategies and two communication strategies are designed. Then a distributed CCPP algorithm is designed based on hybrid strategies. Simulation results compared with patternbased genetic algorithm(PBGA) and random search method show that the proposed method has stronger real-time performance and better scalability and can complete the complete CCPP task more efficiently and stably.

Neural Dynamics for Cooperative Motion Control of Omnidirectional Mobile Manipulators in the Presence of Noises: A Distributed Approach

This paper presents a distributed scheme with limited communications, aiming to achieve cooperative motion control for multiple omnidirectional mobile manipulators(MOMMs).The proposed scheme extends the existing single-agent motion control to cater to scenarios involving the cooperative operation of MOMMs. Specifically, squeeze-free cooperative load transportation is achieved for the end-effectors of MOMMs by incorporating cooperative repetitive motion planning(CRMP), while guiding each individual to desired poses. Then, the distributed scheme is formulated as a time-varying quadratic programming(QP) and solved online utilizing a noise-tolerant zeroing neural network(NTZNN). Theoretical analysis shows that the NTZNN model converges globally to the optimal solution of QP in the presence of noise. Finally, the effectiveness of the control design is demonstrated by numerical simulations and physical platform experiments.

Cooperative co-evolution based distributed path planning of multiple mobile robots

This paper proposes novel multiple-mobile-robot collision avoidance path planning based on cooperative co-evolution,which can be executed fully distributed and in parallel. A real valued co-evolutionary algorithm is developed to coordinate the movement of multiple robots in 2D world, avoiding C-space or grid net searching. The collision avoidance is achieved by cooperatively co-evolving segments of paths and the time interval to pass them. Methods for constraint handling, which are developed for evolutionary algorithm, make the path planning easier. The effectiveness of the algorithm is demonstrated on a number of 2Dpath planning problems.

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.

MOTION PLANNING OF MULTIPLE MOBILE ROBOTS COOPERATIVELY TRANSPORTING A COMMON OBJECT

Many applications above the capability of a single robot need the cooperation of multiple mobile robots, but effective cooperation is hard to achieve. In this paper, a master slave method is proposed to control the motions of multiple mobile robots that cooperatively transport a common object from a start point to a goal point. A noholonomic kinematic model to constrain the motions of multiple mobile robots is built in order to achieve cooperative motions of them, and a “Dynamic Coordinator” strategy is used to deal with the collision avoidance of the master robot and slave robot individually. Simulation results show the robustness and effectiveness of the method.

Study on DSM-based task planning of product cooperative development

The results of analyzing the managerial characteristics and complexity of product cooperative development suggest that task planning is an important aspect for process management of product cooperative development and the method for planning tasks should be able to model the dependency between tasks and iterations during the development process. In this paper, a DSM-based method and its corresponding optimization algorithms are developed. At first the coupled task sets and uncoupled task sets are identified, and the tasks are then optimized by the corresponding algorithms. The optimal tasks plan will reduce the development time and cost. Considering the practical requirements in real world, a Multilayer DSM is proposed, and its information communication techniques between DSM and traversing principle are described in details.

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.

A review of mobile robot motion planning methods:from classical motion planning workflows to reinforcement learning-based architectures

Motion planning is critical to realize the autonomous operation of mobile robots.As the complexity and randomness of robot application scenarios increase,the planning capability of the classical hierarchical motion planners is challenged.With the development of machine learning,the deep reinforcement learning(DRL)-based motion planner has gradually become a research hotspot due to its several advantageous feature.The DRL-based motion planner is model-free and does not rely on the prior structured map.Most importantly,the DRL-based motion planner achieves the unification of the global planner and the local planner.In this paper,we provide a systematic review of various motion planning methods.Firstly,we summarize the representative and state-of-the-art works for each submodule of the classical motion planning architecture and analyze their performance features.Then,we concentrate on summarizing reinforcement learning(RL)-based motion planning approaches,including motion planners combined with RL improvements,map-free RL-based motion planners,and multi-robot cooperative planning methods.Finally,we analyze the urgent challenges faced by these mainstream RLbased motion planners in detail,review some state-of-the-art works for these issues,and propose suggestions for future research.

A Cooperation-planning Model Based on Bilevel Programming Decision

This paper is based on a resource constrained active network project;the constraint of the local resource and the time constraint of the cooperation resource are considered simultaneously.And the respective benefit of the manager and cooperation partners is also considered simultaneously.And a cooperation planning model based on bilevel multi-objective programming is de- signed,according to the due time and total cost.And an extended CNP based on the permitted range for resource and time requests is presented.A larger task set in scheduling cycle is on the permitting for the request of cooperation resource and time while the task manager itself may be permitted biding for tasks.As a result,the optimization space for the cooperation planning is enlarged.So not every bidding task is successfully bid by invitee,and the task manager itself takes on some bidding tasks.Finally,the genetic algorithm is given and the validity and feasibility of the model is proved by a case.

Cooperative Optimization of Reconfigurable Machine Tool Configurations and Production Process Plan

The production process plan design and configurations of reconfigurable machine tool （RMT） interact with each other. Reasonable process plans with suitable configurations of RMT help to improve product quality and reduce production cost. Therefore, a cooperative strategy is needed to concurrently solve the above issue. In this paper, the cooperative optimization model for RMT configurations and production process plan is presented. Its objectives take into account both impacts of process and configuration. Moreover, a novel genetic algorithm is also developed to provide optimal or near-optimal solutions： firstly, its chromosome is redesigned which is composed of three parts, operations, process plan and configurations of RMTs, respectively; secondly, its new selection, crossover and mutation operators are also developed to deal with the process constraints from operation processes （OP） graph, otherwise these operators could generate illegal solutions violating the limits; eventually the optimal configurations for RMT under optimal process plan design can be obtained. At last, a manufacturing line case is applied which is composed of three RMTs. It is shown from the case that the optimal process plan and configurations of RMT are concurrently obtained, and the production cost decreases 6.28% and nonmonetary performance increases 22%. The proposed method can figure out both RMT configurations and production process, improve production capacity, functions and equipment utilization for RMT.

The Safe Navigation of Partial Motion Planning Based on “Cooperation” with Roadside Fixed Sensors in VANET

In recent years, many methods of safe vehicle navigation and partial motion planning (PMP) have been proposed in vehicular ad-hoc network (VANET) field. In order to improve the limitation of traditional PMP, this paper presents a novel effective way to plan motion with cooperation of roadside fixed sensors (RFSs). With their cooperation, the vehicles can get the surrounding information quickly and effectively, and give highly accurate projections about the near future conditions on road. After proposing our algorithm, the worst case is analyzed and methods are found to solve the problem. Finally we conduct one elemental contrast experiment, driver situation awareness, with or without the “cooperation” of RFSs in highway scenarios. The result shows that the vehicles can make a better PMP based on the forward conditions received from RFSs, and extend the warning distance obviously when emergency happens.

Does School Enterprise Cooperation Promote Students＇ Occupation Career Planning： On the Inspirational Experience of School-enterprise Cooperation from Developed Countries

This paper systematically introduces the advantages of several developed countries, i.e., in Britain, Germany, the USA and other developed countries. The author mainly discusses some advanced school enterprise cooperation models and in combination with China＇s national conditions, the author examines what we should do and in what ways we should learn from them and improve, in order to facilitate the cooperation education in line with the development of China, thus contributing to the students＇ occupation career planning in vocational colleges. Therefore, this article has certain reference values.

Dynamic collision avoidance for cooperative fixed-wing UAV swarm based on normalized artificial potential field optimization

Cooperative path planning is an important area in fixed-wing UAV swarm.However,avoiding multiple timevarying obstacles and avoiding local optimum are two challenges for existing approaches in a dynamic environment.Firstly,a normalized artificial potential field optimization is proposed by reconstructing a novel function with anisotropy in each dimension,which can make the flight speed of a fixed UAV swarm independent of the repulsive/attractive gain coefficient and avoid trapping into local optimization and local oscillation.Then,taking into account minimum velocity and turning angular velocity of fixed-wing UAV swarm,a strategy of decomposing target vector to avoid moving obstacles and pop-up threats is proposed.Finally,several simulations are carried out to illustrate superiority and effectiveness.

Coordinated Path Planning for UAVs Based on Sheep Optimization

Using the traditional swarm intelligence algorithm to solve the cooperative path planning problem for multi-UAVs is easy to incur the problems of local optimization and a slow convergence rate.A cooperative path planning method for multi-UAVs based on the improved sheep optimization is proposed to tackle these.Firstly,based on the three-dimensional planning space,a multi-UAV cooperative cost function model is established according to the path planning requirements,and an initial track set is constructed by combining multiple-population ideas.Then an improved sheep optimization is proposed and used to solve the path planning problem and obtain multiple cooperative paths.The simulation results show that the sheep optimization can meet the requirements of path planning and realize the cooperative path planning of multi-UAVs.Compared with grey wolf optimizer(GWO),improved gray wolf optimizer(IGWO),chaotic gray wolf optimizer(CGWO),differential evolution(DE)algorithm,and particle swam optimization(PSO),the convergence speed and search accuracy of the improved sheep optimization are significantly improved.

MULTI-AGENT BASED DISTRIBUTED PROCESS PLANNING MANAGEMENT

A distributed process planning system based on autonomous multi agent system to solve a distributed process plan task in a manufacturing environment was presented. A distributed agent based process plan structure was shown to be a viable alternative to hierarchical systems providing real time response to shop floor condition. An outline was done to show how to structure a distributed process plan and how its management may be achieved among manufacturers of parts that form a product. Communication between the agents involved in a distributed process planning was also shown to be important, with the controlling agent having an overall supervision of the plans. Based on the reference model a software tool was developed to realize it.