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

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

来源：评论

学校读者我要写书评

暂无评论

Route selection for dangerous goods based on D numbers

Route selection for dangerous goods based on D numbers

引用

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

作者： Ningkui Wang Xiaozhong Huang Daijun Wei School of Science Hubei University for Nationalities Key Laboratory of Biologic Resources Protection and Utilization of Hubei Province

ISBN: (纸本)9781467397155

Route selection for dangerous goods transportation is a hot issue which involved in much uncertainty,fuzziness and *** this paper,D numbers theory is used in the route selection for dangerous goods to deal with these information,both complete and incomplete,qualitative and *** three main criteria "transportation cost","risk during the transportation" and "emergency response ability" are considered to evaluate the routes and dijkstra algorithm is used to find out the optional *** illustrative example is presented to demonstrate the effectiveness of the proposed method.

关键词： D numbers Route selection Dangerous goods Uncertainty Fuzziness dijkstra algorithm

来源：评论

学校读者我要写书评

暂无评论

Research on dynamic energy saving path planning algorithm based on real-time traffic information

Research on dynamic energy saving path planning algorithm ba...

引用

2016 4th International Conference on Advanced Materials and Information Technology Processing(AMITP 2016)

作者： Lin Liu Yibin Zhang Huizong Feng School of Automation Chongqing University of Posts and Telecommunications

Path planning is an important way to alleviate traffic congestion, but the traditional path planning algorithm can only tell us the shortest distance path. Meanwhile, the traffic information is dynamic and changes over time, so the initial optimal path is likely to be invalid when traffic conditions change. A dynamic energy saving path planning algorithm(DESPP) based on real-time traffic information is proposed in this paper, which can plan the energy saving path for driver dynamically. A dynamic road network model is designed to reflect the actual traffic condition, and then an extended dijkstra algorithm is elaborated, by setting the fuel consumption for the calculation of weight, changing the storage structure of road data, and using the improved quick sort algorithm to sort the weights, so that fast search to the adjacent node can be realized, then the dynamic energy saving path planning algorithm(DESPP) will be obtained. The simulation results show that DESPP algorithm is able to get the energy saving path correctly and effectively. It reduces about 15.19% of the total fuel consumption compared with the traditional dijkstra algorithm. The DESPP algorithm can be applied in finding energy saving path for navigation system, which is more suitable for the actual need of drivers.

关键词： path planning energy saving path real-time traffic information dijkstra algorithm

来源：评论

学校读者我要写书评

暂无评论

Improved Dynamic Double Mutation Particle Swarm Optimization for Mobile Robot Path Planning

Improved Dynamic Double Mutation Particle Swarm Optimization...

引用

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

作者： Linling Liao Xiushan Cai Huadong Huang Yanhong Liu College of Mathematics Physics and Information EngineeringZhejiang Normal University School of Electrical Engineering Zhengzhou University

ISBN: (纸本)9781467397155

This paper presents a new path planning approach,in which the MAKLINK graph is constructed to describe the complex environment of the mobile robot,the enumeration method ideas into dijkstra algorithm is used to obtain the shortest path,and the dynamic double mutation particle swarm optimization algorithm is adopted to get the optimal ***,simulation results are used to illustrate the validity of the proposed method.

关键词： Double mutation particle swarm path planning MAKLINK graph enumeration method dijkstra algorithm

来源：评论

学校读者我要写书评

暂无评论

Maklink Graph in Conflict-Free Airline Network Designing

Maklink Graph in Conflict-Free Airline Network Designing

引用

2016 4th International Conference on Machinery,Materials and Information Technology Applications(ICMMITA 2016)

作者： Yi-Ye Zhou Deng-Kai Yao Qian-Rui Sun Qi-Ke Wu Air Traffic Control and Navigation College Air Force Engineering University

ISBN: (纸本)9781510835467

This paper focuses on the issue of designing of conflict-free airline network Based on the free connecting lines and undirected graph structured by Maklink Graph method, a free airspace model was established, which provided alternative air passages for restricted airspace of airline network. Take the impact of restricted airspace on airline network into consideration, a fast airspace conflict detection algorithm was proposed to realize the whole airspace conflict detection for airline network, and invoked the dijkstra algorithm for path replanning of airlines to structure the drivable airline network with the consideration of restricted airspaces.

关键词： Maklink graph airline network obstacle avoidance dijkstra algorithm

来源：评论

学校读者我要写书评

暂无评论

The path planning for mobile robot based on bat algorithm

引用

INTERNATIONAL JOURNAL OF AUTOMATION AND CONTROL 2015年第1期9卷 50-60页

作者： Guo, Jinchao Gao, Yu Cui, Guangzhao Zhengzhou Univ Light Ind Dept Elect & Informat Engn Zhengzhou 450002 Henan Peoples R China

This article presents a novel method of global optimal path planning based on the dijkstra algorithm and bat algorithm. This method consists of three steps: the first step is establishing the working space of mobile robot by adopting the MAKLINK graph theory, the second step is utilising the dijkstra algorithm to obtain the sub-optimal path from the start point to the goal point, and the third step is adopting the bat algorithm to optimise the sub-optimal path so as to get the global optimal path of the robot. The result of the simulation experiment shows the proposed method is effective and can meet the real-time requirements of mobile robot. At the same time, the experiment also proves the optimal path planning of mobile robot based on bat algorithm is superior to particle swarm optimisation algorithm.

关键词： MAKLINK graph theory dijkstra algorithm path planning bat algorithm

来源：评论

学校读者我要写书评

暂无评论

Real Time Navigation algorithm Based on Every Vehicles Being Online

Real Time Navigation Algorithm Based on Every Vehicles Being...

引用

Computer and Computational Sciences (ICCCS)

作者： Qiang, Zeng Ning, Li Ang, Zeng Wuhan Univ Technol Dept Software Engn Wuhan Peoples R China Wuhan Univ Technol Dept Comp Sci & Technol Wuhan Peoples R China

ISBN: (纸本)9781479918195

This paper aims to solve the problem that the real-time information is not accurate enough to reflect real-time traffic in road network in the existing real-time navigation algorithm. This paper considers to put all or the majority of motor vehicles of an urban area into network through unified navigation equipments, the server can get real-time speed of all networked vehicles on each road, then the server obtain the travel time of each section from the average speed combined to the journey of section. The city map can be abstracted into a directed graph and the shortest path from a node to any other node can be calculated by using dijkstra algorithm. After filling the next hop addresses of these paths from one node to another node with the way of routing table, vehicle can obtain the shortest path list from a source node to a destination node in accordance with this when it request navigation. Systems real-timely monitor and count the vehicle speed on each section. The travel cost of a section can be determined to have changed when the change of speed is over a range, then the system recalculates the routing table related to the section to keep it in the optimal state of travel costs.

关键词： component navigation real time vehicle speed dijkstra algorithm routing table

来源：评论

学校读者我要写书评

暂无评论

Map-Matching Cell Phone Trajectories of Low Spatial and Temporal Accuracy 18

Map-Matching Cell Phone Trajectories of Low Spatial and Temp...

引用

18th IEEE International Conference on Intelligent Transportation Systems

作者： Schulze, Gunnar Horn, Christopher Kern, Roman Know Ctr GmbH Inffeldgasse 13-6 A-8010 Graz Austria

ISBN: (纸本)9781467365963

This paper presents an approach for matching cell phone trajectories of low spatial and temporal accuracy to the underlying road network. In this setting, only the position of the base station involved in a signaling event and the timestamp are known, resulting in a possible error of several kilometers. No additional information, such as signal strength, is available. The proposed solution restricts the set of admissible routes to a corridor by estimating the area within which a user is allowed to travel. The size and shape of this corridor can be controlled by various parameters to suit different requirements. The computed area is then used to select road segments from an underlying road network, for instance OpenStreetMap. These segments are assembled into a search graph, which additionally takes the chronological order of observations into account. A modified dijkstra algorithm is applied for finding admissible candidate routes, from which the best one is chosen. We performed a detailed evaluation of 2249 trajectories with an average sampling time of 260 seconds. Our results show that, in urban areas, on average more than 44% of each trajectory are matched correctly. In rural and mixed areas, this value increases to more than 55 %. Moreover, an in-depth evaluation was carried out to determine the optimal values for the tunable parameters and their effects on the accuracy, matching ratio and execution time. The proposed matching algorithm facilitates the use of large volumes of cell phone data in Intelligent Transportation Systems, in which accurate trajectories are desirable.

关键词： graph theory intelligent transportation systems mobile communication mobile computing search problems smart phones dijkstra algorithm base station cell phone data chronological order low spatial map matching cell phone trajectories road network search graph temporal accuracy tunable parameters Accuracy Base stations Cellular phones Global Positioning System Joining processes Roads Trajectory

来源：评论

学校读者我要写书评

暂无评论

PSO Based UAV Online Path Planning algorithms 2017

PSO Based UAV Online Path Planning Algorithms

引用

International Conference on Automation, Control and Robots (ICACR)

作者： Ou, Xiaoyu Liu, Yang Zhao, Yijing Vocat Educ Ctr Chongqing Peoples R China Beihang Univ Dept Automat Control Beijing Peoples R China

ISBN: (纸本)9781450363501

Path planning algorithms obtain an available flight path with threat avoidance independently. In this paper, an improved particle swarm optimization algorithm is proposed and applied to the real-time path planning of UAV based on the analysis of particle swarm optimization. The Chaos strategy prevents particles from getting into a local optimal, and dijkstra algorithm improves the quality of the path. In static mode, the experimental comparison between paths generated by classical particle algorithm and improved particle swarm algorithm proves that improvement strategy is effective. Path planning algorithms based on PSO, RRT (Rapidly-exploring random tree) and BLP (Bi-level programming) is compared in real-time mode to analyze the advantages and disadvantages of PSO based path planning

关键词： UAV Path planning PSO algorithm Logistic chaos model dijkstra algorithm

来源：评论

学校读者我要写书评

暂无评论

Good Choice of Transit Vessel Route Using Dempster-Shafer Theory

Good Choice of Transit Vessel Route Using Dempster-Shafer Th...

引用

International Siberian Conference on Control and Communications (SIBCON)

作者： Neumann, Tomasz Gdynia Maritime Univ Fac Nav Gdynia Poland

ISBN: (纸本)9781479971039

This paper presents a different perspective on the Dempster-Shafer Theory and dijkstra algorithm. In this paper algorithm will be used in the further analysis to find additional paths between nodes in the maritime sector. In many cases, the best solution for a single criterion is not sufficient. It would be the search for more effective solutions of the starting point to use for subsequent analysis or decision making by the captain of the ship. Using cutting-edge thinking mechanisms, it is possible to create a decision support system based on known dijkstra's algorithm. Reasoning mechanism is based on the Dempster-Shafer theory. The intervals were used.

关键词： Dempster-Shafer theory dijkstra algorithm ship route planning

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：