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

3rd International Conference on Advances in Computing, Communications and Informatics (ICACCI)

作者： Bedi, Punam Jindal, Vinita Univ Delhi Dept Comp Sci Delhi 110007 India

ISBN: (纸本)9781479930807

Big Data technology is becoming ubiquitous and depicting key attention of researchers in almost all areas. VANET is a special form of MANET that uses vehicles as nodes in a network. By applying Big Data technologies to Vehicular Adhoc Network (VANET), one can gain useful insight from a huge amount of operational data, to improve traffic management processes such as planning, engineering and operations. VANETs access large data during the real time operations. In this paper we map VANET characteristics to Big Data attributes stated in literature. Further, we evaluate the performance of dijkstra algorithm used for routing in vehicular networks on Hadoop Map Reduce standalone distributed framework as well as on multi node cluster with 2, 3, 4 and 5 nodes respectively. The results obtained confirm that increasing the number of nodes in Hadoop framework, processing time for the algorithm is greatly reduced.

关键词： Big Data Hadoop Map Reduce VANETs dijkstra algorithm GSR Shortest Path Distributed computing

来源：评论

学校读者我要写书评

暂无评论

A Suboptimal Routing algorithm for Massive LEO Satellite Networks

A Suboptimal Routing Algorithm for Massive LEO Satellite Net...

引用

International Symposium on Networks, Computers and Communications (ISNCC)

作者： Liu, Yilun Zhu, Lidong Univ Elect Sci & Technol China Natl Key Lab Sci & Technol Commun Chengdu Sichuan Peoples R China

ISBN: (纸本)9781538637784

In a massive Low Earth Orbit(LEO) satellite network without inter-satellite links(ISLs), connection between source node and destination node can be established through satellite-ground links. Utilizing satellite network topology in time virtualization algorithm and assuming that the current traffic of satellite-ground links which is used as the value of the topology correlation matrix can be perceived, the network uses the dijkstra algorithm to obtain the shortest path of the current total network traffic and thus implements load balancing of the constellation system. Due to the large number of satellites, the network topology is complex and time varying, it is difficult to find the optimal path in a short time, so a suboptimal routing algorithm based on network topology is proposed in this paper. The local network topology is obtained by using the positions of the source and destination gateway, and the number of satellites and gateways used to establish the correlation matrix of the dijkstra algorithm is reduced. Through the simulation analysis, the average computational complexity of this algorithm is much lower than that of the global optimal routing algorithm, and the average propagation delay of routing is almost the same. When the network load is normal, the system performance is almost the same with the global optimal routing algorithm.

关键词： LEO satellite massive constellation topology routing algorithm suboptimal algorithm dijkstra algorithm

来源：评论

学校读者我要写书评

暂无评论

Handling modular containers in a physical internet environment

引用

MARITIME ECONOMICS & LOGISTICS 2024年 1-27页

作者： Hirata, Enna Firdausiyah, Nailah Kusumaningdyah, Widha Kobe Univ Kobe 6580022 Japan Brawijaya Univ Malang 65145 Indonesia

The shipping industry is currently the sixth largest source of global emissions, generating one billion tons of greenhouse gases annually. Physical Internet is a leading solution to enhance the efficiency of shipping operations and reduce CO2 emissions. In a physical internet framework, this research compares and simulates two sequencing strategies, based on the dijkstra algorithm, designed to optimize the routing of terminal vehicles in managing modular containers at terminals. Our results indicate that the proposed method could save the total travel time of Automated Guided Vehicles by 1.2% and lead to a 0.5% reduction in global CO2 emissions if implemented in the top 100 container ports in the world. We show that the physical internet contributes positively to mitigating climate change in maritime transport, towards eventually achieving cargo neutrality. Furthermore, our proposed mathematical model provides decision aid for handling modular containers in terminals.

关键词： Physical internet Modular containers Container sequencing strategies dijkstra algorithm Climate change

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

An Intelligent Charging Station Matching Method for Electric Vehicles in Internet of Things

An Intelligent Charging Station Matching Method for Electric...

引用

International Conference on Mechatronics and Semiconductor Materials (ICMSCM 2013)

作者： Liu, Yuxi Zhao, Jiakui Ouyang, Hong Wang, Wenhong Wang, Shulong State Grid Elect Power Res Inst Beijing 100192 Peoples R China The Anhui Elect Power Corp Hefei 230061 Peoples R China

ISBN: (纸本)9783037859391

The internet of things(IoT) is considered as one of the most important supporting technologies for the smart grid, which is considered as one of the most important application areas of the IoT. In the electric IoT, with the development of electric vehicles (EVs), effectively modeling road network becomes more and more important. In this paper, a road network model which captures the real-life road conditions better than previous models is introduced. Moreover, an awaiting time in the queue is taken into consideration before EVs being charged. Compared with minimum distance standard, the proposed time minimum standard and dijkstra algorithm are adopted to track the path of the EVs. Finally, a velocity limitation of EV is considered in the simulations to embody the real-life road network.

关键词： Internet of Things Electric Vehicles (EVs) dijkstra algorithm Road Network

来源：评论

学校读者我要写书评

暂无评论

Fitting with Interpolation to Resolve the Construction of Roads in Mountains

Fitting with Interpolation to Resolve the Construction of Ro...

引用

International Conference on Information Computing and Applications

作者： Wang, Jinran Yue, Xiaoyun Guo, Yajun Yang, Xiaojing Guo, Yacai Hebei Normal Univ Sci & Technol Inst Math & Informat Technol Qinhuangdao 066004 Hebei Province Peoples R China

ISBN: (纸本)9783642163357

The interpolation fitting is an important method in the numerical analysis, and it has applied in the practical life widely. As for the questions proposed in the mathematics model, to resolve the construction of roads in the mountains with the least cost, this paper used local optimization theory, under the specific circumstances of the mountain set up control points, made the topographic map method into the network, established new network of roads, bridges tunnels and gave different weights, By minimizing the cost instead using the shortest path problem in fitting with interpolation and solved problem using dijkstra algorithm, finally reached the optimal route and the minimum cost.

关键词： Shortest path interpolation fitting least cost dijkstra algorithm

来源：评论

学校读者我要写书评

暂无评论

A Tender algorithm of Improved Distributed System Resource Management

A Tender Algorithm of Improved Distributed System Resource M...

引用

3rd IEEE Asia-Pacific Service Computing Conference (APSCC 2008)

作者： Wei Xiong Xu Xianbing Wuhan Univ Sch Comp Wuhan 430072 Hubei Peoples R China

ISBN: (纸本)9781424440993

The tender algorithm is one of the most commonly used algorithms in the distributed system resources management. The calculation of marked price has neglected the key consumption of sites and the reliability is low. Through the improved algorithm, the introduction of resources coordinator and the adoption of dijkstra algorithm, the marked price can be calculated precisely. Then the improved tender algorithm greatly enhanced the performance and reliability of the distributed system.

关键词： tender dijkstra marked price waiting line dijkstra algorithm

来源：评论

学校读者我要写书评

暂无评论

Global Path Planning for Mobile Robot Based Genetic algorithm and Modified Simulated Annealing algorithm 09

Global Path Planning for Mobile Robot Based Genetic Algorith...

引用

World Summit on Genetic and Evolutionary Computation (GEC 09)

作者： Liang, Yuming Xu, Lihong Tongji Univ Sch Elect & Informat Engn Shanghai 201804 Peoples R China

ISBN: (纸本)9781605583266

Global path planning for mobile robot using genetic algorithm and simulated annealing algorithm is investigated in this paper. In view of the slow convergence speed of the conventional simulated annealing algorithm, a modified simulated annealing algorithm is presented, and a hybrid algorithm based on the modified simulated annealing algorithm and genetic algorithm is proposed. The proposed algorithm includes three steps: the MAKLINK graph theory is adopted to establish the free space model of mobile robots firstly, then dijkstra algorithm is utilized for finding a feasible collision-free path and fixing on the sub-search-space where the global optimal path inside,. finally the global optimal path of mobile robots is obtained based on the hybrid algorithm of modified simulated annealing algorithm and genetic algorithm. Experimental results indicate that the proposed algorithm has better performance than simulated annealing algorithm and ant system algorithm in term of both solution quality and computational time, and thus it is a viable approach to mobile robot global path planning.

关键词： dijkstra algorithm Mobile Robot Global Optimal Path Planning Genetic algorithm Modified Simulated Annealing algorithm

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Retiming Technique for Clock Period Minimization using Shortest Path algorithm

Retiming Technique for Clock Period Minimization using Short...

引用

IEEE International Conference on Computing, Communication and Automation (ICCCA)

作者： Pandey, Vinita Yadav, S. C. Arora, Priya Graph Era Univ Dehradun ECE Dept Dehra Dun Uttar Pradesh India Graph Era Univ Dehradun CS Dept Dehra Dun Uttar Pradesh India

ISBN: (纸本)9781509016662

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) BellmanFord algorithm Floyd-Washall algorithm Johnson algorithm dijkstra algorithm greedy strategy Sparse graph

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：