Local Pursuit Strategy-Inspired Cooperative Trajectory Planning Algorithm For A Class Of Nonlinear Constrained Dynamical Systems

Cooperative trajectory planning is crucial for networked vehicles to respond rapidly in cluttered environments and has a significant impact on many applications such as air traffic or border security monitoring and assessment. One of the challenges in cooperative planning is to find a computationally efficient algorithm that can accommodate both the complexity of the environment and real hardware and configuration constraints of vehicles in the formation. Inspired by a local pursuit strategy observed in foraging ants, feasible and optimal trajectory planning algorithms are proposed in this paper for a class of nonlinear constrained cooperative vehicles in environments with densely populated obstacles. In an iterative hierarchical approach, the local behaviours, such as the formation stability, obstacle avoidance, and individual vehicle\u27s constraints, are considered in each vehicle\u27s (i.e. follower\u27s) decentralised optimisation. The cooperative-level behaviours, such as the inter-vehicle collision avoidance, are considered in the virtual leader\u27s centralised optimisation. Early termination conditions are derived to reduce the computational cost by not wasting time in the local-level optimisation if the virtual leader trajectory does not satisfy those conditions. The expected advantages of the proposed algorithms are (1) the formation can be globally asymptotically maintained in a decentralised manner; (2) each vehicle decides its local trajectory using only the virtual leader and its own information; (3) the formation convergence speed is controlled by one single parameter, which makes it attractive for many practical applications; (4) nonlinear dynamics and many realistic constraints, such as the speed limitation and obstacle avoidance, can be easily considered; (5) inter-vehicle collision avoidance can be guaranteed in both the formation transient stage and the formation steady stage; and (6) the computational cost in finding both the feasible and optimal solutions is low. In particular, the feasible solution can be computed in a very quick fashion. The minimum energy trajectory planning for a group of robots in an obstacle-laden environment is simulated to showcase the advantages of the proposed algorithms. © 2013 Taylor & Francis

Local pursuit strategy-inspired cooperative trajectory planning algorithm for a class of nonlinear constrained dynamical systems

Cooperative trajectory planning is crucial for networked vehicles to respond rapidly in cluttered environments and has a significant impact on many applications such as air traffic or border security monitoring and assessment. One of the challenges in cooperative planning is to find a computationally efficient algorithm that can accommodate both the complexity of the environment and real hardware and configuration constraints of vehicles in the formation. Inspired by a local pursuit strategy observed in foraging ants, feasible and optimal trajectory planning algorithms are proposed in this paper for a class of nonlinear constrained cooperative vehicles in environments with densely populated obstacles. In an iterative hierarchical approach, the local behaviours, such as the formation stability, obstacle avoidance, and individual vehicle\u27s constraints, are considered in each vehicle\u27s (i.e. follower\u27s) decentralised optimisation. The cooperative-level behaviours, such as the inter-vehicle collision avoidance, are considered in the virtual leader\u27s centralised optimisation. Early termination conditions are derived to reduce the computational cost by not wasting time in the local-level optimisation if the virtual leader trajectory does not satisfy those conditions. The expected advantages of the proposed algorithms are (1) the formation can be globally asymptotically maintained in a decentralised manner; (2) each vehicle decides its local trajectory using only the virtual leader and its own information; (3) the formation convergence speed is controlled by one single parameter, which makes it attractive for many practical applications; (4) nonlinear dynamics and many realistic constraints, such as the speed limitation and obstacle avoidance, can be easily considered; (5) inter-vehicle collision avoidance can be guaranteed in both the formation transient stage and the formation steady stage; and (6) the computational cost in finding both the feasible and optimal solutions is low. In particular, the feasible solution can be computed in a very quick fashion. The minimum energy trajectory planning for a group of robots in an obstacle-laden environment is simulated to showcase the advantages of the proposed algorithms

Coordinated Optimal Power Planning of Wind Turbines in a Wind Farm

Wind energy is on an upswing due to climate concerns and increasing energy demands on conventional sources. Wind energy is attractive and has the potential to dramatically reduce the dependency on non-renewable energy resources. With the increase in wind farms there is a need to improve the efficiency in power allocation and power generation among wind turbines. Wake interferences among wind turbines can lower the overall efficiency considerably, while offshore conditions pose increased loading on wind turbines. In wind farms, wind turbines* wake affects each other depending on their positions and operation modes. Therefore it becomes essential to optimize the wind farm power production as a whole than to just focus on individual wind turbines. The work presented here develops a hierarchical power optimization algorithm for wind farms. The algorithm includes a cooperative level (or higher level) and an individual level (or lower level) for power coordination and planning in a wind farm. The higher level scheme formulates and solves a quadratic constrained programming problem to allocate power to wind turbines in the farm while considering the aerodynamic effect of the wake interaction among the turbines and the power generation capabilities of the wind turbines. In the lower level, optimization algorithm is based on a leader-follower structure driven by the local pursuit strategy. The local pursuit strategy connects the cooperative level power allocation and the individual level power generation in a leader-follower arrangement. The leader, could be a virtual entity and dictates the overall objective, while the followers are real wind turbines considering realistic constraints, such as tower deflection limits. A nonlinear wind turbine dynamics model is adopted for the low level study with loading and other constraints considered in the optimization. The stability of the algorithm in the low level is analyzed for the wind turbine angular velocity. Simulations are used to show the advantages of the method such as the ability to handle non-square input matrix, non-homogenous dynamics, and scalability in computational cost with rise in the number of wind turbines in the wind farm