检索结果-内蒙古大学图书馆

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

Chinese Physics B 2023年第7期32卷 610-624页

作者：王国强罗贺胡笑旋台建玮 School of Management Hefei University of TechnologyHefei 230009China Key Laboratory of Process Optimization&Intelligent Decision-making Ministry of EducationHefei 230009China Engineering Research Center for Intelligent Decision-making&Information Systems Technologies Ministry of EducationHefei 230009China

To address the optimization problem of communication topology for persistent formation in the case of communication faults such as link interruption,transmitter failure,and receiver failure a two-stage model including fast reconstruction of communication topology and re-optimization of communication topology is ***,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,which can quickly generate a feasible reconstructed communication topology after communication faults,thus ensuring the safety of the agents and maintaining the formation shape of persistent ***,a re-optimization algorithm of communication topology for persistent formation(ROA-CTPF),based on agent position exchange,is proposed,which can further obtain a reoptimized communication topology to minimize the formation communication cost while still maintaining the formation shape of persistent *** time complexities of these two algorithms are also ***,the effectiveness of the above algorithms is verified by numerical *** with existing algorithms,FRA-CT-PF can always obtain feasible reconstructed communication topology in much less time under all communication fault scenarios,and ROA-CT-PF can obtain a reoptimized communication topology to further reduce the formation communication cost in a shorter time.

关键词： persistent formation communication topology formation communication cost communication fault

来源：评论

学校读者我要写书评

暂无评论

A multi-UAV deployment method for border patrolling based on Stackelberg game

引用

Journal of Systems Engineering and Electronics 2023年第1期34卷 99-116页

作者： LEI Xing HU Xiaoxuan WANG Guoqiang LUO He School of Management Hefei University of TechnologyHefei 230009China Key Laboratory of Process Optimization&Intelligent Decision-making Ministry of EducationHefei 230009China Engineering Research Center for Intelligent Decision-making&Information Systems Technologies Ministry of EducationHefei 230009China

To strengthen border patrol measures, unmanned aerial vehicles(UAVs) are gradually used in many countries to detect illegal entries on borders. However, how to efficiently deploy limited UAVs to patrol on borders of large areas remains challenging. In this paper, we first model the problem of deploying UAVs for border patrol as a Stackelberg game. Two players are considered in this game: The border patrol agency is the leader,who optimizes the patrol path of UAVs to detect the illegal immigrant. The illegal immigrant is the follower, who selects a certain area of the border to pass through at a certain time after observing the leader’s strategy. Second, a compact linear programming problem is proposed to tackle the exponential growth of the number of leader’s strategies. Third, a method is proposed to reduce the size of the strategy space of the follower. Then, we provide some theoretic results to present the effect of parameters of the model on leader’s utilities. Experimental results demonstrate the positive effect of limited starting and ending areas of UAV’s patrolling conditions and multiple patrolling altitudes on the leader ’s utility, and show that the proposed solution outperforms two conventional patrol strategies and has strong robustness.

关键词： border patrol unmanned aerial vehicle(UAV) Stackelberg game compact linear programming dominated strategy elimination

来源：评论

学校读者我要写书评

暂无评论

A BSC-ANP Model for Evaluation of Strategic Fit of New Product Development Projects

A BSC-ANP Model for Evaluation of Strategic Fit of New Produ...

引用

第25届中国控制与决策会议

作者： Ying Yang ShanLin Yang Jian Yang School of Management Hefei University of Technology Key Laboratory of Process Optimization and Intelligent Decision-making Ministry of Education

ISBN: (纸本)9781467355339

New product development (NPD) projects have been major forces driving company competitive advantage. All of them should align with corporate strategy so that the limited resources may be allocated effectively. However, few studies have been conducted to measure the extent that the NPD project matches with strategy. The paper identifies the cause-effect relationships between the strategy BSC measures for NPD projects based on strategy map and presents a BSC-ANP model to evaluate the strategic fit of projects. The causal relationships and interdependencies between projects and criteria are integrated with ANP model to produce the final priorities of projects with respect to their strategic fit. The proposed model was tested against empirical data drawn from NPD projects in an automobile company.

关键词： Evaluation, Strategic fit, New product development project, BSC-ANP

来源：评论

学校读者我要写书评

暂无评论

Multicriteria game approach to air-to-air combat tactical decisions for multiple UAVs

引用

Journal of Systems Engineering and Electronics 2023年第6期34卷 1447-1464页

作者： JIANG Ruhao LUO He MA Yingying WANG Guoqiang School of Management Hefei University of TechnologyHefei 230009China Key Laboratory of Process Optimization&Intelligent Decision-making Ministry of EducationHefei 230009China Intelligent Interconnected Systems Laboratory of Anhui Province Hefei 230009China

Air-to-air combat tactical decisions for multiple unmanned aerial vehicles(ACTDMU)are a key decision-making step in beyond visual range *** influencing factors,strong antagonism and real-time requirements need to be considered in the ACTDMU *** this paper,we propose a multicriteria game approach to *** approach consists of a multicriteria game model and a Pareto Nash equilibrium *** this model,we form the strategy profiles for the integration of air-to-air combat tactics and weapon target assignment strategies by considering the correlation between them,and we design the vector payoff functions based on predominance *** propose a algorithm of Pareto Nash equilibrium based on preference relations using threshold constraints(PNE-PRTC),and we prove that the solutions obtained by this algorithm are refinements of Pareto Nash equilibrium *** numerical experiments indicate that PNE-PRTC algorithm is considerably faster than the baseline algorithms and the performance is *** on large-scale instances,the Pareto Nash equilibrium solutions can be calculated by PNEPRTC algorithm at the second *** simulation experiments show that the multicriteria game approach is more effective than one-side decision approaches such as multiple-attribute decision-making and randomly chosen decisions.

关键词： tactical decision multicriteria game preference relation Pareto Nash equilibrium.

来源：评论

学校读者我要写书评

暂无评论

A composite quantile regression long short-term memory network with group lasso for wind turbine anomaly detection

引用

Journal of Ambient Intelligence and Humanized Computing 2023年第3期14卷 2261-2274页

作者： Xu, Qifa Wu, Dongdong Jiang, Cuixia Wang, Xiangxiang School of Management Hefei University of Technology Hefei230009 China Key Laboratory of Process Optimization and Intelligent Decision-Making Ministry of Education Hefei230009 China

Wind turbine anomaly detection is an important but challenging work. Though deep learning is promising in this filed, it may fail for large error distributions and often lacks interpretability due to its complex structure. To this end, we develop a composite quantile regression long short-term memory network with group lasso (CQR-LSTM-GL). The CQR-LSTM-GL model extends the LSTM network to the quantile regression framework, which makes LSTM always valid regardless of the error distribution. Additionally, the CQR-LSTM-GL model adopts the group lasso method to compress the network structure and select key features. To illustrate its efficacy, we conduct a numerical experiment on the public server machine datasets. The experimental results show that the CQR-LSTM-GL model is not only slightly better than several competitive models in anomaly detection performance, but also far ahead in sparsity performance. The sparsity of CQR-LSTM-GL is 1.63 times that of CQR-LSTM-L1, and much more than that of CQR-LSTM. We then apply the CQR-LSTM-GL model to the anomaly detection of a wind turbine using the real Supervisory Control and Data Acquisition data, where all three anomalies are identified. © 2022, The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature.

关键词： Long short-term memory

来源：评论

学校读者我要写书评

暂无评论

Distributed Online Convex optimization with Time-Varying Constraints: Tighter Cumulative Constraint Violation Bounds under Slater's Condition

引用

IEEE Transactions on Automatic Control 2025年

作者： Yi, Xinlei Li, Xiuxian Yang, Tao Xie, Lihua Hong, Yiguang Chai, Tianyou Johansson, Karl H. National Key Laboratory of Autonomous Intelligent Unmanned Systems Shanghai Institute of Intelligent Science and Technology China Ministry of Education Frontiers Science Center for Intelligent Autonomous Systems China Massachusetts Institute of Technology Lab for Information & Decision Systems CambridgeMA02139 United States Northeastern University State Key Laboratory of Synthetical Automation for Process Industries Shenyang110819 China Nanyang Technological University School of Electrical and Electronic Engineering 50 Nanyang Avenue 639798 Singapore Kth Royal Institute of Technology Division of Decision and Control Systems School of Electrical Engineering and Computer Science Sweden Digital Futures Stockholm10044 Sweden

This paper considers distributed online convex optimization with time-varying constraints. In this setting, a network of agents makes decisions at each round, and then only a portion of the loss function and a coordinate block of the constraint function are privately revealed to each agent. The loss and constraint functions are convex and can vary arbitrarily across rounds. The agents collaborate to minimize static network regret and network cumulative constraint violation. A novel distributed online algorithm with a vanishing stepsize is proposed and it achieves an O(Tmax {c,1-c}) static network regret bound and an O(T1-c/2) network cumulative constraint violation bound, where T is the number of rounds and c∈ (0,1) is a user-defined trade-off parameter. When Slater's condition holds (i.e, there is a point that strictly satisfies the inequality constraints), the network cumulative constraint violation bound is reduced to O(T1-c). Moreover, if the loss functions are strongly convex, then static network regret bound is reduced to O(log (T)), and the network cumulative constraint violation bound is reduced to O(√log (T)T) and O(log (T)) without and with Slater's condition, respectively. To the best of our knowledge, this paper is the first to achieve tighter (network) cumulative constraint violation bounds for (distributed) online convex optimization with time-varying constraints under Slater's condition. Finally, the theoretical results are verified through numerical simulations. © 1963-2012 IEEE.

关键词： Convex optimization

来源：评论

学校读者我要写书评

暂无评论

An Adaptive Local Grid Nesting-based Genetic Algorithm for Multi-earth Observation Satellites' Area Target Observation

引用

Journal of Systems Science and Systems Engineering 2024年第2期33卷 232-258页

作者： Ligang Xing Wei Xia Xiaoxuan Hu Waiming Zhu Yi Wu School of Management Hefei University of TechnologyHefei 230009China Key Laboratory of Process Optimization and Inteligent Decision-making Ministry of EducationHefei 230009China Intelligent Interconnected Systems Laboratory of Anhui Province Hefei 230009China

The Scheduling of the Multi-EOSs Area Target Observation(SMEATO)is an EOS resource schedul-ing problem highly coupled with computational *** advances in EOS technology and the ex-pansion of wide-area remote sensing applications have increased the practical significance of *** this paper,an adaptive local grid nesting-based genetic algorithm(ALGN-GA)is proposed for developing SMEATO ***,a local grid nesting(LGN)strategy is designed to discretize the target area into parts,so as to avoid the explosive growth of calculations.A genetic algorithm(GA)framework is then used to share reserve information for the population during iterative evolution,which can generate high-quality solutions with low computational *** this basis,an adaptive technique is introduced to determine whether a local region requires nesting and whether the grid scale is *** effectiveness of the proposed model is assessed experimentally with nine randomly generated tests at different *** results show that the ALGN-GA offers advantages over several conventional algorithms in 88.9%of instances,especially in large-scale *** fully demonstrate the high efficiency and stability of the ALGN-GA.

关键词： Multi-EOSs scheduling area target observation adaptive genetic algorithm local grid nesting

来源：评论

学校读者我要写书评

暂无评论

Data-driven group decision making for diagnosis of thyroid nodule

引用

Science China(Information Sciences) 2019年第11期62卷 151-173页

作者： Chao FU Wenjun CHANG Weiyong LIU Shanlin YANG School of Management Hefei University of Technology Key Laboratory of Process Optimization and Intelligent Decision-making Ministry of Education Department of Ultrasound The First Affiliated Hospital of USTC Division of Life Sciences and MedicineUniversity of Science and Technology of China

Emerging information technologies' integration into various fields has enhanced the development of these fields. Large volumes of data have been accumulated in this process. The accumulated data offer opportunities and challenges for people facing practical problems. On the one hand, it is essential to depend on a group's capabilities rather than an individual's capabilities to handle practical problems because the individual may lack sufficient expertise and experience to use data. In this situation, the practical problems can be considered as group decision making(GDM) problems. On the other hand, the accumulated data can help generate quality solutions to GDM problems. To obtain such solutions under the assumption that the accumulated data regarding a specific decision problem are available, this paper proposes a data-driven GDM method. In the method, decision makers' weights are learned from historical overall assessments and the corresponding gold standards, while criterion weights are learned from historical overall assessments and the corresponding decision matrices. The learned expert weights and criterion weights are used to produce the aggregated assessments, from which alternatives are compared or the overall conclusion is made. In a tertiary hospital located in Hefei, Anhui Province, China, the proposed method is applied to aid radiologists in diagnosing thyroid nodules.

关键词： data-driven group decision making interval number learning of expert weights learning of criterion weights diagnosis of thyroid nodule

来源：评论

学校读者我要写书评

暂无评论

A Fast Generation Algorithm of Communication Topology for Three-dimensional Optimally Persistent Formation 33

A Fast Generation Algorithm of Communication Topology for Th...

引用

第33届中国控制与决策会议

作者： Guoqiang Wang Qianwei Lv Xiaoduo Li Xin Cao He Luo School of Management Hefei University of Technology Key Laboratory of Process Optimization and Intelligent Decision-Making Ministry of Education Engineering Research Center for Intelligent Decision-making & Information Systems Technologies Ministry of Education Key Laboratory of Urban ITS Technology Optimization and Integration Ministry of Public Security of China

ISBN: (纸本)9781665431293

To solve the communication topology generation problem of three-dimensional optimally persistent formation with leader constraint,a fast generation algorithm based on minimum cost arborescence,arc addition and path reverse operation is *** with the existing algorithms,this algorithm has a shorter calculation ***,the simulation results further verify the correctness and effectiveness of the algorithm.

关键词： Communication topology Leader constraint Three-dimensional optimal persistent formation Minimum cost arborescence Arc addition Path reverse operation

来源：评论

学校读者我要写书评

暂无评论

Hierarchical method of task assignment for multiple cooperating UAV teams

引用

Journal of Systems Science & Complexity 2015年第5期28卷 1000-1009页

作者： Xiaoxuan Hu Huawei Ma Qingsong Ye He Luo School of Management Hefei University of Technology Key Laboratory of Process Optimization and Intelligent Decision-making Ministry of Education

The problem of task assignment for multiple cooperating unmanned aerial vehicle(UAV) teams is considered. Multiple UAVs forming several small teams are needed to perform attack tasks on a set of predetermined ground targets. A hierarchical task assignment method is presented to address the problem. It breaks the original problem down to three levels of sub-problems: target clustering, cluster allocation and target assignment. The first two sub-problems are centrally solved by using clustering algorithms and integer linear programming, respectively, and the third sub-problem is solved in a distributed and parallel manner, using a mixed integer linear programming model and an improved ant colony algorithm. The proposed hierarchical method can reduce the computational complexity of the task assignment problem considerably, especially when the number of tasks or the number of UAVs is large. Experimental results show that this method is feasible and more efficient than non-hierarchical methods.

关键词： unmanned aerial vehicle （UAV） task assignment clustering integer linear programming ant colony optimization（ACO） algorithm

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：