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

2016 IEEE 13th International Conference on Signal Processing（ICSP2016）

作者： Weihang Dong Wei Zhang Wei Yang Research Institute of Electronic Science and Technology of UESTC

Also named as the path-finding algorithm, the routing algorithm aims at finding a good way between the source point and destination point under some constraint conditions(the path "cost" is the lowest). Specifying part of necessary nodes by the algorithm, the node constraint routing algorithm finds the "good" path and must pass the necessary nodes without the loop;otherwise, the path is invalid. The node constraint shortest path problem is regarded one HP-Hard problem, and the current research generally adopts the violent algorithm or the screening function approach(screen out some paths passing the most of the currently necessary nodes);however, these methods have the loop or own much high time complexity or space complexity, which easily causes the intermittent interruption of the path loop or the network. For the end-to-end node constraint path-finding problem of the common directed network graph, this thesis designs one heuristic search algorithm based on the reinforcement learning the breadth-first traversal;the algorithm adopts thought of combining the breadth-first search and the greedy algorithm to expand the path, adopts the reinforcement learning to predict and screen the importance degree of the path as well and finally gets the path passing all the necessary nodes. The simulation experiments result demonstrates that the algorithm proposed by the thesis can be applicable to the network graph with the larger scale, has good performance in the path weight and the computing time and is regarded as one practically applicable algorithm.

关键词： node constraint routing algorithm reinforcement learning breadth first search shortest path algorithm

来源：评论

学校读者我要写书评

暂无评论

Any Angle path Finding in Stochastic Obstacle Scenes 19

Any Angle Path Finding in Stochastic Obstacle Scenes

引用

Proceedings of the 3rd International Conference on Advances in Artificial Intelligence

作者： Ufuk Aslan Ali Fuat Alkaya Serkan Yildirim Vural Aksakalli Computer Engineering Marmara University Istanbul Turkey Mathematical Sciences RMIT University Melbourne Australia

ISBN: (纸本)9781450372534

path planning with stochastic obstacles is well known researching area. The Canadian traveler problem (CTP) is a challenging stochastic optimization problem of traversing in a given graph having blocked edges and the disambiguation status of these edges can be settled with predefined probabilities. Discretized version of stochastic obstacle scene problem (D-SOSP) is most commonly used variant of CTP. The objective is to design a travel plan that would guarantee the shortest path including the obstacle disambiguation cost. In this work, we present Any-Angle (ANYA) path finding in discretized stochastic obstacle scenes using the exact algorithm AO* with caching (CAO*). The admissible upper bounds in the CAO* are found by making use of Dijkstra's shortest path. However, ANYA algorithm, being recently proposed, is already shown to outperform shortest path algorithms by investigating the interval sets. Our methodology is exhibited distinctly via computational examples involving a data map of navy forces minefield.

关键词： Canadian traveler problem AO* search shortest path algorithm Any-Angle path finding Stochastic obstacle scenes

来源：评论

学校读者我要写书评

暂无评论

An Efficient Route Computation Approach for Large Graphs

An Efficient Route Computation Approach for Large Graphs

引用

第三十届中国控制会议

作者： SONG Qing,WANG Xiaofan Department of Automation,Shanghai Jiao Tong University,and Key Laboratory of System Control and Information Processing,Ministry of Education of China,Shanghai 200240,P.R.China

The problem of efficient routing arises in several applications such as transportation problems and network *** increasing availability of large network data sets and the impact of networks on everyday life has set new standard to route computations,necessitating research for even faster and more accurate shortest path algorithms.A hierarchical graph model is developed based on an effective partition of graphs for decomposing the complex search problem.A new heuristic hierarchical routing algorithm is then proposed to significantly reduce the search space by pruning searches towards unpromising subgraph *** results on New York City road network demonstrate the performance of the algorithm.

关键词： shortest path algorithm Hierarchical Heuristics Large Graphs

来源：评论

学校读者我要写书评

暂无评论

Fast Train: A Computationally Efficient Train Routing and Scheduling Engine for General Rail Networks

Fast Train: A Computationally Efficient Train Routing and Sc...

引用

IEEE International Conference on Intelligent Transportation Systems

作者： Lingyun Meng Xuesong Zhou State Key Lab. of Rail Traffic Control & Safety Beijing Jiaotong Univ. Beijing China

ISBN: (纸本)9781479960798

A number of tactical and operational applications, such as train timetabling and dispatching, require sophisticated and computationally efficient software to optimize train schedules. An open-source train scheduling package, namely FastTrain has been designed and implemented to generate feasible schedules and optimality gap estimates for trains on a generic rail network with both single and double tracks. This paper describes its two major modelling components: (1) a network cumulative flow model to capture the complex safety rules of infrastructure resources, and (2) a Lagrangian relaxation solution framework which efficiently decomposes the original multi-trains complex model to a set of single train oriented subproblems. Two experimental cases based on the adapted datasets released by INFORMS RAS are conducted to demonstrate the effectiveness and efficiency of the developed algorithm under different network and data availability conditions.

关键词： public domain software rail traffic traffic engineering computing FastTrain open-source train scheduling package INFORMS RAS Lagrangian relaxation solution framework data availability condition general rail networks network availability condition network cumulative flow model train routing train scheduling Adaptation models Computational modeling Mathematical model Rails Safety Schedules Software Lagrangian Relaxation Resource Constraints shortest path algorithm Train Routing Train Scheduling

来源：评论

学校读者我要写书评

暂无评论

An algorithm to Calculate shortest AS paths under No-Valley and Prefer-Customer Policies

An Algorithm to Calculate Shortest AS Paths under No-Valley ...

引用

2011 4th IEEE International Conference on Computer Science and Information Technology(ICCSIT 2011)

作者： Wei Peng,Wenping Deng,Xiaofeng Hu,Jinshu Su School of Computer National University of Defense Technology Changsha,Hunan,410073,China

The no-valley and prefer-customer policies are two important routing policies to guarantee the safety and robustness of the inter-domain routing *** an AS(Autonomous System)topology,shortest path calculation in topology analysis must consider the two routing policies *** this paper,we propose a valley-free shortest path algorithm using the classic Dijkstra's algorithm *** algorithm nds shortest policy paths from other nodes to a speci ed destination in order to accomodate the routing *** real topology data sets from CAIDA,we compare the proposed algorithm with the Dijkstra's *** turns out that although the routing policies give rise to the complexity in calculating,the time complexity of the algorithm is approximate to that of the classic ***,we found that the differences of shortest path lengths with/without the policy constraints in the topology snapshots are decreasing with the evolution of the Internet.

关键词： inter-domain routing shortest path algorithm routing policy topology analysis

来源：评论

学校读者我要写书评

暂无评论

SGTNE: semi-global time of the next event algorithm 95

SGTNE: semi-global time of the next event algorithm

引用

Proceedings of the ninth workshop on Parallel and distributed simulation

作者： Azzedine Boukerche Carl Tropper School of Computer Science McGill University Montreal Canada H3A-2A7

ISBN: (纸本)9780818671203

This paper describes an extension of the TNE algorithm, the objective of which is to increase its parallelism and to break the inter-processor deadlocks inherent with the use of TNE. The algorithm, which we call the SGTNE algorithm (Semi Global TNE), is executed over a cluster of processors as opposed to TNE, which is executed over a cluster of processes assigned to a single processor. SGTNE helps to break the inter-processor deadlocks by executing a shortest path algorithm over a snapshot of the LPs in a cluster of processors. This paper discusses the algorithm and its implementation and reports on the performance results of simulations of a partitioned FCFS queueing network model executed on the Intel Paragon A4 multiprocessor machine. We also examine the impact of partitioning on the efficient implementation of the SGTNE algorithm. The results obtained indicate that SGTNE yields good speedups and that a partitioning which makes use of a strongly connected component algorithm results in a reduction of 30% in the running time of a simulation when compared to simple partitioning strategies. The results also indicate that SGTNE outperforms TNE.

关键词： discrete event simulation SGTNE partitioning parallel algorithms FCFS queueing network model inter-processor deadlock parallelism shortest path algorithm performance results

来源：评论

学校读者我要写书评

暂无评论

Study of Unmanned Aerial Vehicle Scheduling Disaster Rescue System

Study of Unmanned Aerial Vehicle Scheduling Disaster Rescue ...

引用

作者： Zhengyu Zhou Shuangzhi Li Qingyuan Zeng College of Information Science and Engineering Shandong Agricultural University

This paper designs to develop a transportable disaster response system named "DroneGo" through the deployment of drones,medical packages and containers to solve the problem of medical relief in the face of hurricane in Puerto ***,this paper aims to carry as many medical packages as *** the requirements of medical packages in disaster areas and the upper limit of the volume of ISO containers as constraints,adorned fleet and a set of medical packages meeting the requirements of Puerto Rico's hurricane scenario are obtained by using the integer programming ***,two optimal locations for the DroneGo disaster response system container were determined using the non-linear optimization,so as to be able to perform medical supply delivery and video reconnaissance on the road ***,simulated annealing algorithm and shortest path algorithm are adopted to plan the delivery route,schedule and flight plan of the *** on the analysis of the above problems,this paper establishes a viable "DroneGo" transportable disaster response ***,in case of future hurricane disasters exceeding the scale of existing disasters,the system established in this paper can still meet the medical relief needs brought by disasters after some minor adjustments.

关键词： Integer programming Nonlinear unconstrained extremum model DroneGo disaster response system shortest path algorithm

来源：评论

学校读者我要写书评

暂无评论

Research Design of Intelligent Tourist Guide System and Development of APP

Research Design of Intelligent Tourist Guide System and Deve...

引用

2015 2nd International Conference on Education,Management and Computing Technology(ICEMCT 2015)

作者： Kaijian Huang Junwu Zhu School of Information Engineering Yangzhou University Department of Computer Science and Engineering Nanjing University

ISBN: (纸本)9781510807587

The developing tourist industry proposes higher and higher demands to the intelligent tourist guide system, which can take place of the traditional artificial guide service. Functions of intelligent automatic interpretation, real time navigation, intelligent route planning and surrounding service reminder are included in it. With rapid development of electronic information technology and computer technology as the support, this thesis combines with the shortest path algorithm and related knowledge of graph theory to design algorithm and processing scheme. Moreover, this thesis also introduces research design of intelligent tourist system as well. Thus, the function of APP on the android platform is realized.

关键词： Guide Service Intelligent Tourist Guide System shortest path algorithm Android

来源：评论

学校读者我要写书评

暂无评论

Assessment methods for the targeted reconfiguration in distribution networks

Assessment methods for the targeted reconfiguration in distr...

引用

IEEE Eindhoven PowerTech Conference

作者： S. Toure E. Vanet R. Caire Y. Besanger Univ. Grenoble Alpes CNRS G2Elab Grenoble France

In this paper, we propose methods for minimizing power losses through dynamic reconfiguration. Two methods for determining the best sequence of configurations, while minimizing the total network losses and reconfiguration cost have been developed. The first method is based on a shortest path algorithm, whereas the second one is based on mixed integer linear programming. The algorithms are tested on an IEEE network with and without distributed generation;the results are presented and compared for the two different methods.

关键词： Dynamic Distribution Reconfiguration Problem shortest path algorithm Mixed Integer Linear Problem Distributed Generation

来源：评论

学校读者我要写书评

暂无评论

Loop-shaped cable distribution method for subscriber networks

引用

Electronics and Communications in Japan (Part I: Communications) 1998年第2期80卷

作者： Hisao Oikawa Chihaya Tanaka NTT Telecommunication Networks Laboratories Musashino Japan 180

Optical subscriber networks using wide bandwidth and low-loss fiber cables as infrastructures should be constructed promptly for providing ISDN services. From viewpoints of reliability and operability, the loop topology should be deployed as a cable distribution. Since considerable troublesome labor would be required for designing loop distribution networks, computer-aided design tools would be essential. This paper proposes the design method of the loop distribution based on the two shortest paths and discusses the design method of optical cable loop distribution with respect to the fundamental networks based on the nationwide data of underground facilities. The loop distributions for subscriber networks based on the collected data are evaluated. As the results, the following points are clarified: (1) in case of a small number of assigned fibers, the number of loops is small regardless of the regional conditions and the larger the number of assigned fibers, the larger the number of loops; (2) in small cities where large-scale future expansions are not expected, the loop structures remain almost unchanged and it is possible to install a large amount of fibers from the very beginning. © 1997 Scripta Technica. Inc. Electron Comm Jpn Pt 1, 80 (2): 12–23, 1997

关键词： subscriber network network topology fundamental networks loop distribution shortest path algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：