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

4th International Conference on Information Computing and Applications (ICICA)

作者： Li, Ying Li, Donghui Yu, Yaping Hebei Union Univ Coll Sci Tangshan 063009 Peoples R China

ISBN: (纸本)9783642537035;9783642537028

The problem of shortest path about multi-point which is based on Complex network model is a classical algorithm in graph theory;the theory is to find the optimal path among each pair of vertices. Firstly, the paper will introduce the research background and significance of the shortest path problem, and analyze the research status and development prospects of the subject;then, the paper will further described floyd algorithm of the shortest path problem, and give an example based on this algorithm;Finally, the paper will take main campus map of Hebei united university as a network model, Providing a scientific and rational basis for calculating for the realization of the system by the application of the floyd algorithm.

关键词： The Shortest Path Weighted Identification Net Model floyd algorithm

来源：评论

学校读者我要写书评

暂无评论

Application of Linear Programming Modeling in Multiwave Missile Launch

Application of Linear Programming Modeling in Multiwave Miss...

引用

作者： Qitong Ou Chenhong Du School of Applied Mathematics Xiamen University of Technology

Linear programming modeling is mainly concerned with solving the maximum or minimum value of a linear function under a group of linear constraints. It has been widely used in many subjects and fields. As an application example of linear programming, this paper decomposed two-wave salvo into three steps, used floyd algorithm and 0-1 programming to complete the task allocation model, and used Dijkstra algorithm to carry out path planning for the subsequent transfer of missile vehicles, and designed the transfer path with the highest survival rate.

关键词： Mathematical modelling Linear programming method 0-1 programming floyd algorithm Ant colony algorithm

来源：评论

学校读者我要写书评

暂无评论

ON THE OPTIMAL CONTROL OF BOOLEAN CONTROL NETWORKS

引用

SIAM JOURNAL ON CONTROL AND OPTIMIZATION 2018年第2期56卷 1321-1341页

作者： Zhu, Qunxi Liu, Yang Lu, Jianquan Cao, Jinde Zhejiang Normal Univ Coll Math Phys & Informat Engn Jinhua 321004 Peoples R China Fudan Univ Coll Math Sci Shanghai 200433 Peoples R China Southeast Univ Sch Math Nanjing 210096 Jiangsu Peoples R China Nantong Univ Sch Elect Engn Nantong 226000 Peoples R China Shandong Normal Univ Sch Math Sci Jinan 250014 Shandong Peoples R China

In this paper, we study the optimal control problem of Boolean control networks (BCNs). An optimal input-state transfer graph (OISTG) is defined for BCNs with cost in every stage. Optimal controllers are designed to minimize (or maximize) a given cost (or payoff) function over finite and/or infinite time horizon. In finite time horizon, a sufficient condition is derived for the optimal control problem, and an algorithm with the method of binary decomposition is proposed. Moreover, we prove the existence of optimal control for discounted problems over an infinite time horizon, and a new algorithm is presented to design corresponding optimal controllers. Compared with some existing methods, the new algorithm with OISTG can be used to reduce both space complexity and computational complexity in finding optimal controllers. Numerical examples are presented to illustrate the efficiency of the obtained results.

关键词： Boolean control networks floyd algorithm input-state transfer graph optimal control semitensor product

来源：评论

学校读者我要写书评

暂无评论

Efficient hybrid multicast approach in wireless data center network

引用

FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE 2018年 83卷 27-36页

作者： Zhu, Longting Wu, Jigang Jiang, Guiyuan Chen, Long Lam, Siew-Kei Guangdong Univ Technol Sch Comp Sci & Technol Guangzhou Guangdong Peoples R China Nanyang Technol Univ Sch Comp Sci & Engn Singapore Singapore

Large-scale data center suffers from overload of data traffic on some bottleneck links, due to the fact that cloud-based services are mostly accomplished by group communications with multicast traffic. This paper investigates techniques of wireless transmission using multiple channels, instead of single available communication channel as reported in existing works, to enhance the flexibility of congestion control, and at the same time, considers load balance of different links. The objective is to meet the communication demands with as little as possible total data traffic, while simultaneously optimizes the load balancing among different links. The proposed two-stage framework jointly optimizes the transmission paths for both wireless and wired communications. The first stage models the interference relation via contradiction graph such that each node of the graph represents an alternative of a wireless link, and an edge indicates that two wireless links cannot coexist due to interference. As a result, the problem of finding the optimal arrangement for wireless communication without interference is transformed into the problem of finding the maximum independent set on the obtained contradiction graph. Also, an efficient strategy is proposed in this paper to construct contradiction graph from the wireless data center network, and to find the maximum independent set (MIS) whose elements indicates the destination nodes to be served by wireless links. The second stage develops a load balance aware routing algorithm to serve the remaining traffic demands that have not been served by wireless links. Experimental results show that, the proposed approach can significantly minimize total data traffic while simultaneously balancing the traffic loads of different links. The maximum load is reduced by up to 58.97%, 56.15% and 25.62% on Fat-Tree, VL2 and BCube based wireless DCNs, in comparison to the state-of-the-art. (C) 2018 Elsevier B.V. All rights reserved.

关键词： Wireless data center networks Multi-channel Hybrid Multicast communication Contradiction graph floyd algorithm

来源：评论

学校读者我要写书评

暂无评论

A systematic framework of vulnerability analysis of a natural gas pipeline network

引用

RELIABILITY ENGINEERING & SYSTEM SAFETY 2018年 175卷 79-91页

作者： Su, Huai Zio, Enrico Zhang, Jinjun Li, Xueyi China Univ Petr Natl Engn Lab Pipeline Safety MOE Key Lab Petr Engn Beijing Key Lab Urban Oil & Gas Distribut Technol Beijing 102249 Peoples R China Politecn Milan Dipartimento Energia Via La Masa 34 I-20156 Milan Italy Univ Paris Saclay Chair Syst Sci & Energy Challenge Fdn Elect France EDF Lab LGICent Supelec Batiment Bouygues2eme Etage 3 Rue Joliot Curie F-91192 Gif Sur Yvette France

A systematic framework is developed to assess the vulnerability of natural gas pipeline networks. To measure the impact of accidents on gas supply service, a consequence model is developed based on a flow algorithm embedded into an optimization scheme, with the consideration of physical constraints. The vulnerability analysis is performed from three viewpoints: global vulnerability analysis, demand robustness and critical pipeline analysis. The global vulnerability analysis is performed considering hazards and threats in gas sources, demand and transmission system. The analysis of demand robustness evaluates the capacities of demand sites to withstand the strains imposed on the pipeline network system and further explains the differences in capacities, from a graph theory perspective. In the critical pipeline analysis, criticalities of pipelines are evaluated by considering direct attacks and using a physical flow-based method. The analyses are performed on a relatively complex gas pipeline network taken from literature. (C) 2018 Elsevier Ltd. All rights reserved.

关键词： Complex natural gas pipeline network Vulnerability analysis Supply service Mart-flow algorithm floyd algorithm Criticality analysis

来源：评论

学校读者我要写书评

暂无评论

floyd algorithm Based on the Shortest Path in GIS 1

引用

International Conference on Information and Business Intelligence (IBI 2011)

作者： Liao, Yv Mei Zhong, Jie Xinyu Univ Coll Mech Engn Xinyu 338004 Jiangxi Peoples R China Xinyu Televis Stn Xinyu 338000 Jiangxi Peoples R China

ISBN: (数字)9783642290848

ISBN: (纸本)9783642290831

GIS shortest path calculation of the key issues, using the floyd algorithm with traffic map any two points on the map to determine the existence of the path, calculate the route there is a path between any two points the distance. Gives a detailed GIS mapping and image display program, proved that the algorithm can quickly and easily retrieve the shortest path between two locations, saving computing time and overhead.

关键词： floyd algorithm shortest path GIS undirected graph

来源：评论

学校读者我要写书评

暂无评论

Multi-UAV Cooperative Patrol Task Planning Novel Method Based on Improved PFIH algorithm

引用

IEEE ACCESS 2019年 7卷 167621-167628页

作者： Qiao, Yukun Yang, Jie Zhang, Qi Xi, Jianxiang Kong, Lingyun Xijing Univ Coll Sci Xian 710123 Peoples R China Rocket Force Univ Engn Dept Automat Xian 710025 Peoples R China Chinese Peoples Liberat Army Unit 31102 Nanjing 210016 Peoples R China

This paper investigates the cooperative patrol task planning problems for multiple unmanned aerial vehicles by considering the patrol task requirements. A new cooperative patrol task planning approach is proposed to complete the patrol task. Firstly, the cooperative patrol task planning model for multiple unmanned aerial vehicles is established. Then, the corresponding complex constraint condition processing method with two steps is designed;that is, obtaining the initial result via floyd algorithm firstly and then generating the optimal solution by adopting the improved Push Forward Insertion Heuristic (IPFIH) algorithm. It is proved that the proposed algorithm can obtain feasible solutions that meet all constraints and maximize the patrol payoff under the limited resources conditions. Finally, a numerical simulation is provided to demonstrate the effectiveness of the proposed cooperative patrol task planning approach.

关键词： Multi-UAV patrol task planning floyd algorithm push forward insertion heuristic

来源：评论

学校读者我要写书评

暂无评论

Development of Path Planning Approach Based on Improved A-star algorithm in AGV System 3rd

Development of Path Planning Approach Based on Improved A-st...

引用

3rd European-Alliance-for-Innovation (EAI) International Conference on IoT as a Service (IoTaaS)

作者： Zhang, Yan Li, Ling-ling Lin, Hsiung-Cheng Ma, Zewen Zhao, Jiang Hebei Univ Sci & Technol Sch Elect Engn Shijiazhuang 050018 Hebei Peoples R China Hebei Univ Technol Dept Elect Informat Engn Tianjin 300130 Peoples R China Natl Chin Yi Univ Technol Dept Elect Engn Taichung 41170 Taiwan

ISBN: (纸本)9783030004101;9783030004095

Automate guide vehicle (AGV) has been widely applied in industry. Therefore, it is important to design a highly efficient AGV. The path planning is known as one of the key factor for AGV operation. Although typical A-star algorithm with a heuristic mechanism can be used in the shortest path searching, it may suffer from broken lines and redundant nodes. In this paper, an improved A-star algorithm is presented. Based on the initial path planned by A-star algorithm, traversing all the nodes on an initial path and deleting unnecessary nodes and connections, the proposed model can remove the superfluous inflection points and redundant nodes effectively so that no obstacles exist during AGV moving. The performance results reveal that the proposed method can provide more efficient path planning with a shorter route and less turn times.

关键词： Automate guide vehicle (AGV) A-star algorithm floyd algorithm Path planning

来源：评论

学校读者我要写书评

暂无评论

Graph Based RRT Optimization for Autonomous Mobile Robots 8th

Graph Based RRT Optimization for Autonomous Mobile Robots

引用

8th International Conference on Intelligence Science and Big Data Engineering (IScIDE)

作者： Aguilar, Wilbert G. Sandoval, David S. Caballeros, Jessica Alvarez, Leandro G. Limaico, Alex Rodriguez, Guillermo A. Quisaguano, Fernando J. Univ Las Fuerzas Armadas ESPE CICTE Res Ctr Sangolqui Ecuador Escuela Politec Nacl FIS Fac Quito Ecuador Univ Politecn Cataluna GREC Res Grp Barcelona Spain

ISBN: (纸本)9783030026981;9783030026974

In this article, we present the application of Graph Theory in the development of an algorithm of path planning for mobile robots. The proposed system evaluates a RRT algorithm based on the individual cost of nodes and the optimized reconnection of the final path based on Dijkstra and floyd criteria. Our proposal includes the comparisons between different RRT* algorithms and the simulation of the environments in different platforms. The results identify that these criteria must be considered in all the variations of RRT to achieve a definitive algorithm in mobile robotics.

关键词： RRT Mobile robots Dijkstra algorithm floyd algorithm Path planning

来源：评论

学校读者我要写书评

暂无评论

An Indoor Autonomous Guided Vehicle Based on Electromagnetic Tracking and Positioning Ibeacon 30

An Indoor Autonomous Guided Vehicle Based on Electromagnetic...

引用

30th Chinese Control and Decision Conference (CCDC)

作者： Luo, Jiaping Chen, Mingyun Li, Jiapeng Wei, Yongtao Hu, Yuchen Northeastern Univ Sch Control Engn Qinhuangdao 066000 Hebei Peoples R China

ISBN: (纸本)9781538612446

In order to further improve the efficiency of indoor unmanned transport, a low-power and efficient navigation and positioning system is designed. The system combines the advantages of the detecting method of electromagnetic signals and the indoor positioning technology based on Bluetooth Low Energy (BTLE). By analyzing the magnetic field model, common inductance coils are used as a sensor to detect the magnetic field, and the differential steering mechanism of the motor is controlled by the tracking characteristics of the dual- inductive electromagnetic sensor. For GPS can not provide satisfactory indoor positioning results, on the basis of the electromagnetic tracking system combined with the indoor positioning technology based on spatial information mode, a stable and independent indoor positioning system is finally realized. And with the predetermined electromagnetic track crossing point, the dead reckoning accumulated error for signpost is revised. The experimental results show that the system can achieve stable operation, and the system design is reasonable and basically meets the design goals and users' needs.

关键词： Electromagnetic Sensor RSSI Indoor Positioning System Electromagnetic Tracking floyd algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：