• <tr id="yyy80"></tr>
  • <sup id="yyy80"></sup>
  • <tfoot id="yyy80"><noscript id="yyy80"></noscript></tfoot>
  • 99热精品在线国产_美女午夜性视频免费_国产精品国产高清国产av_av欧美777_自拍偷自拍亚洲精品老妇_亚洲熟女精品中文字幕_www日本黄色视频网_国产精品野战在线观看 ?

    Optimization of communication topology for persistent formation in case of communication faults

    2023-09-05 08:48:42GuoQiangWang王國強HeLuo羅賀XiaoXuanHu胡笑旋andJianWeiTai臺建瑋
    Chinese Physics B 2023年7期
    關(guān)鍵詞:王國強

    Guo-Qiang Wang(王國強), He Luo(羅賀),?, Xiao-Xuan Hu(胡笑旋), and Jian-Wei Tai(臺建瑋)

    1School of Management,Hefei University of Technology,Hefei 230009,China

    2Key Laboratory of Process Optimization&Intelligent Decision-making,Ministry of Education,Hefei 230009,China

    3Engineering Research Center for Intelligent Decision-making&Information Systems Technologies,Ministry of Education,Hefei 230009,China

    Keywords: persistent formation, communication topology, formation communication cost, communication fault

    1.Introduction

    Agent formation has been widely used in many fields, such as large-object transportation,[1]mobile target tracking,[2]and earth observing.[3]To maintain the formation shape, there are mainly the following three formation control methods: position-based,[4,5]displacement-based,[6,7]and distance-based[8,9]methods.In comparison with other methods, the distance-based method has the advantage of requiring no knowledge of the orientations of the agents in global coordinates.[10]Agent formation using distancebased method can be further divided into two categories:rigid formation[11,12]and persistent formation.[13,14]Compared with the rigid formation, the persistent formation only needs to use half of the communication links.[15]

    In a persistent formation, one agent usually acts as the leader and tracks a predetermined reference trajectory, and the other agents receive the information from some of their neighboring agents through communication links to keep the distances between them constant.All the available communication links and the communication links being used to maintain the formation shape constitute the network topology and communication topology of the persistent formation respectively.[16]To ensure that the persistent formation can maintain its formation shape, the communication topology must be a persistent graph of the network topology.Meanwhile,different communication links of each agent may have different communication costs,that is,they consume different energy of the agent, and the available energy of each agent is limited, so it is necessary to optimize the communication topology of a persistent formation to minimize the energy consumption of the agents.

    With the aim of minimizing the sum of the communication costs of all communication links in the communication topology, also called the formation communication cost, the concept of a min-weighted persistent formation[17]or an optimally persistent formation[18]has been proposed.To generate the communication topology of an optimally persistent formation, a generation algorithm based on optimally rigid graph and triangular configuration has been proposed,[17]which is suitable for a specific two-dimensional(2D)formation shape.Two generation algorithms based on optimally rigid graph and several oriented operations have been proposed,[19,20]which are suitable for any 2D and three-dimensional (3D) formation shape respectively.In addition, a generation algorithm based on optimally rigid graph with a top–down strategy has been proposed,[21]which can be applied to some 3D formation shapes.

    Furthermore,considering the leader constraint(only certain agents can act as the leader of the formation), two algorithms called LC-HMAS-OPFGA[16]and CTOA-3DPFLC,[22]based on optimally rigid graph,minimum cost arborescence (MCA), and path reversal operation, have been proposed,which are suitable for any 2D and 3D formation shapes respectively.Then, two corresponding improved algorithms with less calculation time,called FOA-CT-2DPF[23]and FGACT-3DOPF,[24]have also been proposed.

    In summary, the existing studies have mainly addressed the offline optimization problem of communication topology for persistent formation without communication faults.However, owing to hostile attacks, signal jamming or occlusion,mechanical or communication hardware failure and so on,a persistent formation may suffer communication faults during formation movement.These communication faults may cause some communication links in the current communication topology to no longer be usable or some agents to withdraw from the formation.[25]As a result,the formation shape cannot be maintained, and agent collisions may even occur in serious cases.Therefore, it is necessary to optimize the communication topology after such communication faults to ensure the safety of all agents and continue to maintain the formation shape while reducing the formation communication cost as much as possible.Therefore,studied in this work is the optimization problem of communication topology for persistent formation in case of communication faults, and the main novel contributions of this paper are as follows.

    (i) A two-stage optimization model is proposed, which decomposes this problem into two simpler subproblems, that is, the fast reconstruction subproblem of communication topology and the re-optimization subproblem of communication topology.

    (ii) For the first subproblem, a fast reconstruction algorithm of communication topology, based on optimally rigid graph, arc addition operation and path reversal operation, is proposed,which can ensure the safety of the agents in a timely manner and maintain the formation shape.

    (iii) For the second subproblem, a re-optimization algorithm of communication topology,based on agent position exchange,is proposed,which can ensure that the formation communication cost is as low as possible while still maintaining the formation shape.

    The remainder of this article is organized as follows.The problem analysis and modeling are discussed in Section 2.In Section 3,the proposed algorithms are presented in detail,and their time complexities are analyzed.In Section 4, the effectiveness of the proposed algorithms is validated by numerical experiments.Concluding remarks and expectations are presented in Section 5.

    2.Problem analysis and modeling

    First, some basic knowledge about persistent formation is presented.Second,the communication fault constraint of a persistent formation is analyzed.On this basis,a two-stage optimization model is proposed to model the optimization problem of communication topology for persistent formation in case of communication faults.

    2.1.Basic knowledge about persistent formation

    The formation shape, network topology, communication topology, leader constraint, and communication fault constraint of persistent formation are introduced respectively.

    2.1.1.Formation shape of persistent formation

    Thed-dimensional formation shape of a persistent formation composed ofnagents can be represented by ann×3 matrixS,[23,24]as shown below:

    Here, the positions in the formation shape are numbered as 1,2,...,n, and (xi,yi,zi) represent the relative coordinates of thei-th position in a coordinate system.In particular,whendis equal to 2,the value ofzi(1≤i ≤n)is 0.

    2.1.2.Network topology of persistent formation

    The network topology of a persistent formation includes all of the available communication links between agents, and can be represented by a weighted digraphD=(V,A,W,P)as follows.[23,24]

    i)V={vi},1≤i ≤n,is the set of vertices,wherevirepresents thei-th agent.

    ii)A={aij}?V×V,1≤i/=j ≤n, is the set of arcs,whereai j=(vi,vj)denotes that there is a communication link fromvitovjsuch thatvican send information tovj.

    iii)W={wij},aij ∈A, is the set of arc weights, wherewijdenotes the communication cost ofaij,which is equivalent to the communication distance fromvitovj.

    iv)P={pi},1≤i ≤n,is the set of specific positions of agents, referred to as the agent position configuration, wherepirepresents the number of the specific position ofviinS.

    2.1.3.Communication topology of persistent formation

    The communication topology of a persistent formation is a persistent graph in its network topology.It can be expressed asT=(V,A?,W?,P),A??A,W??W,and has the following attributes.[23,24]

    (I)Its underlying undirected graph is a rigid graph.

    (II)aij ∈A?indicates that the communication link fromvitovjis used during the formation movement.

    (IV)|A?| represents the total number of communication links in the communication topology,which must satisfy|A?|≥d×(|V|?3)+3.When|A?|=d×(|V|?3)+3, the communication topology is a minimally persistent graph,and the persistent formation is a minimally persistent formation.

    (V)w(T)=∑ai j∈A?wi jrepresents the formation communication cost.If the correspondingw(T) of the current communication topology is the smallest in all possible persistent graphs in the same network topology,then this communication topology is an optimally persistent graph, and this formation is an optimally persistent formation.

    2.1.4.Leader constraint of persistent formation

    To facilitate agent control,the leader-first-follower(LFF)or leader-remote-follower(LRF)control mode is usually used by a persistent formation to maintain a 2D formation shape.Furthermore, for a heterogeneous persistent formation, only specific agents can act as the leader in the LFF or LRF control mode, and these candidate leaders can be represented byVl ?V.Therefore,the leader constraint of a 2D persistent formation can be described as Eq.(2),[23]in whichviacts as the leader.

    Similarly,the leader-first follower-second follower(L-FF-SF)control mode is usually used by a persistent formation to maintain a 3D formation shape, and the leader constraint of a 3D persistent formation can be described as follows:[24]

    wherevi,vj,andvkact as the leader,the first follower,and the second follower,respectively.

    2.2.Communication fault constraint of persistent formation

    Four specific types of communication faults can be summarized in Table 1.[26]

    Table 1.Four types of communication faults.

    Meanwhile, for all agents to be informed of the same communication fault information in time, we assume that all agents have the same diagnosis and identification strategy of communication faults based on a broadcast communication channel(BC)as indicated in the studies of Giuliettiet al.,[27]Polliniet al.,[28]and Yanget al.[29]

    In summary,different types of communication faults will make certain communication links invalid or cause certain agents to withdraw from the formation.LetA?={axy},1≤x /=y ≤n, represent the set of invalid communication links, and letV?={az}, 1≤z ≤n, denote the set of agents that must be withdrawn from the formation.If the current communication topology contains one or more of these invalid communication links or if one or more of the agents need to be withdrawn from the formation,then the current communication topology can no longer be used to maintain the formation shape,and the communication topology must be adjusted.Therefore, the communication fault constraint of a persistent formation can be described as follows:

    That is, the adjusted communication topology cannot contain any invalid communication links,nor can it contain any agent that needs to withdraw from the formation.

    2.3.Problem modeling

    When a communication fault prevents the current communication topology from being used to maintain the formation shape, if the communication topology is not adjusted in time, this communication fault may lead to collision accidents between agents.[25]Therefore, after a communication fault occurs,the communication topology must be quickly reconstructed to ensure the safety of the agents and restore the formation shape.After the communication topology reconstruction, the security of the persistent formation is ensured.At this time,the communication topology can be reoptimized via agent position exchange(e.g.,exchanging the positions of two agents in the formation or having one agent filling in the space left by another agent exiting the formation) to achieve the minimal formation communication cost required to continue to maintain the formation shape.Based on the above analysis, the optimization problem of communication topology for persistent formation in case of communication faults can be decomposed into the following two subproblems.

    I) Fast reconstruction subproblem of communication topology for persistent formation

    First,the corresponding invalid arcs or invalid vertices are removed from the current network topologyD=(V,A,W,P)to obtain a reconstructed network topologyDr=(Vr,Ar,Wr,Pr)that satisfies the communication fault constraint; then, a suitable subgraphTrneeds to be quickly selected fromDras the reconstructed communication topology.

    The reconstructed communication topology must be a persistent graph inDr; however, there may be more than one graph like this inDr,of which,the optimally persistent graph has the lowest formation communication cost.Moreover, because only certain agents can serve as the leader, it may not be possible to use any arbitrary optimally persistent graph inDras the reconstructed communication topology.Therefore,this problem is modeled as an optimization problem of obtaining the optimally persistent graph inDrthat satisfies the leader constraint and the communication fault constraint.

    II)Re-optimization subproblem of communication topology for persistent formation

    Since different position exchanges will result in different agent position configurationsPmand there are multiple feasible communication topologies for eachPm, in this work this problem is modeled as a combinatorial optimization problem in which the leader constraint and the communication fault constraint must be satisfied: the objective is to select an optimal position configurationPofrom the set of all possible agent position configurations{Pm}such that the formation communication cost of the corresponding optimal communication topologyTois globally minimum.

    Specifically, the network topologyDmthat satisfies the communication fault constraint is constructed for eachPm,and then,the optimally persistent graphTmthat satisfies the leader constraint inDmis obtained.Finally,the graph with the lowest formation communication cost is selected as the reoptimized communication topologyTofrom among allTm, and the corresponding agent position configurationPois the reoptimized agent position configuration.

    The necessary and sufficient conditions for an optimally persistent graph are shown in Lemma 1 as follows.

    Lemma 1[16,22]A weighted digraphD=(V,A,W) is ad-dimensional optimally persistent graph if and only if it satisfies the following two conditions:

    (i)The in-degree of each vertex is no greater thand.

    (ii) The corresponding weighted undirected graph,G=(V,E,W),is ad-dimensional optimally rigid graph.

    The necessary and sufficient conditions for an optimally rigid graph, as mentioned in condition 2 of Lemma 1, are shown in Lemma 2 as follows.

    Lemma 2[16,22]A weighted undirected graphG=(V,E,W)is ad-dimensional optimally rigid graph if and only if it satisfies the following three conditions:

    i)The number of edges,|E|,isd×(|V|?3)+3.

    ii)The corresponding rigidity matrix,M ∈R|E|×(3×|V|),is full rank,that is,the rank ofMisd×(|V|?3)+3.

    iii)The sum of the weights of all edges inEis the smallest in all weighted undirected graphs that have the same vertices and satisfy conditions 1 and 2.

    3.Model-solving algorithms

    For solving the above two subproblems, a fast reconstruction algorithm of communication topology for persistent formation (FRA-CT-PF), based on optimally rigid graph, arc addition operation and path reversal operation, is proposed.Then,a re-optimization algorithm of communication topology for persistent formation (ROA-CT-PF), based on agent position exchange, is proposed.The details of these two algorithms are described in the following subsections.

    3.1.FRA-CT-PF

    The algorithm first deletes invalid arcs and vertexes from current network topology to obtain a reconstructed network topology, then generates an optimally rigid graph of this reconstructed network topology by considering the communication fault constraint,and transforms the optimally rigid graph into an optimally persistent graph satisfying the communication fault constraint through converting into a digraph, obtaining the intersection with current communication topology, arc addition and path reversal operations.Finally, the algorithm makes the optimally persistent graph satisfy both the leader constraint and the communication fault constraint through path reversal operation.The pseudocode of FRA-CTPF is shown in Table 2.

    Next, the correctness of FRA-CT-PF is proved theoretically.

    Theorem 1The reconstructed communication topologyTrobtained by FRA-CT-PF must be the optimally persistent graph in the reconstructed network topologyDrthat satisfies the leader constraint and the communication fault constraint.

    ProofBecauseTis ad-dimensional optimally persistent graph ofD,the in-degree of each vertex inTis no greater thandaccording to Lemma 1.Therefore,after the operation of line 09,the in-degree of each vertex inTris also no greater thand.The premise of the operation of line 15 is(vj)

    After the operation of line 08,DRris the digraph of optimally rigid graphRr.After the operation of line 09,Tris a subgraph ofDRrand no duplicate arcs exist inTr.In the operations of lines 11 to 27, all arcs added toTrmust belong toDRrand no duplicate arcs are added toTr.Meanwhile, after the operations of lines 11 to 27,m=d×(|Vr|?3)+3.In the operations of lines 28 to 36, only the direction of some arcs inTris changed.Therefore,the corresponding weighted undirected graph of the finalTrmust be the optimally rigid graphRr.That is,Trobtained by FRA-CT-PF must satisfy condition 2 of Lemma 1.

    Because all conditions of Lemma 1 are satisfied,Trobtained by FRA-CT-PF must be ad-dimensional optimally persistent graph inDr.

    After the operation of lines 28 to 36,d=2 and equation (2) are satisfied, ord=3 and equation (3) are satisfied.Therefore,Trobtained by FRA-CT-PF must satisfy the leader constraint.

    After the operation of line 03,A?andV?are deleted fromDr,which means thatDrsatisfies the communication fault constraint.After the operations of lines 08 to 09,DRris the subgraph ofDrandTris the subgraph ofDRr, soTrsatisfies the communication fault constraint.In the operations of lines 11 to 36,all arcs added toTrmust belong toDRrand all the reverse paths must exist inDRr.Therefore,Trobtained by FRA-CT-PF must satisfy the communication fault constraint.

    In summary,Trobtained by FRA-CT-PF must be the optimally persistent graph inDrthat satisfies the leader constraint and the communication fault constraint.

    The time complexity of FRA-CT-PF is analyzed as follows.In this algorithm,the main calculation time is in lines 07,19,22,31,33,and 34,respectively.Line 07 is an improvement on the original optimally rigid graph generation algorithm,[30]and its time complexity is approximatelyO(|Vr|4).Lines 19,22, 31, 33, and 34 use the classical Dijkstra shortest path algorithm, and the time complexity of each of them is approximatelyO(||+|Vr|×log|Vr|).Because|Vr|≤|V| and||≤|Ar|≤|V|×(|V|?1),the total time complexity of FRACT-PF is aboutO(|Vr|4+4×(||+|Vr|×log|Vr|))≈O(|V|4).

    3.2.ROA-CT-PF

    To obtain a reoptimized communication topology through agent position exchange,the following solution method can be adopted.First, for each agent position configurationPm, the network topologyDmthat satisfies the communication fault constraint is constructed.Then,the optimally persistent graphTmthat satisfies the leader constraint and the communication fault constraint in eachDm, is obtained.Finally, the graph with the lowest formation communication cost is selected from among allTmas the reoptimized communication topology,To.

    However, eachPmmust be a permutation of the selection of|Vr| positions from among the|V| positions in the formation shape, so the total number of all possiblePmis|V|!/(|V|?|Vr|)!.As the value of|V| continues to increase,the corresponding value of|V|!/(|V|?|Vr|)! becomes very large,indicating that it is difficult to obtain a solution in a limited time.Therefore, ROA-CT-PF is proposed in this work to achieve a suboptimal reoptimized communication topology through position exchange between only two agents.Nevertheless, it can still obtain a good reoptimized communication topology, as verified in the following numerical experiments.The pseudocode of this algorithm is shown in Table 3.

    Table 3.Pseudocode of ROA-CT-PF.

    Next, the correctness of ROA-CT-PF is proved theoretically.

    Theorem 2The reoptimized communication topologyToobtained by ROA-CT-PF must be feasible and its formation communication cost is no more than that ofTrobtained by FRA-CT-PF.

    ProofIn the operation of line 01,Tois initialized by the reconstructed communication topologyTrobtained by FRACT-PF.According to Theorem 1,Trmust be feasible, so the initialTois feasible.In the operation of line 08, FRA-CT-PF is used to obtain the corresponding optimal reconstructed communication topologyTm.According to Theorem 1,Tmmust be feasible.In the operations of lines 10 and 12,Tois replaced byTm.Therefore,Toobtained by ROA-CT-PF must be feasible.

    In the operation of line 01,Tois initialized by the reconstructed communication topologyTrobtained by FRA-CT-PF,so the formation communication cost of the initialTois equal to that ofTr.In the operations of lines 09 to 13, only whenw(Tm)≤w(To)Tocan be replaced byTm.Therefore,the formation communication cost ofToobtained by ROA-CT-PF is no more than that ofTrobtained by FRA-CT-PF.

    The time complexity of ROA-CT-PF is analyzed as follows.Line 08 is the core step of this algorithm and is the same as lines 06 to 36 of FRA-CT-PF;therefore,the time complexity of line 08 is approximatelyO(|V|4).In line 06 the number of possible combinations of two positions selected from among the|V|total positions is|V|×(|V|?1)/2; that is, the total number of all feasiblePmis|V|×(|V|?1)/2.Therefore,it can be seen from line 05 of this algorithm that line 08 will run|V|×(|V|?1)/2 times at most.Consequently, because|Vr|≤|V|, the time complexity of this algorithm is approximatelyO(|V|4×|V|×(|V|?1)/2)≈O(|V|6).

    4.Numerical experiments

    Next, several numerical experiments are carried out to verify the effectiveness of the proposed algorithms.

    4.1.Experimental settings

    Assuming that there are no communication faults at the beginning,all agents are able to communicate with each other,viis located at thei-th position inSand onlyv1,v2,andv4can serve as leaders,so the initial network topology is shown in Fig.2(a)and its corresponding Laplace matrix is

    The initial communication topology of this persistent formation,obtained by CTOA-PF-LC,[22]is shown in Fig.2(b).Its corresponding Laplace matrix is

    Fig.2.Initial network topology and communication topology of this persistent formation,showing(a)initial network topology and(b)initial communication topology.

    In this communication topology,v1,v2, andv5are the leader, the first follower, and the second follower, respectively,and the formation communication cost is 11163,whileP={1,2,3,4,5}is the corresponding agent position configuration.To easily distinguish the in-degree of each vertex in figures,arcs from small-to large-numbered vertices are drawn with blue solid lines, and other arcs are drawn with magenta solid lines.

    To verify the effectiveness of proposed algorithms under various types of communication faults in Table 1, eight communication fault scenarios as shown in Table 4, are designed and the corresponding numerical experiments are carried out.Among these scenarios,because the influence of a transmitter or transceiver failure on a leader in the communication topology is very different from that of a transmitter or transceiver failure on a non-leader,scenarios 2 and 3 are designed to represent transmitter failures on a leader and a non-leader, and scenarios 5 and 6 are designed to represent transceiver failures on a leader and a non-leader, respectively.In addition, scenarios 7 and 8 are designed to represent transceiver failures on two agents.

    The development environment of all algorithms is Visual Studio 2013, and the programming language is C++.All experiments are performed on a computer with an 8-core i7 4.0-GHz processor,16-GB RAM and a Windows 10 operating system.

    4.2.Experimental results of fast reconstruction of communication topology

    First, scenario 3 is used to illustrate the calculation process of FRA-CT-PF.It is assumed thatv5suffers a transmitter failure based on the current network topology shown in Fig.2(a) and the current communication topology shown in Fig.2(b).At the same time, onlyv1,v2, andv4can serve as leaders.Namely,the communication fault constraint is denoted byA?={a5y},1≤y ≤6 andV?= /0, and the leader constraint is represented byVl={v1,v2,v4}.Then,the main calculation process of this algorithm is as follows.

    In line 02, the invalid arcs and vertexes are deleted from current network topology,and the reconstructed network topologyDris shown in Fig.3(a).Its corresponding Laplace matrix is

    In line 07,the optimally rigid graphRrofGris generated as shown in Fig.3(b),which satisfies that the degree of each vertex inRris no more than the number of bidirectional arcs of this vertex inGrplus 3.This additional condition ensures thatRrcan be directed to an optimally persistent graph satisfying the communication fault constraint.

    In line 08,Rris converted into a digraphDRrsatisfying the communication fault constraint,and it is shown in Fig.3(c).Its corresponding Laplace matrix is

    In line 09,the intersection ofDRrandTis obtained and used to reinitializeTr,as shown in Fig.3(d).

    Fig.3.Calculation process of FRA-CT-PF under scenario 3,showing(a)constructed network topology,(b)optimally rigid graph Rr,(c)digraph corresponding to Rr,(d)intersection Tr of DRr and T,(e)Tr after adding a14,(f)Tr after adding a15,(g)Tr after adding a16,(h)Tr after adding a25,(i)Tr after reversing(1,4),(j)Tr after reversing(6,3),(k)Tr after reversing(6,2),and(l)reconstructed communication topology.

    In line 10,the number of its arcs,m,is 8.

    In line 11,becausem<3×|Vr|?6,the operations in lines 12 to 26 will be performed untilm=3×|Vr|?6.The specific process is as follows: whenl=1,thel-th edgeei jinRrise14,neithera14nora41exists inTr,d(v4)=0<3 anda14∈DRr,soa14is added toTrin line 15 as shown in Fig.3(e).Similarly, whenl=2,a15is added toTras shown in Fig.3(f).Whenl=3,a16is added toTras shown in Fig.3(g).Whenl=4,a25is added toTras shown in Fig.3(h).

    In line 28, because the leader constraint is not satisfied,jumps directly to line 31.

    In line 31,v4is found to be the leader because it satisfiesv4∈Vl.However, becaused(v4)=1 now, a path (1,4) is found inTrand its arcs are reversed inTras shown in Fig.3(i),where the reversed path is identified by dashed lines.After this path reverse operation,Trsatisfiesd(v4)=0 andTr?DRr.Therefore,v4acts as the leader.

    In line 33,v3is found because it satisfiesa43∈.However,becausedr(v3)=2 now,a path(6,3)is found inTrand its arcs are reversed inTras shown in Fig.3(j), where the reversed path is identified by dashed lines.After this path reverse operation,Trsatisfiesa43∈,d(v3)=1 andTr?DRr.Therefore,v3acts as the first follower.

    In line 34,v2is found because it satisfiesa42,a32∈.However, because(v2)=3 now, a path (6,2) is found inTrand its arcs are reversed inTras shown in Fig.3(k),where the reversed path is identified by dashed lines.After this path reverse operation,Trsatisfiesa42,a32∈,(v2)=2 andTr?DRr.Therefore,v2acts as the second follower.

    In line 37,Tris the reconstructed communication topology as shown in Fig.3(l), and the corresponding formation communication cost is 11903.1.Its corresponding Laplace matrix is

    Comparatively,if CTOA-3DPF-LC[22]is used to acquire the reconstructed communication topology in this case,the finalTrobtained is shown in Fig.4.However, the arcsa53,a54, anda56exist in the finalTr, which means that the finalTrdoes not satisfy the communication fault constraint.Therefore, the reconstructed communication topology obtained by CTOA-3DPF-LC is infeasible.

    Fig.4.Reconstructed communication topology obtained by CTOA-3DPF-LC.

    Similarly,if FGA-CT-3DOPF[24]is used to obtain the reconstructed communication topology in this case, the finalTrobtained is shown in Fig.5.However, it does not satisfy the condition 1 of Lemma 2.Therefore, the reconstructed communication topology obtained by FGA-CT-3DOPF is also infeasible.

    Fig.5.Reconstructed communication topology obtained by FGA-CT-3DOPF.

    Table 5.Reconstructed communication topologies and calculation time under eight scenarios.

    Scenario FRA-CT-PF CTOA-3DPF-LC FGA-CT-3DOPF

    Table 5.(Continued).

    Next, for the eight communication fault scenarios in Table 4, the reconstructed communication topologies obtained by FRA-CT-PF and existing algorithms, and the calculation time of these algorithms are shown in Table 5.

    In scenario 1, the reconstructed communication topologies obtained by FRA-CT-PF and FGA-CT-3DOPF are both feasible and have the same formation communication cost.However,the reconstructed communication topology obtained by CTOA-3DPF-LC is infeasible because it does not satisfy the communication fault constraint.In scenarios 2 and 4, the same conclusion can be drawn.

    In scenario 3, the reconstructed communication topology obtained by FRA-CT-PF is feasible.However,the reconstructed communication topology obtained by CTOA-3DPFLC is infeasible because it does not satisfy the communication fault constraint.Meanwhile,the reconstructed communication topology obtained by FGA-CT-3DOPF is infeasible because it does not satisfy the condition 1 of Lemma 2.

    In scenario 5, the reconstructed communication topologies obtained by FRA-CT-PF,CTOA-3DPF-LC and FGA-CT-3DOPF are both feasible and have the same formation communication cost.In scenarios 6,7,and 8,the same conclusion can be drawn.

    Meanwhile,in all scenarios,the average calculation time of FRA-CT-PF is only 3.48%of that of CTOA-3DPF-LC,but only 1.02%of that of FGA-CT-3DOPF.

    In summary, compared with existing algorithms, FRACT-PF proposed in this paper can always obtain feasible reconstructed communication topology in all communication fault scenarios,and its calculation time is much less.

    4.3.Experimental results of re-optimization of communication topology

    First,scenario 3 continues to be used to illustrate the calculation process of ROA-CT-PF.Based on the reconstructed communication topology as shown in Fig.3(l),the calculation process of ROA-CT-PF is as follows.

    In line 01,Tois equal toTrandPois equal toPr.

    In line 02,becausew(To)=11903.1 andw(T)=11163,the algorithm executes the operations of lines 05 to 14.

    Whenm= 2, the correspondingP2in line 06 is{2,1,3,4,5,6}and the correspondingT2in line 08 is shown in Fig.6(a),wherev1andv2exchange their positions in the formation shape andw(T2)=11903.1.Becausew(T2)=w(To)and the total agent movement distance for switching fromPrtoP2is 1562.05, which is more than that fromPrtoPo, there is no change inTonorPo.

    Whenm= 3,P3is{3,2,1,4,5,6}andT3is shown in Fig.6(b),wherev1andv3exchange their positions in the formation shape andw(T3)=11903.1.Becausew(T3)=w(To)and the total agent movement distance for switching fromPrtoP3is equal to that fromPrtoPo,there is no change inToandPo,either.

    Whenm= 4,P4is{4,2,3,1,5,6}andT4is shown in Fig.6(c),wherev1andv4exchange their positions in the formation shape andw(T4)=11903.1.Becausew(T4)=w(To)and the total agent movement distance for switching fromPrtoP4is 3072.46, which is more than that fromPrtoPo, there is also no change inTonorPo.

    Whenm= 5,P5is{5,2,3,4,1,6}andT5is shown in Fig.6(d),wherev1andv5exchange their positions in the formation shape andw(T5)=11163.Becausew(T5)

    Fromm=6 to the end,the conditions in line 09 or line 11 are not satisfied, so there is no change inTonorPo.Namely,T5is the reoptimized communication topology, wherev1andv5exchange their positions.

    Fig.6.Example of calculation process of ROA-CT-PF, showing: (a) reconstructed communication topology when m=2, (b) reconstructed communication topology when m=3,(c)reconstructed communication topology when m=4,and(d)reoptimized communication topology.

    In contrast, lines 05 and 06 of ROA-CT-PF are modified into“whilem<|V|!/(|V|?|Vr|)!do”and“Letm=m+1,and obtain the next permutationPmof the selection of|Vr|positions from among the|V|positions in the formation shape”,and this modified algorithm is called ROA-CT-PF-P.Then, ROA-CTPF-P is used to obtain the reoptimized communication topology in this case.TheToobtained by ROA-CT-PF-P is the same as that obtained by ROA-CT-PF, but the calculation time of ROA-CT-PF-P is much longer than that of ROA-CT-PF.

    Next, for the eight communication fault scenarios in Table 4,the reoptimized communication topologies obtained by FRA-CT-PF and existing algorithms,and the calculation time of these algorithms are shown in Table 6.

    In scenario 1,because the formation communication cost of reconstructed communication topology is more than that of current communication topology, the operations of agent position exchange in ROA-CT-PF and ROA-CT-PF-P will be executed.The reoptimized communication topologies obtained by ROA-CT-PF and ROA-CT-PF-P are the same.However,the calculation time of ROA-CT-PF is much less than that of ROA-CT-PF-P.Meanwhile, both CTOA-3DPF-LC and FGACT-3DOPF do not support the re-optimization of communication topology for persistent formation.In scenarios 3,5,6,and 7,the same conclusion can be drawn.

    In scenario 2,because the formation communication cost of reconstructed communication topology is equal to that of current communication topology, the operations of agent position exchange in ROA-CT-PF and ROA-CT-PF-P will not be executed.That is,the reoptimized communication topologies obtained by ROA-CT-PF and ROA-CT-PF-P are the same as the reconstructed communication topology, and the calculation time of ROA-CT-PF and ROA-CT-PF-P are both approximately equal to 0.In scenario 4,the same conclusion can be drawn.

    Table 6.Reoptimized communication topologies and calculation time under eight scenarios

    Table 6.(Continued).

    In scenario 8,because the formation communication cost of reconstructed communication topology is more than that of current communication topology, the operations of agent position exchange in ROA-CT-PF and ROA-CT-PF-P will be executed.The formation communication cost of the reoptimized communication topology obtained by ROA-CT-PF is more than that by ROA-CT-PF-P.This shows that ROA-CTPF cannot ensure obtaining the optimal reoptimized communication topology through position exchange between only two agents.However,the calculation time of ROA-CT-PF is much less than that of ROA-CT-PF-P.

    In summary,the following conclusions can be drawn from Table 6:

    (i) Compared with CTOA-3DPF-LC and FGA-CT-3DOPF,the ROA-CT-PF proposed in this paper can reoptimize the communication topology to further reduce the formation communication cost based on the reconstructed communication topology.

    (ii)Compared with ROA-CT-PF-P,the ROA-CT-PF proposed in this paper can almost obtain the same reoptimized communication topology in all communication fault scenarios,and the calculation time is much less.

    5.Conclusion and perspectives

    In this paper, the optimization problem of communication topology for persistent formation in case of communication faults is studied.This problem is decomposed into two subproblems, namely, the fast reconstruction subproblem of communication topology and the re-optimization subproblem of communication topology.

    To address the fast reconstruction subproblem of communication topology, an algorithm called FRA-CT-PF, based on optimally rigid graph,arc addition operation and path reversal operation, is proposed.Compared with existing algorithms,the algorithm can always obtain feasible reconstructed communication topology in all communication fault scenarios,and its calculation time is much less.

    To address the re-optimization subproblem of communication topology, an algorithm called ROA-CT-PF, based on agent position exchange,is proposed.Compared with existing algorithms,the algorithm can obtain a reoptimized communication topology to further reduce the formation communication cost in a shorter time.

    In the future,a distributed optimization algorithm of communication topology for persistent formation in case of communication faults will be studied.

    Acknowledgements

    Project supported by the National Natural Science Foundation of China(Grant Nos.71871079,72271076,71971075,and 71671059) and the Anhui Provincial Natural Science Foundation,China(Grant No.1808085MG213).

    猜你喜歡
    王國強
    王國強作品選
    外逃原市委書記:給自己定了個刑期
    新傳奇(2019年40期)2019-11-01 01:30:32
    回國投案的市委書記
    檢察風云(2017年9期)2017-05-18 07:42:39
    現(xiàn)實版“丁義珍”
    ——外逃是死路一條
    新傳奇(2017年17期)2017-01-30 07:13:58
    Some Thoughts on Proposing a Customer Satisfaction Strategy in Education
    美國驚魂,市委書記海外逃亡始末
    午夜福利乱码中文字幕| 国产精品久久久久成人av| 丝瓜视频免费看黄片| 波多野结衣一区麻豆| 亚洲欧洲日产国产| 19禁男女啪啪无遮挡网站| 99久久99久久久精品蜜桃| 在线观看免费日韩欧美大片| 日韩成人在线观看一区二区三区| 法律面前人人平等表现在哪些方面| 久久毛片免费看一区二区三区| 色综合婷婷激情| 一区在线观看完整版| 国产主播在线观看一区二区| 99九九在线精品视频| 日本wwww免费看| 国产免费现黄频在线看| av线在线观看网站| 男男h啪啪无遮挡| 欧美中文综合在线视频| 久久性视频一级片| 99精国产麻豆久久婷婷| 精品国产亚洲在线| 怎么达到女性高潮| 中文字幕人妻熟女乱码| 亚洲精品国产精品久久久不卡| 国产高清视频在线播放一区| 中文字幕高清在线视频| 国产欧美日韩综合在线一区二区| 久久av网站| 老司机靠b影院| 午夜91福利影院| 久久久精品94久久精品| 桃红色精品国产亚洲av| 国产午夜精品久久久久久| 国产日韩欧美亚洲二区| 中亚洲国语对白在线视频| 一区二区三区激情视频| 精品第一国产精品| 国产精品一区二区在线不卡| 国产日韩一区二区三区精品不卡| 9色porny在线观看| av国产精品久久久久影院| 怎么达到女性高潮| 黄色毛片三级朝国网站| 精品少妇久久久久久888优播| 在线观看免费高清a一片| 久久99热这里只频精品6学生| 亚洲精品久久午夜乱码| 丰满迷人的少妇在线观看| 9色porny在线观看| 国产亚洲午夜精品一区二区久久| 国产成人欧美在线观看 | 一本一本久久a久久精品综合妖精| 狠狠精品人妻久久久久久综合| 日日夜夜操网爽| 亚洲国产中文字幕在线视频| 首页视频小说图片口味搜索| 亚洲国产精品一区二区三区在线| 在线永久观看黄色视频| 亚洲专区中文字幕在线| 国产精品久久久久久精品电影小说| 成人18禁高潮啪啪吃奶动态图| 国产成人一区二区三区免费视频网站| 一夜夜www| 日韩精品免费视频一区二区三区| 久久国产精品男人的天堂亚洲| 丁香欧美五月| av不卡在线播放| svipshipincom国产片| 桃红色精品国产亚洲av| 女人被躁到高潮嗷嗷叫费观| 亚洲av国产av综合av卡| 天天操日日干夜夜撸| 亚洲七黄色美女视频| 丝袜美腿诱惑在线| 国产午夜精品久久久久久| 亚洲av美国av| 十八禁高潮呻吟视频| 久久婷婷成人综合色麻豆| 一本久久精品| 亚洲色图综合在线观看| 大片免费播放器 马上看| 高清欧美精品videossex| 高潮久久久久久久久久久不卡| 亚洲 欧美一区二区三区| 老司机福利观看| 99riav亚洲国产免费| 精品国产一区二区三区久久久樱花| 亚洲视频免费观看视频| 女同久久另类99精品国产91| 9色porny在线观看| 国产97色在线日韩免费| 高清毛片免费观看视频网站 | 精品一区二区三区四区五区乱码| 男女下面插进去视频免费观看| 十八禁网站网址无遮挡| 天天躁狠狠躁夜夜躁狠狠躁| 999久久久国产精品视频| 夜夜骑夜夜射夜夜干| 黑人欧美特级aaaaaa片| 老司机午夜十八禁免费视频| 日韩人妻精品一区2区三区| 日本黄色日本黄色录像| 99re在线观看精品视频| 久久人人97超碰香蕉20202| 国产精品一区二区精品视频观看| 男女高潮啪啪啪动态图| 99久久国产精品久久久| 亚洲精品自拍成人| 肉色欧美久久久久久久蜜桃| 18禁国产床啪视频网站| 国产精品香港三级国产av潘金莲| 婷婷成人精品国产| 国产精品国产高清国产av | 80岁老熟妇乱子伦牲交| 日韩欧美国产一区二区入口| 不卡av一区二区三区| 操出白浆在线播放| 汤姆久久久久久久影院中文字幕| 午夜福利在线观看吧| 国产男女超爽视频在线观看| 亚洲第一青青草原| 午夜福利欧美成人| 久久人人97超碰香蕉20202| 美女视频免费永久观看网站| 男男h啪啪无遮挡| 婷婷丁香在线五月| 日本wwww免费看| 天堂中文最新版在线下载| 女性生殖器流出的白浆| 亚洲成人国产一区在线观看| 国产精品影院久久| 欧美精品啪啪一区二区三区| 欧美久久黑人一区二区| 99热网站在线观看| 免费高清在线观看日韩| 国产一卡二卡三卡精品| 国产日韩欧美在线精品| 亚洲精品国产区一区二| 手机成人av网站| 美女福利国产在线| 国产精品 欧美亚洲| 国产激情久久老熟女| 极品人妻少妇av视频| 久久性视频一级片| 一夜夜www| 午夜福利免费观看在线| 一二三四社区在线视频社区8| 精品一区二区三卡| 一个人免费看片子| 侵犯人妻中文字幕一二三四区| 亚洲欧美一区二区三区久久| 成人18禁在线播放| tocl精华| 中亚洲国语对白在线视频| 国产高清视频在线播放一区| 亚洲三区欧美一区| 日韩免费高清中文字幕av| 久久99热这里只频精品6学生| 在线播放国产精品三级| av片东京热男人的天堂| 亚洲天堂av无毛| 日韩有码中文字幕| 岛国毛片在线播放| 91麻豆精品激情在线观看国产 | 精品卡一卡二卡四卡免费| 亚洲欧洲日产国产| 麻豆国产av国片精品| 丝袜人妻中文字幕| 俄罗斯特黄特色一大片| 亚洲精品美女久久av网站| 80岁老熟妇乱子伦牲交| av欧美777| 国产又色又爽无遮挡免费看| 在线亚洲精品国产二区图片欧美| 亚洲午夜精品一区,二区,三区| 50天的宝宝边吃奶边哭怎么回事| 午夜久久久在线观看| 自拍欧美九色日韩亚洲蝌蚪91| av福利片在线| 亚洲一区二区三区欧美精品| 久久精品国产亚洲av高清一级| 满18在线观看网站| 极品教师在线免费播放| 亚洲av成人不卡在线观看播放网| 在线观看66精品国产| 国产精品久久久久久精品电影小说| 精品卡一卡二卡四卡免费| 国精品久久久久久国模美| 搡老乐熟女国产| 国产精品秋霞免费鲁丝片| 国产欧美日韩一区二区精品| a级毛片在线看网站| 亚洲一码二码三码区别大吗| 国产精品一区二区在线观看99| 国产主播在线观看一区二区| 极品少妇高潮喷水抽搐| 飞空精品影院首页| 精品一区二区三区视频在线观看免费 | 亚洲成人免费av在线播放| 午夜激情av网站| 亚洲av成人一区二区三| 丰满迷人的少妇在线观看| 日本av手机在线免费观看| 啦啦啦视频在线资源免费观看| 国产在视频线精品| 我的亚洲天堂| 色尼玛亚洲综合影院| 18禁裸乳无遮挡动漫免费视频| 日本一区二区免费在线视频| 亚洲五月婷婷丁香| 久久精品91无色码中文字幕| 亚洲av欧美aⅴ国产| 视频在线观看一区二区三区| 俄罗斯特黄特色一大片| 国产av精品麻豆| av视频免费观看在线观看| 亚洲视频免费观看视频| 久久精品国产亚洲av香蕉五月 | 国产色视频综合| 欧美乱妇无乱码| 桃红色精品国产亚洲av| 亚洲av日韩在线播放| 51午夜福利影视在线观看| 国产精品av久久久久免费| 欧美激情高清一区二区三区| 成在线人永久免费视频| 一夜夜www| 两性夫妻黄色片| 大香蕉久久成人网| 欧美精品一区二区大全| 亚洲精品粉嫩美女一区| 日本黄色日本黄色录像| 日本a在线网址| 国产欧美亚洲国产| a级片在线免费高清观看视频| 午夜福利乱码中文字幕| 国产精品影院久久| 中文字幕制服av| 狠狠精品人妻久久久久久综合| 亚洲三区欧美一区| 亚洲伊人色综图| 久久免费观看电影| 80岁老熟妇乱子伦牲交| 国产免费av片在线观看野外av| 18禁国产床啪视频网站| 日本精品一区二区三区蜜桃| 99在线人妻在线中文字幕 | 久久精品国产综合久久久| 中文字幕制服av| 老熟妇乱子伦视频在线观看| 亚洲五月色婷婷综合| 精品国产超薄肉色丝袜足j| 一区二区三区激情视频| 在线永久观看黄色视频| 在线观看人妻少妇| 国产深夜福利视频在线观看| 欧美精品高潮呻吟av久久| 巨乳人妻的诱惑在线观看| 1024香蕉在线观看| 黄片小视频在线播放| 亚洲欧美色中文字幕在线| 91成人精品电影| 精品亚洲成国产av| 热99久久久久精品小说推荐| 日韩视频一区二区在线观看| 成人免费观看视频高清| 国产亚洲精品久久久久5区| 纵有疾风起免费观看全集完整版| 在线观看免费午夜福利视频| 在线观看免费日韩欧美大片| 国产麻豆69| 色综合欧美亚洲国产小说| av网站在线播放免费| 欧美精品av麻豆av| 久久国产精品人妻蜜桃| e午夜精品久久久久久久| 欧美黄色淫秽网站| 久久人妻av系列| 啦啦啦在线免费观看视频4| 亚洲国产av新网站| 欧美成人免费av一区二区三区 | 国产一卡二卡三卡精品| 亚洲成人国产一区在线观看| 女性生殖器流出的白浆| 亚洲成人免费av在线播放| 日本欧美视频一区| 亚洲成人国产一区在线观看| 日韩熟女老妇一区二区性免费视频| 亚洲精品中文字幕一二三四区 | 91国产中文字幕| 久久午夜亚洲精品久久| 国产麻豆69| 色尼玛亚洲综合影院| 18禁裸乳无遮挡动漫免费视频| 午夜激情久久久久久久| av又黄又爽大尺度在线免费看| 亚洲精品国产色婷婷电影| 99久久国产精品久久久| 极品人妻少妇av视频| 欧美日韩福利视频一区二区| 两人在一起打扑克的视频| 老司机午夜十八禁免费视频| 成人18禁高潮啪啪吃奶动态图| 久久热在线av| 亚洲免费av在线视频| 欧美黑人精品巨大| 精品人妻1区二区| 日本五十路高清| 巨乳人妻的诱惑在线观看| 欧美人与性动交α欧美软件| 亚洲欧美一区二区三区久久| av天堂久久9| 亚洲精品国产色婷婷电影| 在线观看免费高清a一片| 亚洲精品一卡2卡三卡4卡5卡| 一区二区三区激情视频| 男女午夜视频在线观看| 久热这里只有精品99| 亚洲五月色婷婷综合| 久久精品亚洲av国产电影网| 在线观看免费日韩欧美大片| 成人手机av| 国产成人av教育| 纵有疾风起免费观看全集完整版| 中文字幕另类日韩欧美亚洲嫩草| 天天添夜夜摸| 飞空精品影院首页| 亚洲午夜精品一区,二区,三区| 美女视频免费永久观看网站| 国产不卡一卡二| 久久久久精品人妻al黑| 99riav亚洲国产免费| 三级毛片av免费| 制服人妻中文乱码| 亚洲 欧美一区二区三区| 亚洲精品成人av观看孕妇| 成人国产一区最新在线观看| 精品乱码久久久久久99久播| 亚洲一码二码三码区别大吗| 一进一出抽搐动态| 一级毛片精品| 亚洲欧美精品综合一区二区三区| 18禁观看日本| 国产日韩欧美在线精品| 欧美在线一区亚洲| 亚洲免费av在线视频| 99国产精品99久久久久| 国产精品亚洲一级av第二区| 免费在线观看完整版高清| 视频在线观看一区二区三区| 欧美成人免费av一区二区三区 | 宅男免费午夜| 免费人妻精品一区二区三区视频| 久久ye,这里只有精品| 曰老女人黄片| 老司机靠b影院| 久久中文看片网| 肉色欧美久久久久久久蜜桃| 国产精品亚洲av一区麻豆| 亚洲 欧美一区二区三区| 国产精品久久久久久精品古装| 国产野战对白在线观看| 十八禁网站免费在线| 精品国产乱码久久久久久小说| 久久人妻av系列| 一二三四在线观看免费中文在| 日韩 欧美 亚洲 中文字幕| 欧美精品一区二区大全| 最新的欧美精品一区二区| 人妻久久中文字幕网| 久久精品亚洲熟妇少妇任你| 天天躁狠狠躁夜夜躁狠狠躁| 高清黄色对白视频在线免费看| 成人亚洲精品一区在线观看| 免费在线观看黄色视频的| 久久国产精品人妻蜜桃| 香蕉丝袜av| 亚洲欧洲精品一区二区精品久久久| 午夜视频精品福利| 国产不卡av网站在线观看| 女性生殖器流出的白浆| 亚洲avbb在线观看| 国产一区二区三区视频了| 国产欧美日韩精品亚洲av| 菩萨蛮人人尽说江南好唐韦庄| 黄色成人免费大全| 人妻一区二区av| 操出白浆在线播放| 国产精品久久久久久精品电影小说| av在线播放免费不卡| 日韩人妻精品一区2区三区| 国产片内射在线| 十八禁高潮呻吟视频| 肉色欧美久久久久久久蜜桃| 亚洲综合色网址| 国产欧美日韩一区二区三区在线| 午夜福利在线免费观看网站| 自拍欧美九色日韩亚洲蝌蚪91| 久久久久久人人人人人| 亚洲人成77777在线视频| 女警被强在线播放| 在线观看免费高清a一片| 国产又色又爽无遮挡免费看| 精品免费久久久久久久清纯 | 人人妻人人爽人人添夜夜欢视频| 两性夫妻黄色片| 欧美另类亚洲清纯唯美| 亚洲精品中文字幕在线视频| 欧美日韩中文字幕国产精品一区二区三区 | 精品国产一区二区三区久久久樱花| 欧美日韩福利视频一区二区| 中文字幕av电影在线播放| 亚洲中文字幕日韩| 久久天堂一区二区三区四区| 国产成人影院久久av| 成人三级做爰电影| 亚洲一区中文字幕在线| 亚洲视频免费观看视频| 色精品久久人妻99蜜桃| 脱女人内裤的视频| av免费在线观看网站| 丝袜喷水一区| 纵有疾风起免费观看全集完整版| 国产成人欧美在线观看 | 美女主播在线视频| 国产老妇伦熟女老妇高清| 午夜福利乱码中文字幕| 亚洲av欧美aⅴ国产| √禁漫天堂资源中文www| 国产精品一区二区精品视频观看| 久久久水蜜桃国产精品网| 欧美日韩一级在线毛片| 亚洲中文日韩欧美视频| 搡老岳熟女国产| 日本黄色视频三级网站网址 | 国产国语露脸激情在线看| 免费一级毛片在线播放高清视频 | 精品少妇内射三级| 亚洲伊人色综图| 欧美精品一区二区大全| 日韩大片免费观看网站| 在线十欧美十亚洲十日本专区| 国产日韩欧美在线精品| av有码第一页| 欧美一级毛片孕妇| 精品少妇一区二区三区视频日本电影| 久久天堂一区二区三区四区| 欧美日韩福利视频一区二区| 黄色毛片三级朝国网站| 黑人巨大精品欧美一区二区蜜桃| 99精国产麻豆久久婷婷| 男女高潮啪啪啪动态图| 黄网站色视频无遮挡免费观看| 精品人妻在线不人妻| 如日韩欧美国产精品一区二区三区| 夜夜骑夜夜射夜夜干| 国产不卡一卡二| 免费人妻精品一区二区三区视频| 2018国产大陆天天弄谢| 亚洲欧美日韩另类电影网站| 国产精品二区激情视频| 久久久久视频综合| 美女国产高潮福利片在线看| 精品一区二区三卡| a级毛片在线看网站| 大片免费播放器 马上看| 国产一区有黄有色的免费视频| 国产成人精品无人区| 国产高清videossex| 精品人妻1区二区| 中国美女看黄片| 大片免费播放器 马上看| 在线永久观看黄色视频| 免费在线观看黄色视频的| 国精品久久久久久国模美| 日韩欧美三级三区| 免费不卡黄色视频| 五月天丁香电影| 人人妻人人爽人人添夜夜欢视频| 最新的欧美精品一区二区| 午夜福利影视在线免费观看| 国产精品香港三级国产av潘金莲| 亚洲精华国产精华精| 91老司机精品| 精品一区二区三卡| 欧美精品一区二区大全| 久久青草综合色| 国产高清激情床上av| 色精品久久人妻99蜜桃| av国产精品久久久久影院| 丁香欧美五月| 日本一区二区免费在线视频| 女性被躁到高潮视频| 18禁国产床啪视频网站| 成人国语在线视频| 变态另类成人亚洲欧美熟女 | 国产亚洲一区二区精品| 国产三级黄色录像| 精品午夜福利视频在线观看一区 | 无限看片的www在线观看| 亚洲熟妇熟女久久| 老司机午夜福利在线观看视频 | 91字幕亚洲| 99国产精品一区二区蜜桃av | 操出白浆在线播放| 亚洲成人手机| 另类亚洲欧美激情| 69精品国产乱码久久久| 亚洲午夜理论影院| 国产亚洲欧美在线一区二区| 亚洲欧洲精品一区二区精品久久久| 国产又爽黄色视频| 一区二区av电影网| 国产无遮挡羞羞视频在线观看| 久久人妻福利社区极品人妻图片| 天堂8中文在线网| 欧美精品高潮呻吟av久久| 桃红色精品国产亚洲av| 不卡av一区二区三区| 亚洲男人天堂网一区| 午夜精品久久久久久毛片777| 亚洲综合色网址| 亚洲国产欧美日韩在线播放| 男女免费视频国产| 精品国产乱子伦一区二区三区| 国产精品麻豆人妻色哟哟久久| 亚洲精品乱久久久久久| 麻豆乱淫一区二区| 中文字幕另类日韩欧美亚洲嫩草| 亚洲精品久久午夜乱码| 久久精品熟女亚洲av麻豆精品| 美女主播在线视频| 亚洲 欧美一区二区三区| 1024香蕉在线观看| 精品久久久久久电影网| 亚洲熟女毛片儿| 亚洲黑人精品在线| 日本av手机在线免费观看| 涩涩av久久男人的天堂| 亚洲人成电影免费在线| 午夜激情av网站| 亚洲九九香蕉| 成人精品一区二区免费| 欧美老熟妇乱子伦牲交| 亚洲第一欧美日韩一区二区三区 | 国产男靠女视频免费网站| 亚洲精品自拍成人| 免费久久久久久久精品成人欧美视频| 少妇猛男粗大的猛烈进出视频| 午夜福利乱码中文字幕| cao死你这个sao货| 欧美大码av| 美女午夜性视频免费| 菩萨蛮人人尽说江南好唐韦庄| 日韩一区二区三区影片| 狠狠狠狠99中文字幕| 国产成人精品久久二区二区免费| 人妻 亚洲 视频| 国产精品秋霞免费鲁丝片| 国产精品熟女久久久久浪| 男人操女人黄网站| 日韩免费高清中文字幕av| 亚洲,欧美精品.| 高清毛片免费观看视频网站 | 日韩视频在线欧美| 亚洲精品美女久久久久99蜜臀| 狂野欧美激情性xxxx| 日韩欧美国产一区二区入口| 人成视频在线观看免费观看| 成人精品一区二区免费| 久久中文看片网| 国产激情久久老熟女| 丁香欧美五月| 欧美国产精品一级二级三级| 男女午夜视频在线观看| 最黄视频免费看| 下体分泌物呈黄色| 一个人免费在线观看的高清视频| 美女福利国产在线| 亚洲熟妇熟女久久| 亚洲色图综合在线观看| 他把我摸到了高潮在线观看 | 中文字幕色久视频| 日本黄色视频三级网站网址 | 国产一卡二卡三卡精品| 一级毛片电影观看| 精品亚洲成国产av| 最黄视频免费看| 老熟妇仑乱视频hdxx| 丝袜人妻中文字幕| 老熟妇乱子伦视频在线观看| 久久人妻福利社区极品人妻图片| 日日摸夜夜添夜夜添小说| a级片在线免费高清观看视频| 免费av中文字幕在线| av在线播放免费不卡| av又黄又爽大尺度在线免费看| 国产在线一区二区三区精| 亚洲熟女精品中文字幕| 亚洲精品一卡2卡三卡4卡5卡| 欧美精品人与动牲交sv欧美| 精品国产国语对白av| 欧美黑人欧美精品刺激| 免费av中文字幕在线| a级片在线免费高清观看视频| 美女扒开内裤让男人捅视频| 好男人电影高清在线观看| 国产国语露脸激情在线看| 婷婷成人精品国产| 狠狠狠狠99中文字幕| 午夜91福利影院| 国产精品.久久久| 在线观看免费高清a一片|