As far as the weighted digraph is considered, an optimal directed spanning tree algorithm called table based algorithm (TBA) is proposed in the paper based on the table instead of the weighted digraph. The optimality ...As far as the weighted digraph is considered, an optimal directed spanning tree algorithm called table based algorithm (TBA) is proposed in the paper based on the table instead of the weighted digraph. The optimality is proved, and a numerical example is demonstrated.展开更多
Graph-theoretical approaches have been widely used for data clustering and image segmentation recently. The goal of data clustering is to discover the underlying distribution and structural information of the given da...Graph-theoretical approaches have been widely used for data clustering and image segmentation recently. The goal of data clustering is to discover the underlying distribution and structural information of the given data, while image segmentation is to partition an image into several non-overlapping regions. Therefore, two popular graph-theoretical clustering methods are analyzed, including the directed tree based data clustering and the minimum spanning tree based image segmentation. There are two contributions： （1） To improve the directed tree based data clustering for image segmentation, （2） To improve the minimum spanning tree based image segmentation for data clustering. The extensive experiments using artificial and real-world data indicate that the improved directed tree based image segmentation can partition images well by preserving enough details, and the improved minimum spanning tree based data clustering can well cluster data in manifold structure.展开更多
The paper deals with the consensus problem in a leaderless network of agents that have to reach a common velocity while forming a uniformly spaced string.Moreover,the final common velocity(reference velocity)is determ...The paper deals with the consensus problem in a leaderless network of agents that have to reach a common velocity while forming a uniformly spaced string.Moreover,the final common velocity(reference velocity)is determined by the agents in a distributed and leaderless way.Then,the consensus protocol parameters are optimized for networks characterized by a communication topology described by a class of directed graphs having a directed spanning tree,in order to maximize the convergence rate and avoid oscillations.The advantages of the optimized consensus protocol are enlightened by some simulation results and comparison with a protocol proposed in the related literature.The presented protocol can be applied to coordinate agents such as mobile robots,automated guided vehicles(AGVs)and autonomous vehicles that have to move with the same velocity and a common inter-space gap.展开更多
Amongst all forest utilization phases, harvesting plays a key role as the beginning phase of the utilization cycle and has a significant effect on the following phases.In this research, in order to examine the reducti...Amongst all forest utilization phases, harvesting plays a key role as the beginning phase of the utilization cycle and has a significant effect on the following phases.In this research, in order to examine the reduction of costs with respect to present and planned operations, the starting time of the harvesting or cutting phase and work flow were recorded. The starting time of each phase of the entire operation was recorded as well. Before harvesting the marked tree, the appropriate felling direction was determined and the azimuth of the correct direction was taken.The results indicate that there was not a meaningful relationship between the differences in direction of a leaning tree compared with the felling direction. However, there was a significant relationship between the difference of the defined and felling direction and the difference in tree leaning and defined direction. The same trend was observed between tree leaning and felling directions and tree leaning and defined directions. On the other hand,there was no significant relationship between tree leaning and felling directions and the defined and tree felling directions. In addition, this research shows that with an increase in tree volume, the time for tree cutting rose.Furthermore, when the difference of tree leaning and felling direction decreased, the time to cut the tree declined.The regression equation is Y = 168.9–0.14（the difference between tree leaning and felling direction） ＋ 0.7（volume）.展开更多
This article investigates the controllability problem of multi-agent systems. Each agent is assumed to be governed by a second-order consensus control law corresponding to a directed and weighted graph. Two types of t...This article investigates the controllability problem of multi-agent systems. Each agent is assumed to be governed by a second-order consensus control law corresponding to a directed and weighted graph. Two types of topology are considered. The first is concerned with directed trees, which represent the class of topology with minimum information exchange among all controllable topologies. A very simple necessary and sufficient condition regarding the weighting scheme is obtained for the controllability of double integrator multi-agent systems in this scenario. The second is concerned with a more general graph that can be reduced to a directed tree by contracting a cluster of nodes to a component. A similar necessary and sufficient condition is derived. Finally, several illustrative examples are provided to demonstrate the theoretical analysis results.展开更多
基金the National Natural Science Foundation of China (No. 79870030).
文摘As far as the weighted digraph is considered, an optimal directed spanning tree algorithm called table based algorithm (TBA) is proposed in the paper based on the table instead of the weighted digraph. The optimality is proved, and a numerical example is demonstrated.
基金Supported by the Key National Natural Science Foundation of China(61035003)~~
文摘Graph-theoretical approaches have been widely used for data clustering and image segmentation recently. The goal of data clustering is to discover the underlying distribution and structural information of the given data, while image segmentation is to partition an image into several non-overlapping regions. Therefore, two popular graph-theoretical clustering methods are analyzed, including the directed tree based data clustering and the minimum spanning tree based image segmentation. There are two contributions： （1） To improve the directed tree based data clustering for image segmentation, （2） To improve the minimum spanning tree based image segmentation for data clustering. The extensive experiments using artificial and real-world data indicate that the improved directed tree based image segmentation can partition images well by preserving enough details, and the improved minimum spanning tree based data clustering can well cluster data in manifold structure.
文摘The paper deals with the consensus problem in a leaderless network of agents that have to reach a common velocity while forming a uniformly spaced string.Moreover,the final common velocity(reference velocity)is determined by the agents in a distributed and leaderless way.Then,the consensus protocol parameters are optimized for networks characterized by a communication topology described by a class of directed graphs having a directed spanning tree,in order to maximize the convergence rate and avoid oscillations.The advantages of the optimized consensus protocol are enlightened by some simulation results and comparison with a protocol proposed in the related literature.The presented protocol can be applied to coordinate agents such as mobile robots,automated guided vehicles(AGVs)and autonomous vehicles that have to move with the same velocity and a common inter-space gap.
文摘Amongst all forest utilization phases, harvesting plays a key role as the beginning phase of the utilization cycle and has a significant effect on the following phases.In this research, in order to examine the reduction of costs with respect to present and planned operations, the starting time of the harvesting or cutting phase and work flow were recorded. The starting time of each phase of the entire operation was recorded as well. Before harvesting the marked tree, the appropriate felling direction was determined and the azimuth of the correct direction was taken.The results indicate that there was not a meaningful relationship between the differences in direction of a leaning tree compared with the felling direction. However, there was a significant relationship between the difference of the defined and felling direction and the difference in tree leaning and defined direction. The same trend was observed between tree leaning and felling directions and tree leaning and defined directions. On the other hand,there was no significant relationship between tree leaning and felling directions and the defined and tree felling directions. In addition, this research shows that with an increase in tree volume, the time for tree cutting rose.Furthermore, when the difference of tree leaning and felling direction decreased, the time to cut the tree declined.The regression equation is Y = 168.9–0.14（the difference between tree leaning and felling direction） ＋ 0.7（volume）.
基金Project supported by the Zhejiang Provincial Natural Science Foundation of China(No.LR13F030002)the Fundamental Research Funds for the Central Universities,China(No.110201*172210151)
文摘This article investigates the controllability problem of multi-agent systems. Each agent is assumed to be governed by a second-order consensus control law corresponding to a directed and weighted graph. Two types of topology are considered. The first is concerned with directed trees, which represent the class of topology with minimum information exchange among all controllable topologies. A very simple necessary and sufficient condition regarding the weighting scheme is obtained for the controllability of double integrator multi-agent systems in this scenario. The second is concerned with a more general graph that can be reduced to a directed tree by contracting a cluster of nodes to a component. A similar necessary and sufficient condition is derived. Finally, several illustrative examples are provided to demonstrate the theoretical analysis results.
