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

2016 6th International Conference on Machinery,Materials,Environment,Biotechnology and Computer(MMEBC 2016)

作者： Xiaoyong Xu Jiquan Zhou Twenty-eighth Research Institute of China Electronic Technology Group Corporation

This paper gives a detailed analysis of the existing city shortest path algorithm[1], aiming at the high time complexity and can not represent the real situation of the problem of the existing city shortest path selection algorithm, and bases on the idea of dijkstra algorithm, puts forwarda fast algorithm of optimal path of the cityThis algorithm can be considered to simulate the real situation may in the road grade, the degree of congestion, traffic light quantity and other factors, at the same time can be optimized in the time complexity of the algorithm, to achieve the shortest path fast searchThe experimental results show that this method can simulate the real situation in as far as possible under the condition, reduces the time complexity of the algorithm, and get feasible result.

关键词： Optimal path Time complexity dijkstra algorithm

来源：评论

学校读者我要写书评

暂无评论

Implementation of intelligent fire evacuation route based on Internet of things

Implementation of intelligent fire evacuation route based on...

引用

2015 IEEE Advanced Information Technology,Electronic and Automation Control Conference(IAEAC 2015)

作者： Zheng Weifang Cai Qiang HangZhou DianZi University Yangze Delta Region Institute of Tsinghua University

ISBN: (纸本)9781479919819

Improved dijkstra algorithm was applied to the buildings' intelligent evacuation path *** defining and describing attribute characteristics of network nodes about the architectural space and the evacuation passageway,and then according to the fire information,the optimal evacuation path was ***,the optimal path of each node information and evacuation marks associated with the database to realize the data transmission of the path optimization algorithm and fire linkage control system and to achieve integration with the intelligent evacuation system as well.

关键词： dijkstra algorithm building fire intelligent evacuation path optimization

来源：评论

学校读者我要写书评

暂无评论

Traffic Flow Pattern Based Approach to Predict Real Driving Emission Test Routes

引用

GAZI UNIVERSITY JOURNAL OF SCIENCE 2023年第3期36卷 1339-1349页

作者： Aydin, Muhammet Sorusbay, Cem Arslan, Hikmet Istanbul Tech Univ Fac Mech Engn TR-34469 Maslak Istanbul Turkiye

Due to the poor representation of NEDC emission test, the European Commission put into the force a new procedure, which contains both a laboratory test and a real word driving test. In this new test procedure, even though WLTC replaces NEDC, it is required to test the vehicle under real traffic conditions, which contains urban, rural and highway segments. Due to the new emission regulation, considerable number of academic work focus on the creation of RDE (Real Driving Emission) routes and RDE tests. In this study, it is introduced a new methodology for creating potential RDE routes. The routes, created in MATLAB code by using Istanbul road data containing a half an hour average trip records were used to predict a probable RDE test road. This model creates a number of RDE routes starting from defined coordinates and then analyses all alternative routes with respect to traffic flow rate and RDE boundary conditions identified by the European Commission. The routes obtained using the methodology developed are tested in real life conditions and evaluated according to actual existing traffic conditions. The agreement between the results of the method and the results of the actual driving test is limited in urban road section. However, for rural and highway road sections, there is a significant agreement between the predictions and actual test results.

关键词： Emission test Real driving emissions dijkstra algorithm

来源：评论

学校读者我要写书评

暂无评论

An Energy-Efficient Clustering Routing Protocol Based on a High-QoS Node Deployment with an Inter-Cluster Routing Mechanism in WSNs

引用

SENSORS 2019年第12期19卷 2752.-2752.页

作者： Xu, Kaida Zhao, Zhidong Luo, Yi Hui, Guohua Hu, Liqin Hangzhou Dianzi Univ Sch Commun Engn Hangzhou 310018 Zhejiang Peoples R China Hangzhou Dianzi Univ Hangdian Smart City Res Ctr Zhejiang Prov Hangzhou 310018 Zhejiang Peoples R China Hangzhou Dianzi Univ Coll Elect & Informat Hangzhou 310018 Zhejiang Peoples R China Zhejiang A&F Univ Sch Informat Engn Key Lab Forestry Intelligent Monitoring & Informa Linan 311300 Peoples R China Zhejiang Coll Construct Dept Construct Engn Hangzhou 311231 Zhejiang Peoples R China

Currently, wireless sensor network (WSN) protocols are mainly used to achieve low power consumption of the network, but there are few studies on the quality of services (QoS) of these networks. Coverage can be used as a measure of the WSN's QoS, which can further reflect the quality of data information. Additionally, the coverage requirements of regional monitoring target points are different in real applications. On this basis, this paper proposes an energy-efficient clustering routing protocol based on a high-QoS node deployment with an inter-cluster routing mechanism (EECRP-HQSND-ICRM) in WSNs. First, this paper proposes formula definitions for information integrity, validity, and redundancy from the coverage rate and introduces a node deployment strategy based on twofold coverage. Then, in order to satisfy the uniformity of the distribution of cluster heads (CHs), the monitoring area is divided into four small areas centered on the base station (BS), and the CHs are selected in the respective cells. Finally, combined with the practical application of the WSN, this paper optimizes the dijkstra algorithm, including: (1) nonessential paths neglecting considerations, and (2) a simultaneous introduction of end-to-end weights and path weights, achieving the selection of optimal information transmission paths between the CHs. The simulation results show that, compared with the general node deployment strategies, the deployment strategy of the proposed protocol has higher information integrity and validity, as well as lower redundancy. Meanwhile, compared with some classic protocols, this protocol can greatly reduce and balance network energy consumption and extend the network lifetime.

关键词： wireless sensor network network coverage quality of services inter-cluster routing mechanism dijkstra algorithm

来源：评论

学校读者我要写书评

暂无评论

Shortest Path algorithm in Dynamic Restricted Area Based on Unidirectional Road Network Model

引用

SENSORS 2021年第1期21卷 203-203页

作者： Wei, Haitao Zhang, Shusheng He, Xiaohui Zhengzhou Univ Sch Earth Sci & Technol 75 Daxue North Rd Zhengzhou 450052 Peoples R China

Accurate and fast path calculation is essential for applications such as vehicle navigation systems and transportation network routing. Although many shortest path algorithms for restricted search areas have been developed in the past ten years to speed up the efficiency of path query, the performance including the practicability still needs to be improved. To settle this problem, this paper proposes a new method of calculating statistical parameters based on a unidirectional road network model that is more in line with the real world and a path planning algorithm for dynamically restricted search areas that constructs virtual boundaries at a lower confidence level. We conducted a detailed experiment on the proposed algorithm with the real road network in Zhengzhou. As the experiment shows, compared with the existing algorithms, the proposed algorithm improves the search performance significantly in the condition of optimal path under the premise of ensuring the optimal path solution.

关键词： navigation unidirectional road network statistical parameter path planning restrict search area dijkstra algorithm

来源：评论

学校读者我要写书评

暂无评论

Research on the optimum path——Taking the hospital delivery robot as an example

Research on the optimum path——Taking the hospital delivery...

引用

作者： Guodong Liu BSc Computer Science University College London

Medical delivery robot refers to the delivery robot used in the medical *** with ordinary delivery robots,the medical delivery robot needs to work in an environment with many people,which means that it needs to deal with many random obstacles at any *** article will discuss automatically avoiding obstacles,and formulate and compare algorithms to analyze the advantages and disadvantages of automatic road exploration algorithms of different *** order to accomplish this goal,this paper will use Matlab as the main development tool and use the A-star algorithm and the Euclid algorithm as the main heuristics in the main mathematical model of the *** program needs to be able to complete the obstacle avoidance task in a map with random size,random position,random shape,and random number of obstacles,and be able to reach the end point from the starting *** addition,this paper will also discuss the efficiency of the A-star algorithm and the dijkstra algorithm in obstacle avoidance and route planning,and demonstrate why the A-star algorithm is more efficient by taking time and congestion indicators.

关键词： delivery robot pathfinding robot A~* algorithm dijkstra algorithm

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Shortest Path algorithm within Dynamic Restricted Searching Area in City Emergency Rescue

Shortest Path Algorithm within Dynamic Restricted Searching ...

引用

2010 IEEE International Conference on Emergency Management and Management Sciences(ICEMMS)

作者： Fanliang Bu,Hui Fang Department of Engineering of Security &Protection System Chinese People’s Public Security University Beijing,China

When city emergencies happen,one of the most important tasks of emergency rescue is to find the shortest path to the emergency in shortest time,scientific and rational path plays an important role in improving rescue *** to the needs of city emergency rescue and basing on the analysis of the classical algorithm for solving the shortest path problem (dijkstra algorithm),this article discusses an improved algorithm within dynamic restricted searching area which dynamically changes the direction of the search and restricts the searching *** new method reduces time and space complexity and improves the efficiency of the *** the end of the article,it improves the practicality and reliability of this improved algorithm by simulation.

关键词： emergency rescue dijkstra algorithm dynamic searching

来源：评论

学校读者我要写书评

暂无评论

AN INDOOR ROUTE PLANNING METHOD WITH ENVIRONMENT AWARENESS

AN INDOOR ROUTE PLANNING METHOD WITH ENVIRONMENT AWARENESS

引用

IEEE International Geoscience and Remote Sensing Symposium

作者： Yan Zhou Hong Chen Yueying Huang Yunxin Luo Yeting Zhang Xiao Xie Institute of Remote Sensing Big Data Big Data Research Center of UESTC Chengdu China School of Resources and Environment University of Electronic Science and Technology of China (UESTC) Mapping and Remote Sensing Wuhan University Wuhan China Research Center for Industrial Ecology & Sustainability Chinese Academy of Sciences Shenyang China

Aiming at satisfying the users' navigation requirements in complex indoor environments, an indoor route planning method with environment awareness is proposed in this paper. Considering the accessibility, simplicity and comfortable experience of user's navigation, the paper first describes the modeling method of indoor navigation network and defines the expressions of indoor environment semantics. And then a navigation cost function is presented, which includes environment semantics such as path complexity, crowded degree and blocking events into indoor navigation network model. Finally, this paper proposes an optimal indoor route planning method by introducing the navigation cost function and environment semantics into traditional dijkstra algorithm. The experimental results show that the proposed method can effectively enhance the user's comfort experience in indoor navigation.

关键词： Environment semantics Indoor route planning dijkstra algorithm Indoor navigation

来源：评论

学校读者我要写书评

暂无评论

Retiming Technique for Clock Period Minimization using Shortest Path algorithm

Retiming Technique for Clock Period Minimization using Short...

引用

International Conference on Computing, Communication and Automation

作者： Vinita Pandey S.C. Yadav Priya Arora ECE Deptt. Graphic Era University Dehradun India CS Deptt. Graphic Era University Dehradun India

ISBN: (纸本)9781509016679

VLSI technology requires three main factors high speed, less power and small chip area. Speed is the factor which always depends upon clock frequency. Computation time of digital circuit can be reduced by applying transformation of delay that is retiming to digital signal block, which can be applied to digital signal processing blocks that can reduce computation time. For transformation ofdelay we need critical path and shortest path computation algorithm. Clock period minimization techniques of retiming used to minimize clock period of the circuit like Infinite impulse response,Finite impulse respons (IIR,FIR) filters. We have computed critical path before applying retiming in circuit, it gives us an estimation of computing time. Shortest path algorithms are required in the circuit for solving shortest path problem in the graph. We are explaining clock period minimization technique of retiming to enhance speed and proposing new shortest path algorithm. Existing method contain Floyd-Warshall(all pair shortest path) and Bellman Ford algorithms (single point shortest path)which are used in retiming .We are giving new dijkstra algorithm(single point shortest path algorithm)instead of bellman ford algorithm because it has less run time complexity and high speed. We also observed that most of filter data flow graph are sparse. Then we have chosen Johnson algorithm (all pair shortest path) because run time complexity of it is less than Floyd-Warshall which are existing algorithm. For this purpose used CAD tool for computing run time complexity of overall algorithm.

关键词： Critical-path Data flow graph(DFG) Bellman-Ford algorithm Floyd-Washall algorithm Johnson algorithm dijkstra algorithm greedy strategy Sparse graph

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：