Integrated dynamic shared protection algorithm for GMPLS networks

The path protection approach is widely investigated as a survivability solution for GMPLS networks, which has the advantage of efficient capacity utilization. However, there is a problem of the path protection approach that searching a disjoint backup path for a primary path is often unsuccessful. In order to resolve this problem, an integrated dynamic shared protection （IDSP） algorithm is proposed. The main idea of the proposed algorithm is that the path protection approach is first used to establish a backup path for the primary path; if the establishment is unsuccessful, then the primary path is dynamically divided into segments whose hop count are not fixed but not more than the limitation calculated by the equations introduced. In this proposal, backup bandwidth sharing is allowed to improve the capacity utilization ratio, which makes the link cost function quite different from previous ones. Simulation experiments are presented to demonstrate the efficiency of the proposed method compared with previous methods. Numerical results show that IDSP can not only achieve low protection failure probability but can also gain a better tradeoff between the protection overbuild and the average recovery time.     

Genetic algorithm for pareto optimum-based route selection

A quality of service (QoS) or constraint-based routing selection needs to find a path subject to multiple constraints through a network. The problem of finding such a path is known as the multi-constrained path(MCP) problem, and has been proven to be NP-complete that cannot be exactly solved in a polynomial time. The NPC problem is converted into a multiobjective optimization problem with constraints to be solved with a genetic algorithm. Based on the Pareto optimum, a constrained routing computation method is proposed to generate a set of nondominated optimal routes with the genetic algorithm mechanism. The convergence and time complexity of the novel algorithm is analyzed. Experimental results show that multiobjective evolution is highly responsive and competent for the Pareto optimum-based route selection. When this method is applied to a MPLS and metropolitan-area network, it will be capable of optimizing the transmission performance.     

Multi-Objective Cooperative Salvo Attack Against Group Target

This paper proposes a solution for the problem of cooperative salvo attack of multiple cruise missiles against targets in a group. Synchronization of the arrival time of missiles to hit their common target, minimizing the time consumption of attack and maximizing the expected damage to group targets are taken into consideration simultaneously. These operational objectives result in a hierarchical mixed-variable optimization problem which includes two types of subproblems, namely the multi-objective missile-target assignment(MOMTA) problem at the upper level and the time-optimal coordinated path planning(TOCPP) problems at the lower level. In order to solve the challenging problem, a recently proposed coordinated path planning method is employed to solve the TOCPP problems to achieve the soonest salvo attack against each target. With the aim of finding a more competent solver for MOMTA, three state-of-the-art multi-objective optimization methods(MOMs),namely NSGA-II, MOEA/D and DMOEA-εC, are adopted. Finally, a typical example is used to demonstrate the advantage of the proposed method. A simple rule-based method is also employed for comparison. Comparative results show that DMOEA-εC is the best choice among the three MOMs for solving the MOMTA problem. The combination of DMOEA-εC for MOMTA and the coordinated path planning method for TOCPP can generate obviously better salvo attack schemes than the rule-based method.     

Rotary unmanned aerial vehicles path planning in rough terrain based on multi-objective particle swarm optimization

This paper presents a path planning approach for rotary unmanned aerial vehicles(R-UAVs)in a known static rough terrain environment.This approach aims to find collision-free and feasible paths with minimum altitude,length and angle variable rate.First,a three-dimensional(3D)modeling method is proposed to reduce the computation burden of the dynamic models of R-UAVs.Considering the length,height and tuning angle of a path,the path planning of R-UAVs is described as a tri-objective optimization problem.Then,an improved multi-objective particle swarm optimization algorithm is developed.To render the algorithm more effective in dealing with this problem,a vibration function is introduced into the collided solutions to improve the algorithm efficiency.Meanwhile,the selection of the global best position is taken into account by the reference point method.Finally,the experimental environment is built with the help of the Google map and the 3D terrain generator World Machine.Experimental results under two different rough terrains from Guilin and Lanzhou of China demonstrate the capabilities of the proposed algorithm in finding Pareto optimal paths.     

Generation method for five-axis NC spiral tool path based on parametric surface mapping

A new spiral tool path generation algorithm for 5-axis high speed machining is proposed in this paper. Firstly, the voltage contours are calculated to satisfy the machining parameters in the mapping parametric domain by means of the electrostatic field model of partial differential equations. Secondly, the mapping rules are constructed and the machining trajectory is planned out in the standard parametric domain in order to map and generate the spiral trajectory in the corresponding parametric domain. Finally, this trajectory is mapped onto the parametric surface for the obtainment of the spiral tool path. This spiral tool path can realize the machining of complicated parametric surface and trimmed surface without tool retractions. The above-mentioned algorithm has been implemented in several simulations and validated successfully through the actual machining of a complicated cavity. The results indicate that this method is superior to the existing machining methods to realize the high speed machining of the complicate-shaped cavity based on parametric surface and trimmed surface.     

Improved algorithm of atmospheric refraction error in Longley-Rice channel model

Longley-Rice channel model modifies the atmospheric refraction by the equivalent earth radius method, which is simple calculation but is not accurate. As it only uses the horizontal difference, but does not make use of the vertical section information, it does not agree with the actual propagation path. The atmospheric refraction error correction method of the Longley-Rice channel model has been improved. The improved method makes use of the vertical section information sufficiently and maps the distance between the receiver and transmitter to the radio wave propagation distance, It can exactly reflect the infection of propagation distance for the radio wave propagation loss. It is predicted to be more close to the experimental results by simulation in comparison with the measured data. The effectiveness of improved methods is proved by simulation.     

Monopulse instantaneous 3D imaging for wideband radar system

To avoid the complicated motion compensation in interferometric inverse synthetic aperture(InISAR)and achieve realtime three-dimensional(3 D)imaging,a novel approach for 3 D imaging of the target only using a single echo is presented.This method is based on an isolated scatterer model assumption,thus the scatterers in the beam can be extracted individually.The radial range of each scatterer is estimated by the maximal likelihood estimation.Then,the horizontal and vertical wave path difference is derived by using the phase comparison technology for each scatterer,respectively.Finally,by utilizing the relationship among the 3 D coordinates,the radial range,the horizontal and vertical wave path difference,the 3 D image of the target can be reconstructed.The reconstructed image is free from the limitation in InISAR that the image plane depends on the target's own motions and on its relative position with respect to the radar.Furthermore,a phase ambiguity resolution method is adopted to ensure the success of the 3 D imaging when phase ambiguity occurs.It can be noted that the proposed phase ambiguity resolution method only uses one antenna pair and does not require a priori knowledge,whereas the existing phase ambiguity methods may require two or more antenna pairs or a priori knowledge for phase unwarping.To evaluate the performance of the proposed method,the theoretical analyses on estimation accuracy are presented and the simulations in various scenarios are also carried out.     

Tool Orientation Optimization and Path Planning for 5-Axis Machining

Tool path generation is a fundamental problem in 5-axis CNC machining, which consists of tool orientation planning and cutter-contact(CC) point planning. The planning strategy highly depends on the type of tool cutters. For ball-end cutters, the tool orientation and CC point location can be planned separately;while for flat end cutters, the two are highly dependent on each other. This paper generates a smooth tool path of workpiece surfaces for flat end mills from two stages: Computing smooth tool orientations on the surface without gouging and collisions and then designing the CC point path. By solving the tool posture optimization problem the authors achieve both the path smoothness and the machining efficiency. Experimental results are provided to show the effectiveness of the method.     

New coordination scheme for multi-robot systems based onstate space models

A new coordination scheme for multi-robot systems is proposed. A state space model of the multi- robot system is defined and constructed in which the system＇s initial and goal states are included along with the task definition and the system＇s internal and external constraints. Task accomplishment is considered a transition of the system state in its state space （SS） under the system＇s constraints. Therefore, if there exists a connectable path within reachable area of the SS from the initial state to the goal state, the task is realizable. The optimal strategy for the task realization under constraints is investigated and reached by searching for the optimal state transition trajectory of the robot system in the SS. Moreover, if there is no connectable path, which means the task cannot be performed Successfully, the task could be transformed to be realizable by making the initial state and the goal state connectable and finding a path connecting them in the system＇s SS. This might be done via adjusting the system＇s configuration and/or task constraints. Experiments of multi-robot formation control with obstacles in the environment are conducted and simulation results show the validity of the proposed method.     

A novel method for planning a staged evacuation

This paper presents an innovative method to facilitate making such a plan.Using an algorithm to schedule the starting time of each evacuation group,the method guarantees that the time of completing a large-scale evacuation is very close to its theoretically shortest evacuation time. Meanwhile,unlike a simultaneous evacuation,during a staged evacuation planned with the proposed method,all evacuees can take the shortest path to a safe exit.Once evacuees start off,they will not suffer any traffic congestion.The above advantages of this innovative method are achieved by using an algorithm with three nested loops.Experiments have been conducted,and their results have validated the proposed method.