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

13th International Symposium on Symbolic and Numeric algorithms for Scientific Computing (SYNASC)

作者： Jevtic, Vesna Dobrilovic, Dalibor Stojanov, Jelena Stojanov, Zeljko Univ Novi Sad Tech Fac Mihajlo Pupin Zrenjanin Serbia

ISBN: (纸本)9780769546308

This paper presents project duration assessment model based on modification of shortest path algorithms and superposition. One of the shortest path algorithms, Dijkstra algorithm, is modified in order to find the longest path. This is used for critical path calculation, i.e. for resolving project duration assessment problem. Another modification of algorithm calculates subcritical path as the second longest one. These paths are used for superposition, because of stochastic nature of many research and development projects which can cause that at some point in time subcritical becomes critical path. Thus, subcritical path influence on project duration should be taken into account, and, in this case, superposition is used for that. Superposition used in the model is based on analytical method - Clark's formulas. Presented model can be used for business process improvement and project management support.

关键词： component project duration assessment shortest path algorithm superposition Clark's formulas

来源：评论

学校读者我要写书评

暂无评论

Network-tree model and shortest path algorithm

Network-tree model and shortest path algorithm

引用

International Conference on Computational Science (ICCS 2003)

作者： Tan, GZ Han, XJ Gao, W Dalian Univ Technol Dept Comp Sci & Engn Dalian 116024 Peoples R China Chinese Acad Sci Comp Technol Inst Beijing 100080 Peoples R China

ISBN: (纸本)3540401962

For the first time, this paper proposes the Network-Tree Model (NTM), route optimization theory and wholly new, high performance algorithm for shortest path calculation in large-scale network. We first decompose the network into a set of sub-networks by adopting the idea of multi-hierarchy partition and anomalistic regional partition, and then construct the NTM and the Expanded NTM. The Network-Tree shortest path (NTSP) algorithm presented in this paper narrows the searching space of the route optimization within a few sub-networks, so it greatly reduces the requirements for main memory and improves the computational efficiency compared to traditional algorithms. Experiment results based on grid network show that NTSP algorithm achieves much higher computational performance than Dijkstra algorithm and other hierarchical shortest path algorithms.

关键词： nNetwork-tree model shortest path algorithm large-scale network route optimization algorithm

来源：评论

学校读者我要写书评

暂无评论

Research on online scheduling and charging strategy of robots based on shortest path algorithm

引用

COMPUTERS & INDUSTRIAL ENGINEERING 2021年 153卷 107097-107097页

作者： Fu, Xiao Cheng, Zongmao Wang, Jiaxin Hangzhou Dianzi Univ Zhejiang Informatizat Dev Inst Hangzhou 310018 Peoples R China Hangzhou Dianzi Univ Inst Appl Math Hangzhou 310018 Peoples R China China Acad Art Sch Chinese Painting & Callig Hangzhou 310002 Peoples R China

In recent years, the employment of mobile chargerson energy supplementation of mobile charger (MC) has received increasing attention. This paper focuses on the online scheduling and charging strategies of robots in warehouses with unknown moving paths. First, the storage scenario is abstracted to a grid model in this article. Secondly, a shortest path algorithm based on coordinate difference under the premise of giving priority to the robot task is proposed. Then, the minimum service quantity of MC is determined through random simulation. Last but not least, the model of M/M/n/infinity/m/FCFS is used to calculate the average charging delay of the robot. Through simulation analysis, it can be found that the average service rate of MC is inversely proportional to the average charging delay of the robot. As time increases, the number of charging requests received by the MC also rises linearly. However, in a fixed length of time of Delta t, the number of charging requests is approximately a fixed value. Moreover, there is a linear positive correlation between the number of charging requests received by the MC and the total number of robots. When the total number of robots stays unchanged, the more MCs in the warehouse, the smaller the average charging delay of the robot will be yet with lower bound. The robot online scheduling and charging strategy proposed in this paper is applicable for most storage scenarios. Further, it contributes a new idea for further research on robot mobile charging scheduling strategy.

关键词： Mobile chargers Task priority shortest path algorithm Online scheduling Charging delay

来源：评论

学校读者我要写书评

暂无评论

Implementation of K-shortest path algorithm in GPU Using CUDA

引用

Procedia Computer Science 2015年 48卷 5-13页

作者： Avadhesh Pratap Singh Dhirendra Pratap Singh M. Tech Scholar MANIT Bhoapl MP India Assistant Professor MANIT Bhoapl MP India

K-shortest path algorithm is generalization of the shortest path algorithm. K-shortest path is used in various fields like sequence alignment problem in molecular bioinformatics, robot motion planning, path finding in gene network where speed to calculate paths plays a vital role. Parallel implementation is one of the best ways to fulfill the requirement of these applications. A GPU based parallel algorithm is developed to find k number of shortest path in a positive edge-weighted directed large graph. In calculated shortest path repetition of the vertices is not allowed. Implemented algorithm calculates a k-shortest path between two pair of vertices of a graph with n nodes and m vertices. This approach is based on Yen's algorithm to find k-shortest loopless path. We implemented our algorithms in Nvidia's GPU using Compute Unified Device Architecture (CUDA). This paper presents comparative analysis between CPU and GPU based implementation of Yen's algorithm. Our approach achieves the 6 time speed up in comparison of serial algorithm.

关键词： Compute Unified Device Architecture (CUDA) Graphical Processing Unit (GPU) shortest path algorithm Parallel algorithm.

来源：评论

学校读者我要写书评

暂无评论

path Planning of A Four-Rotor Aircraft Based on shortest path algorithm and Statistical Analysis

Path Planning of A Four-Rotor Aircraft Based on Shortest Pat...

引用

International Conference on Fuzzy Systems and Knowledge Discovery

作者： Tianwei Shi Hong Wang Fuwang Wang School of Mechanical Engineering and Automation Northeastern University

ISBN: (纸本)9781467352512

Nowadays, the four-rotor aircraft path planning is an important research subject. To control the single four-rotor aircraft, we propose a path pre-planning algorithm and integrate the shortest path algorithm and the statistical analysis method into the algorithm. According to the certainty of path planning, we set the pre-planned paths in the electronic map for 3-d coordinate as trajectories. The aircraft gets the valid data from the three-dimensional coordinate. Then it adjusts the attitude and position in real-time to complete the path planning by using the data. In this paper, the algorithm improves the aircraft control accuracy and stability. We apply the path pre-planning algorithm to the four-rotor aircraft and verify the algorithm with simulations. The results of simulations show the accuracy and feasibility of the algorithm.

关键词： shortest path algorithm Statistic analysis path pre-planning algorithm Four-rotor aircraft

来源：评论

学校读者我要写书评

暂无评论

The Middle of the Specified Node Set of shortest path algorithm

The Middle of the Specified Node Set of Shortest Path Algori...

引用

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

作者： Jie Jia Jeng-Shyang Pan Hua-Rong Xu Innovative Information Industry Research Center Shenzhen Graduate SchoolHarbin Institute of Technology IIIRCHITSZ Fujian Provincial Key Lab of Big Data Mining and Applications Fujian University of Technology Innovative Information Industry Research Center Shenzhen Graduate SchoolHarbin Institute of Technology Department of Computer Science and Technology Xiamen University of Technology CSTXMUT

the vast majority of researches about the shortest path algorithm, nowadays, focus just on the case starting from the beginning point and ending at the ending point. If additional condition that the shortest path must go through some given nodes of which number is uncertain must be met, then most of the existing classic algorithms are not applicable. A general method based on the Virus Co-Evolutionary Genetic algorithm and greedy algorithm is presented to solve this kind of problem. The time complexity of the algorithm is given by theoretical analysis and the effectiveness of the algorithm is verified by programming calculation. Furthermore, this algorithm in HUAWEI Code Craft 2016 makes 17 th score in preliminary to the semi-finals.

关键词： shortest path algorithm VEGA greedy algorithm path planning

来源：评论

学校读者我要写书评

暂无评论

A Hybrid shortest path algorithm for IKEA Warehousing System

A Hybrid Shortest Path Algorithm for IKEA Warehousing System

引用

2017 2nd International Conference on Computational Modeling, Simulation and Applied Mathematics（CMSAM 2017)

作者： Si-yu TIAN Yu XIA Northeastern University

shortest path algorithms can be utilized to find the shortest distance between one vertex to another in a graph for logistics applications. In IKEA warehouses, the efficiency is reduced when customers squander time repeating routes in picking up their desired furniture. The shortest path algorithm implemented in this paper is to be a proper means of demonstrating the most efficient route with restricted intermediate nodes for customers. Since the traditional shortest path algorithm presents random intermediate nodes along the shortest path from entrance to exit. We proposed a shortest path algorithm that is suited to this circumstance as we used Greedy algorithm to divide the original problems into three, as well as Dijkstra algorithm for calculating the shortest distance between two nodes. The data required in the Dijkstra algorithm is stored in IKEA warehousing relational database which is designed in this paper for simulation.

关键词： IKEA Warehousing Relational database Graph theory shortest path algorithm Greedy algorithm Dijkstra algorithm

来源：评论

学校读者我要写书评

暂无评论

Basic on WebGIS technology a shortest path algorithm in logistics and distribution of the applied research

Basic on WebGIS technology a shortest path algorithm in logi...

引用

International Conference on Consumer Electronics, Communications and Networks

作者： Chao Guo Wenhua Li College of Information Science & Technology Hainan University Network and education technology center Hainan University

ISBN: (纸本)9781457714146

In Current, physical distribution allocation has the problem that efficiency is not high, But this article mainly through analyzes the most short-path's two algorithms in the WebGIS technology: The classic Dijkstra algorithm and Ant Colony algorithm, And improvement through its to establish a more reasonable based on WebGIS logistics distribution system, And then through the analysis of the algorithm, Investigate Application in the Logistics and distribution system.

关键词： WebGIS shortest path algorithm Logistics and distribution problems

来源：评论

学校读者我要写书评

暂无评论

Implementation of shortest path planning algorithm without track using FPGA Robot: A New approach

Implementation of Shortest path planning algorithm without t...

引用

International Conference on Advances in Electrical Engineering (ICAEE)

作者： Chinnaiah, M. C. DivyaVani, G. SatyaSavithri, T. Rajeshkumar, P. Padmasri Dr BV Raju Inst Technol Dept ECE Tuljarampet AP India Coll Engn JNTU Dept ECE Hyderabad Andhra Pradesh India PVP Siddhartha Inst Technol Dept ECE Vijayawada AP India

ISBN: (纸本)9781479935420

This paper presents a shortest path algorithm for FPGA based robot which can assist in industrial environment for various tasks. When a desired task is assigned to the robot, it chooses a shortest path from the source to the destination. path planning is an important issue for an autonomous robot to fulfill any desired task. Today many robots implement the path planning depending on the track, but practically track doesn't exists. So path planning with track is not a right choice. This paper overcomes tracking path issues, estimates the exact position, and improves effective localization and accuracy using land mark determination (RFID). With the help of ultrasonic sensors, the robot overcomes all the obstacles in its path. By using obstacle avoidance approach, a robot can perform a desired task using optimal resources. When a navigation task is assigned to the robot, it starts from there evaluating shortest distance to reach the destination. The proposed Robot is incorporated with Xilinx board XC3S500E (FPGA Spartan 3E) and RFID reader which checks the signal from RFID tags to localize the robot with respect to global position. The destination location is received from the remote location and the shortest path is computed by algorithm. The Implementation results have been shown and estimation of shortest path is done successfully.

关键词： shortest path algorithm RFID (Radio frequency identification) Ultrasonic sensors FPGA

来源：评论

学校读者我要写书评

暂无评论

Improvisation of QoS in SDN-Frame Work for UAV Networks Using Dijkstra shortest path Routing algorithm 1

Improvisation of QoS in SDN-Frame Work for UAV Networks Usin...

引用

1st IEEE International Conference on Ambient Intelligence, Knowledge Informatics and Industrial Electronics, AIKIIE 2023

作者： Mathapati, Mahantesh Nandihal, Priya Mishra, Priti Kotagi, Veeranna Dept.of Cse Bengaluru India Dayananda Sagar Academy of Technology and Management Dept of Computer Science and Engineering Bangalore India Information Science and Engineering Atria Institute of Technology Bengaluru India Nitte Meenakshi Institute of Technology Dept. of Ise Bengaluru India

ISBN: (纸本)9798350316469

This work presents a unique SDN-based Dijkstra shortest path routing algorithm for QoS improvisation in UAV Networks. It discusses the various problems pertaining to the networking of unmanned aerial vehicles in disaster rescue operations and unique networking algorithmic solutions to the problems. Involving the SDN technology in networks provides faster service delivery than the traditional technology, as it isolates the control plane and data plane. This SDN technology has the centralised governing management service on the distributed network that affords improved security. But, SDN with Wireless Sensor Network (WSN) does not provide enhanced Quality of Services (QoS) in sophisticated cloud computing (CC) applications. Across the research community, end-users seek to attain a QoS while accessing the cloud-based services depending on their knowledge in using today's technology. Therefore, this research study is aimed to prioritize the cloud application data without any delay from the normal data and also to provide the fastest communication using the SDN framework applying shortest path routing. The traditional networking infrastructure's speed, scalability, and agility are increased by the key functionality of SDN, which is used to intellectual the network information from the applications. Moreover, massive size data are managed and customized by using OpenContrail, which is a more responsive and scalable network. The QoS provided by the SDN with cloud-based services using shortest path, stimulates this research to apply the integrated technology in UAV. UAV can transfer the data through cloud service using SDN, in order to maintain a communication with remote experts. The proposed shortest path (SP) direction-finding algorithm provides appropriate deployment & connectivity to the modules of group of UAVs, also decreases time delay within the network. The simulation results reveal that the proposed technique is suitable and more effective to set up an emergency

关键词： Cloud Computing OpenStack Quality of Service shortest path algorithm Software-Defined Networking UAV

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：