A Redistributed Bundle Algorithm Based on Local Convexification Models for Nonlinear Nonsmooth DC Programming

For nonlinear nonsmooth DC programming (difference of convex functions), we introduce a new redistributed proximal bundle method. The subgradient information of both the DC components is gathered from some neighbourhood of the current stability center and it is used to build separately an approximation for each component in the DC representation. Especially we employ the nonlinear redistributed technique to model the second component of DC function by constructing a local convexification cutting plane. The corresponding convexification parameter is adjusted dynamically and is taken sufficiently large to make the ”augmented” linearization errors nonnegative. Based on above techniques we obtain a new convex cutting plane model of the original objective function. Based on this new approximation the redistributed proximal bundle method is designed and the convergence of the proposed algorithm to a Clarke stationary point is proved. A simple numerical experiment is given to show the validity of the presented algorithm.

Dynamic Coalition Task Allocation of Heterogeneous Multiple Agents

The dynamic coalition task allocation of heterogeneous multiple UAV agents is researched, which is divided into two parts. Firstly, the consensus based coalition algorithm(CBCA) is presented via consensus based bundle algorithm(CBBA), considering complex constraints of specific equipment requirements and coupling the relationships between the subtasks and the time windows. Secondly, three dynamic planning strategies are proposed in cope with appearance of new tasks during the allocation process. Finally, the feasibility and applicability of the present algorithm and dynamic planning strategies are validated in the scenario of a search and attack mission executed by multiple unmanned search aerial vehicles(USAVs) and unmanned combat aerial vehicles (UCAVs).