Consensus based on learning game theory with a UAV rendezvous application

Lin, Zone‐Ching; Liu, Hugh hong-tao

doi:10.1016/j.cja.2014.12.009

Cited by 17 publications

(7 citation statements)

References 29 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…To maximize the system performance, the paths for the UAVs in the same coalition should satisfy simultaneous arrival as well as some other constraints, such as the kinematic constraint of a UAV and collision avoidance with obstacles. For the simultaneous arrival problem (also called rendezvous problem), the velocity-based [20,21] method has been used. The simultaneous arrival problem of multiple UAVs is addressed by a velocity control approach [20], the UAVs communicate with each other to make a consensus on the estimated time of arrival.…”

Section: Of 19mentioning

confidence: 99%

“…The simultaneous arrival problem of multiple UAVs is addressed by a velocity control approach [20], the UAVs communicate with each other to make a consensus on the estimated time of arrival. A distributed optimization algorithm based on game theory [21] was proposed for a UAV rendezvous problem, each UAV adjusts its velocity according to the states of its neighbors in a predefined time interval. However, this method is easy to cause velocity saturation [22] and a large amount of communication is required.…”

Section: Of 19mentioning

confidence: 99%

See 1 more Smart Citation

A Hierarchical Mission Planning Method for Simultaneous Arrival of Multi-UAV Coalition

et al. 2019

View full text Add to dashboard Cite

A hierarchical mission planning method was proposed to solve a simultaneous attack mission planning problem for multi-unmanned aerial vehicles (UAVs). The method consisted of three phases aiming to decouple and solve the mission planning problem. In the first phase, the Pythagorean hodograph (PH) curve was used in the path estimation process for each UAV, which also served as the input for the task allocation process. In the second phase, a task allocation algorithm based on a negotiation mechanism was proposed to assign the targets. Considering the resource requirement, time-dependent value of targets and resource consumption of UAVs, the proposed task allocation algorithm can generate a feasible allocation strategy and get the maximum system utility. In the last phase, a path planning method was proposed to generate a simultaneous arrival PH path for each UAV considering UAV’s kinematic constraint and collision avoidance with obstacles. The comparison simulations showed that the path estimation process using the PH curve and the proposed task allocation algorithm improved the system utility, and the hierarchical mission planning method has potential in a real mission.

show abstract

Section: Of 19mentioning

confidence: 99%

Section: Of 19mentioning

confidence: 99%

A Hierarchical Mission Planning Method for Simultaneous Arrival of Multi-UAV Coalition

et al. 2019

View full text Add to dashboard Cite

show abstract

“…e (x,ã) = 1 2 Obviously, the local cost function form and the global cost function form satisfy the equation (2) in the Definition 1 and Assumptions (A − 1, 3, 4). So now we have constructed a potential game.…”

Section: The Stability Of Distributed System a Model-based Game mentioning

confidence: 99%

“…Multi-agent systems(MASs) have received attractive attention due to their wide applications, e.g., the consensus, formation, flocking and rendezvous of robots [1], UAVs [2] and mechanical components [3]. The main objective of distributed consensus control for multi-agent systems is to turn large and complex systems into small distributed systems which can communicate and coordinate with each other.…”

Section: Introductionmentioning

confidence: 99%

Distributed Anti-Disturbance Control Strategy for Multi-Aircraft Systems With Time-Varying Topology

Hua

et al. 2019

IEEE Access

View full text Add to dashboard Cite

This paper is concerned with the distributed consensus problems for second-order multiaircraft systems in the presence of sensor data loss and time-varying communication topology. A novel model-based game strategy is proposed to handle the distributed problem regardless of the time-varying topology. An anti-disturbance sliding-mode controller is designed to realize the ability of disturbance rejection and state estimation. The extended state observer combines two methods together and finally produces an independent decision-making architecture for each individual such that better convergence is achievable. Theoretical analyses are given to guarantee both individual stability and distributed stability. The simulation and experimental results are presented to show the effectiveness of the proposed control scheme. INDEX TERMS Game theory, sliding mode control (SMC), multi-aircraft systems, time-varying topology.

show abstract

“…Zhang proposed a cooperative game-based optimal consensus algorithm to solve the multi-UAV rendezvous problem in the mission area (Zhang et al, 2015). Lin established a distributed optimization approach based on a learning game algorithm, and proved the convergence of the algorithm (Lin and Liu, 2014). These algorithms provide the UAV rendezvous problem with optimal solutions, but most of them are time consuming and cannot be used online.…”

Section: Introductionmentioning

confidence: 99%

UAV rendezvous based on Nash bargain

Jiang

Wang

Yin

2018

IJICC

View full text Add to dashboard Cite

Purpose The purpose of this paper is to find a solution for the unmanned aerial vehicle (UAV) rendezvous problem, which should be feasible, optimal and not time consuming. In the existing literatures, the UAV rendezvous problem is always presented as a matter of simultaneous arrival. They focus only on the time consistency. However, the arrival time of UAVs can vary according to the rendezvous position. The authors should determine the best rendezvous position with considering UAVs’ maneuver constraint, so that UAVs can construct a formation in a short time. Design/methodology/approach The authors present a decentralized method in which UAVs negotiate with each other for the best rendezvous positions by using Nash bargain. The authors analyzed the constraints of the rendezvous time and the UAV maneuver, and proposed an objective function that allows UAVs to get to their rendezvous positions as fast as possible. Bezier curve is adopted to generate smooth and feasible flight trajectories. During the rendezvous process, UAVs adjust their speed so that they can arrive at the rendezvous positions simultaneously. Findings The effectiveness of the proposed method is verified by simulation experiments. The proposed method can successfully and efficiently solve the UAV rendezvous problem. Originality/value As far as the authors know, it is the first time Nash bargain is used in the UAV rendezvous problem. The authors modified the Nash bargain method and make it distributed, so that it can be computed easily. The proposed method is much less consuming than ordinary Nash bargain method and ordinary swarm intelligence based methods. It also considers the UAV maneuver constraint, and can be applied online for its fast calculation speed. Simulations demonstrate the effectiveness of the proposed method.

show abstract

Consensus based on learning game theory with a UAV rendezvous application

Cited by 17 publications

References 29 publications

A Hierarchical Mission Planning Method for Simultaneous Arrival of Multi-UAV Coalition

A Hierarchical Mission Planning Method for Simultaneous Arrival of Multi-UAV Coalition

Distributed Anti-Disturbance Control Strategy for Multi-Aircraft Systems With Time-Varying Topology

UAV rendezvous based on Nash bargain

Contact Info

Product

Resources

About