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

作者： HANNES BOLMSTEDT Chalmers University of Technology

学位级别：硕士

In recent years, a global trend towards more sustainable and autonomous trans- portation has been changing the car industry. Electrification is on the rise, and Volvo Cars has set out to be a leader with the bold goal of having half of the ve- hicles sold to be fully electrical by 2025. With more electric vehicles and better autonomous functionality than ever before, it is a natural step to look into energy optimization of the autonomous driving behavior. The adaptive cruise control (ACC) is responsible for a large portion of driven kilome- ters in new vehicles. Therefore, this thesis aims to examine the potential of energy optimizing the ACC behavior. To limit the scope, only deceleration scenarios were considered where the vehicle with ACC closes in on a vehicle with constant velocity in front. Two different initial velocities of the vehicle with ACC were tested, while the vehicle in front had the same velocity in both cases. Different time constraints and initial relative distances were tested. All tests were performed in a simulation environment based on Matlab and Simulink, where the power of the electric motors could be measured. The optimization problem was solved using dynamic programming implemented in Matlab. The solutions derived from the dynamic programming were in the form of vehicle trajectories which were then tested on an electric vehicle model in Simulink. The measured power on the motors could then be compared to that of a traditional ACC. The results show that given the exact same initial and final position and velocity, as well as the same time to travel between the two, an energy optimized solution can decrease the energy usage up to 2.1 % compared to a traditional ACC. Given longer time to reach the goal, while not allowed to react earlier, the energy can be decreased by up to 5.5 %. If instead, the ACC is allowed to react earlier and the trajectory is energy optimized, the energy can be decreased by up to 39.1 %. Note that reacting earlier doe

关键词： Adaptive cruise control dynamic programming Bellman-Ford algorithm directed graph shortest path algorithm optimization control problem energy usage battery electric vehicles simulation environment

来源：评论

学校读者我要写书评

暂无评论

Smart Grid Adaption of Church Heat

Smart Grid Adaption of Church Heat

引用

作者： Jesper Karlberg Theodor Astrand Chalmers University of Technology

学位级别：硕士

The Internet is growing in a rapid pace and, as a natural result of this development, more aspects of daily life have relocated to the Internet. The Internet of Things, IoT, is a way of connecting devices over the Internet, enabling them to collect and distribute data. Smart grids are one of the primary applications of IoT and, in the past few years, comprehensive research has been conducted on smart grid heat management systems. This thesis proposes a smart grid heat management system based on a model for the temperature change and a graph model, together with a shortest path algorithm in order to achieve financial savings. The proposed model for temperature and the graph model make use of energy prices and weather fore- casts, provided by Nord Pool and SMHI, respectively. The system is evaluated and analyzed in terms of financial savings in relation to the intermittent heating method used today, as well as in terms of performance, as it will be deployed on a microprocessor. The performance is evaluated by comparing memory usage and execution time by using A* search and Dijkstra's algorithm. The findings of the thesis suggests that it is possible to create a smart grid heat manage- ment system and achieve a decrease in energy costs, in relation to the intermittent heating method, of approximately 2.5%.

关键词： Smart grid Smart heating system shortest path algorithm A* search algorithm Dijkstra's algorithm Internet of Things

来源：评论

学校读者我要写书评

暂无评论

Loop-shaped cable distribution method for subscriber networks

引用

ELECTRONICS AND COMMUNICATIONS IN JAPAN PART I-COMMUNICATIONS 1997年第2期80卷 12-23页

作者： Oikawa, H Tanaka, C NTT Telecommunication Networks Lab Musashino Japan

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 Ii 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 hoops 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.

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

来源：评论

学校读者我要写书评

暂无评论

A Novel Solution for Simultaneously Finding the shortest and Possible paths in Complex Networks

引用

JOURNAL OF INTERNET TECHNOLOGY 2019年第6期20卷 1693-1707页

作者： Hlaing, Wai Mar Liu, Shi-Jian Pan, Jeng-Shyang Univ Comp Studies Yangon Geog Informat Syst Yangon Myanmar Fujian Univ Technol Fujian Prov Key Lab Big Data Min & Applicat Fuzhou Fujian Peoples R China Shandong Univ Sci & Technol Coll Comp Sci & Engn Qingdao Shandong Peoples R China Chaoyang Univ Technol Dept Informat Management Taichung Taiwan

A Novel graph approach named Combined Forward and Backward Heuristic Search (CFBHS) is proposed in this paper, which can be used to solve optimization problems in areas such as transportation and network routing. There are two major aspects distinct our method from the most cited ones. Firstly, though focuses on getting the shortest path in a graph when both source and destination are given, this work can also find other possible paths as outputs. Secondly, the proposed algorithm is a high-performance one, which is achieved by (1) reducing unnecessary nodes and edges to reach a target optimum based on dynamically calculated heuristic values and (2) finding the results by using the subdivision scheme instead of computing over the whole graph. Experiments are carried out for the complex road network of Yangon Region. The comparisons show that our algorithm is about 100 times faster than the bidirectional Dijkstra's algorithm. Besides, benefit from the heuristic forward and backward search, the proposed method can achieve very low time complexity, which is similar to the A*, but A* can only produce the shortest path. By contrast, the proposed algorithm is competent for finding not only the shortest but also many possible paths in complex road networks such as undirected graph and hypergraph networks.

关键词： shortest path algorithm Bi-directional Dijkstra Heuristic search Distance based methods

来源：评论

学校读者我要写书评

暂无评论

Analysis of power consumption in standalone 5G network and enhancement in energy efficiency using a novel routing protocol

引用

SUSTAINABLE ENERGY GRIDS & NETWORKS 2021年 26卷

作者： Sharma, Deepti Singhal, Sanyam Rai, Amrita Singh, Amandeep KCC Inst Dept CSE Greater Noida UP India Indian Inst Technol Dept Engn Phys Mumbai Maharashtra India GL Bajaj Inst Technol & Management Dept ECE Greater Noida UP India KCC Inst Technol & Management Dept ECE Greater Noida UP India

5G technology rollout has already begun across the world in non-standalone format alongside LTE (Long-Term Evolution) Macro structures. LTE has proven to be unsustainable in the long run. 5G electronic architecture is characterized by fewer transmissions in an always-on mode unlike LTE, where the sleep time is less than 1ms and thus LTE has a small proportion of fast activation components that are switched off in a DRX (Discontinuous reception) cycle. 5G structure has a large proportion of fast activation components that enable it to save energy in the idle state. However, in a standalone scenario, where 5G macros are used with an expected device density of 1 million per square kilometer against 2000 per square kilometer in LTE, the load on the base station in a cell sector would be tremendous. The load poses a great challenge towards the minimization of energy consumption and the sustainability of the entire network. Mitigation of dissipation is itself energy-intensive and threatening to the longevity of electronics involved. This paper proposes two modified power consumption models that would accurately depict the power consumption for a 5G base station in a standalone network and a novel routing protocol for distributing the load on the base stations in the case of intercellular communication. A trade-off between the latency and power consumption has been discussed to create a sustainable 5G network within a certain level of quality-of-service parameters. (c) 2021 Elsevier Ltd. All rights reserved.

关键词： Standalone 5G Routing protocol shortest path algorithm Energy efficiency 5G macro Power consumption

来源：评论

学校读者我要写书评

暂无评论

Optimizing forest road planning in a sustainable forest management area in the Brazilian Amazon

引用

JOURNAL OF ENVIRONMENTAL MANAGEMENT 2021年 288卷 112332-112332页

作者： Aguiar, Marcelo Otone da Silva, Gilson Fernandes Mauri, Geraldo Regis de Mendonca, Adriano Ribeiro de Oliveira Santana, Cesar Junio Marcatti, Gustavo Eduardo Marques da Silva, Mayra Luiza da Silva, Evandro Ferreira Figueiredo, Evandro Orfano Martins Silva, Jeferson Pereira Silva, Rodrigo Freitas Santos, Jeangelis Silva Lavagnoli, Gabriel Lessa Claros Leite, Catherine Cristina Fed Univ Espirito Santo UFES Dept Forestry & Wood Sci Ave Governor Lindemberg 316 BR-29550000 Jeronimo Monteiro ES Brazil Remsoft Solut Jose Alexandre Buaiz 300Sala 2001 10 Vg BR-29050545 Vitoria ES Brazil Univ Fed Sao Joao del Rei Dept Agr Sci Sete Lagoas CampusHighway MG 424Km 47 BR-35701970 Sete Lagoas MG Brazil Fed Univ Para UFPA Univ Campus AltamiraSt Cel Jose Porfirio 2515 BR-68372040 Altamira PA Brazil Brazilian Agr Res Corp EMBRAPA Acre Rodovia BR-364Km 14 BR-69900970 Rio Branco AC Brazil UTecman Ltda Rua Copacabana 148Sala 204 BR-69918500 Rio Branco AC Brazil

The construction of forest roads in Brazilian Amazon is costly and has a significant environmental impact. Several practices and principles must be observed to comply with legislation, to preserve the remaining forest, and to ensure sustainable exploitation. Road planning is complex in this context, based on the number of aspects and variables that must be considered. This research aimed to evaluate computational methods? effectiveness in planning forest roads, optimizing resources to reduce damage to the remaining forest, compared to traditional planning methods. The study area was a native forest under a sustainable forest management regime located in municipalities of Terra Santa and Oriximin?a, in Par?a, in Brazilian Amazon. Data obtained from area made it possible formulate six instances of different sizes. A binary integer linear programming model was used, solved using CPLEX software, and Dijkstra, Bellman-Ford, Dial, and D?Esopo-Pape shortest path algorithm, implemented in C programming language. During processing of instances, the time taken to obtain the solution increased according to size of instance, however, time difference was not significant. Among the evaluated algorithms, the D?Esopo-Pape algorithm showed the best performance. The evaluated methods were effective in obtaining an optimal solution for proposed forest road planning. The solutions obtained using computational methods more effectively considered the restrictions associated with sustainable forest management, in contrast to those derived from the traditional planning by forestry company.

关键词： Computational methods shortest path algorithm Planning optimization Tropical forest

来源：评论

学校读者我要写书评

暂无评论

A New algorithm of the Best path Selection Based on Machine Learning

引用

IEEE ACCESS 2019年 7卷 126913-126928页

作者： Liu, Xiao-Huan Zhang, De-Gan Yan, Hao-Ran Cui, Yu-Ya Chen, Lu Tianjin Univ Technol Tianjin Key Lab Intelligent Comp & Novel Software Tianjin 300384 Peoples R China Tianjin Univ Technol Key Lab Comp Vis & Syst Minist Educ Tianjin 300384 Peoples R China

This paper proposes and designs a best path selection algorithm, which can solve the problem of path planning for intelligent driving vehicles in the case of restricted driving, traffic congestions and accidents. We tried to solve the problem under these emergency situations in path planing process for there's no driver in intelligent driving vehicle. We designed a new method of the best path selection with length priority based on the prior knowledge applied reinforcement learning strategy, and improved the search direction setting of A(*) shortest path algorithm in the program. This best path planing algorithm can effectively help different types of intelligent driving vehicles to select the best path in the traffic network with limited height, width and weight, accidents and traffic jams. Through simulation experiments and practical test, it is proved that the proposed algorithm has good stability, high efficiency and practicability.

关键词： Reinforcement learning intelligent driving path planning shortest path algorithm

来源：评论

学校读者我要写书评

暂无评论

A general constrained optimization framework for the eco-routing problem: Comparison and analysis of solution strategies for hybrid electric vehicles

引用

TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES 2021年 123卷 102935-102935页

作者： De Nunzio, Giovanni Ben Gharbia, Ibtihel Sciarretta, Antonio IFP Energies Nouvelles 1&4 Ave Bois Preau F-92852 Rueil Malmaison France

Vehicles electrification marks a very important step towards sustainable mobility. However, energy efficiency and driving range of electrified vehicles are nowadays a major concern. From an algorithmic perspective, eco-routing opens up new possibilities regarding the strategies and tools aimed at improving energy efficiency by finding an energy-minimal route under different constraints coming from vehicle characteristics (powertrain, battery capacity, etc.) and user preferences (travel time, etc.). In this work, a powertrain-independent speed prediction model is presented. This model is then used to derive a fast numerical solution of the powertrain energy management for hybrid electric vehicles. Furthermore, a new general formulation is derived for the minimum-energy navigation problem, with a focus on the specific complexity introduced by electrified vehicles. The general constrained optimization problem is reformulated in several alternative ways in order to achieve a solution in limited computation time. The most commonly used approaches nowadays in the literature (integer programming and shortest path algorithms on directed graphs) are compared and benchmarked in terms of solution accuracy and computational effort. The objective is to identify best-practices in accurately and efficiently solving the constrained eco-routing problem.

关键词： Eco-routing Constrained optimization shortest path algorithm Integer programming Hybrid electric vehicles Energy management

来源：评论

学校读者我要写书评

暂无评论

Q Value-Based Dynamic Programming with Boltzmann Distribution in Large Scale Road Network

引用

SICE Journal of Control, Measurement, and System Integration 2011年第2期4卷 129-136页

作者： Shanqing Yu Yelei Xu Shingo Mabu Manoj Kanta Mainali Kaoru Shimada Kotaro Hirasawa Graduate School of Information Production and Systems Waseda University

In this paper, a global optimal traffic assignment strategy, i.e., Q value-based Dynamic Programming with Boltzmann Distribution is applied to the Kitakyushu City traffic system. The main idea of the proposed traffic assignment strategy is to calculate the expected traveling time for each origin-destination pair and the probability of selecting the next section, then to generate a considerable number of route candidates for the drivers based on the calculated probability. In the simulation, how to select the temperature parameter and the number of the route candidates is discussed in detail. The comparison between the proposed method and the shortest path algorithms indicates that the proposed method could reduce the risk of the traffic congestion occurrence and save the traveling cost effectively. In addition, the computation time is given to reveal the feasibility of the proposed method in large scale networks.

关键词： Q value-based dynamic programming Boltzmann distribution shortest path algorithm

来源：评论

学校读者我要写书评

暂无评论

Smoothing Rotary Axes Movements for Ball-End Milling Based on the Gradient-Based Differential Evolution Method

引用

JOURNAL OF MANUFACTURING SCIENCE AND ENGINEERING-TRANSACTIONS OF THE ASME 2018年第12期140卷 121008-121008页

作者： Lu, Yao-An Wang, Cheng-Yong Sui, Jian-Bo Zheng, Li-Juan Guangdong Univ Technol Sch Electromech Engn Guangzhou 510006 Guangdong Peoples R China

Ball-end milling is widely used in five-axis high-speed machining. The abrupt change of tool orientations or rotary axes movements will scrap the workpiece. This research presents a smoothing method of rotary axes movements within the feasible domains of the rotary-axes space. Most existing smoothing methods of tool orientation or rotary axes movements employ the Dijkstra's shortest path algorithm. However, this algorithm requires extensive computations if the number of the cutter locations is large or the sampling resolution in the feasible regions is high. Moreover, jumps in the results obtained with the Dijkstra's shortest path algorithm may occur, because the optimization problem has to be converted from a continuous problem into a discrete problem when using this algorithm. The progressive iterative approximation (PIA) method incorporating smoothness terms is established as a gradient-based optimization method to smooth the rotary axes movements in this research. Then a gradient-based differential evolution (DE) algorithm, combining the global exploration feature of the DE algorithm and the local searching ability of the gradient-based optimization method, is developed to solve the smoothing model. The validity and effectiveness of the proposed approach are confirmed by numerical examples.

关键词： rotary axes movements smooth tool orientation DE algorithm feasible region shortest path algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：