This paper is concerned with the constrained consensuses problem for a group of agents in disconnected topologies. By dividing the communication topology into a combination of directed trees, some necessary and suffic...This paper is concerned with the constrained consensuses problem for a group of agents in disconnected topologies. By dividing the communication topology into a combination of directed trees, some necessary and sufficient conditions are derived for all the agents to asymptotically reach a single consensus and multiple consensuses, respectively. The obtained results indicate that arbitrary anticipant consensuses can be achieved, if additional constrained controllers are added to those agents with specific indexes. Some illustrative examples are provided to demonstrate the effectiveness of the proposed theoretical results.展开更多
This study investigates cooperative guidance problems for multiple missiles with fixed and switching directed communication topologies. A two-step guidance strategy is proposed to realize the simultaneous attack. In t...This study investigates cooperative guidance problems for multiple missiles with fixed and switching directed communication topologies. A two-step guidance strategy is proposed to realize the simultaneous attack. In the first step, a distributed cooperative guidance law is designed using local neighboring information for multiple missiles to achieve consensus on range-to-go and leading angle. The second step begins when the consensus of multiple missiles is realized. During the second step, multiple missiles disconnect from each other and hit the target using the proportional navigation guidance law. First, based on the local neighboring communications, a sufficient condition for multiple missiles to realize simultaneous attack with a fixed communication topology is presented, where the topology is only required to have a directed spanning tree. Then,the results are extended to the case of switching communication topologies. Finally, numerical simulations are provided to validate the theoretical results.展开更多
基金supported by the National Natural Science Foundation of China (Grant No.60974017 and 61104063)the Key Subject Open Foundation of Information Processing and Automation Techniques (Grant No.20110807)
文摘This paper is concerned with the constrained consensuses problem for a group of agents in disconnected topologies. By dividing the communication topology into a combination of directed trees, some necessary and sufficient conditions are derived for all the agents to asymptotically reach a single consensus and multiple consensuses, respectively. The obtained results indicate that arbitrary anticipant consensuses can be achieved, if additional constrained controllers are added to those agents with specific indexes. Some illustrative examples are provided to demonstrate the effectiveness of the proposed theoretical results.
基金co-supported by the National Natural Science Foundation of China (Nos. 61503009, 61333011 and 61421063)the Aeronautical Science Foundation of China (No. 2016ZA51005)+1 种基金the Fundamental Research Funds for the Central Universities of China (No. YWF-14-RSC-101)the Excellence Foundation of BUAA for Ph.D. Students (No.2017016)
文摘This study investigates cooperative guidance problems for multiple missiles with fixed and switching directed communication topologies. A two-step guidance strategy is proposed to realize the simultaneous attack. In the first step, a distributed cooperative guidance law is designed using local neighboring information for multiple missiles to achieve consensus on range-to-go and leading angle. The second step begins when the consensus of multiple missiles is realized. During the second step, multiple missiles disconnect from each other and hit the target using the proportional navigation guidance law. First, based on the local neighboring communications, a sufficient condition for multiple missiles to realize simultaneous attack with a fixed communication topology is presented, where the topology is only required to have a directed spanning tree. Then,the results are extended to the case of switching communication topologies. Finally, numerical simulations are provided to validate the theoretical results.
