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

An exact reduction technique for the k-Colour Shortest Path Problem

COMPUTERS & OPERATIONS RESEARCH 2023年 149卷

作者： Cerrone, Carmine Russo, Davide Donato Univ Genoa Dept Econ I-16126 Genoa Italy Univ Molise Dept Biosci & Terr I-86090 Pesche Italy

The k-Colour Shortest Path Problem is a variant of the classic Shortest Path Problem. This problem consists of finding a shortest path on a weighted edge-coloured graph, where the maximum number of different colours used in a feasible solution is fixed to be k. The k-CSPP has several real-world applications, particularly in network reliability. It addresses the problem of reducing the connection cost while improving the reliability of the network. In this work, we propose a heuristic approach, namely Colour-Constrained dijkstra algorithm (CCDA), which is able to produce effective solutions. We propose a graph reduction technique, namely the Graph Reduction algorithm (GRA), which removes more than 90% of the nodes and edges from the input graph. Finally, using a Mixed-Integer Linear Programming (MILP) model, we present an exact approach, namely Reduced Integer Linear Programming algorithm (RILP), that takes advantage of the heuristic CCDA and the GRA. Several tests were performed to verify the effectiveness of the proposed approaches. The computational results indicate that the produced approaches perform well, in terms of both the solution's quality and computation times.

关键词： Graph reduction dijkstra algorithm Shortest path Labelled graph

来源：评论

学校读者我要写书评

暂无评论

An intelligent charging navigation scheme for electric vehicles using a cloud computing platform

引用

ENERGY SOURCES PART A-RECOVERY UTILIZATION AND ENVIRONMENTAL EFFECTS 2024年第1期46卷 12525-12541页

作者： Shao, Hanlin Zhang, Guofang Xia, Miao Wuhan Univ Technol Sch Automot Engn Wuhan 430000 Peoples R China

Due to reasons of short range, long charging time, and insufficient information exchange between charging infrastructures, more attention needs to be paid to the charging problems of EVs. This work mainly focuses on designing an intelligent charging navigation method for EVs, building the logic framework, and internal structure framework. Then, battery SOC and energy consumption of EVs were predicted for the range, and queueing theory was used to calculate the charging queueing time. Furthermore, the historical trend method is used to predict road travel time. Finally, combined with the above data, an EV charging navigation model based on the shortest time was established and related algorithms were written to solve the model by using dijkstra algorithm and an example is given to verify the feasibility of the intelligent charging navigation for EVs. About 24 minutes' driving time and a total of 16.63 minutes were saved for the owner from charging decision to charging completion on a 50 km drive.

关键词： Electric vehicle charging navigation routing cloud computing dijkstra algorithm

来源：评论

学校读者我要写书评

暂无评论

An adaptive evacuation system for the Gran Sasso underground laboratory

引用

FRONTIERS IN PHYSICS 2024年 12卷

作者： Cavalcante, Paolo Bucciarelli, Gabriele INFN Tech & Gen Serv Div Lab Nazl Gran Sasso Laquila Italy

The Gran Sasso National Laboratory (LNGS) is, at present, the largest deep underground laboratory in operation for astroparticle physics and rare event research. The LNGS was created to carry out this research exploiting an overburden of 1,400 m of rock to reduce the flux of muons from cosmic rays. Operating an underground laboratory and its facilities implies a high level of risk. To mitigate risks at the LNGS, a crucial aspect is represented by the evacuation of people from an underground environment during emergencies. The connection between the underground facilities and the outside infrastructure is limited, and the intervention by rescue teams is complicated. This paper reports the study of an adaptive evacuation system to improve the evacuation performance in underground laboratories. The system proposed is composed of a combination of passive, dynamic, and adaptive signage that is able to adapt itself to lead the laboratory occupants to the safe location for evacuation (assembly point). The system collects information from all safety plants, and the data are processed using a customized path-finding algorithm. In the computational algorithm, the underground laboratory is represented as a grid, and the customized path-finding algorithm discovers all available paths to reach the identified evacuation assembly point.

关键词： adaptive evacuation route underground safety dijkstra algorithm decision making Gran Sasso National Laboratory

来源：评论

学校读者我要写书评

暂无评论

A Multi-Scale Map Method Based on Bioinspired Neural Network algorithm for Robot Path Planning

引用

IEEE ACCESS 2019年 7卷 142682-142691页

作者： Luo, Min Hou, Xiaorong Yang, Simon X. Univ Elect Sci & Technol China Sch Automat Engn Chengdu 611731 Sichuan Peoples R China Southwest Petr Univ Sch Elect Engn & Informat Chengdu 637001 Sichuan Peoples R China Univ Guelph Sch Engn ARIS Lab Guelph ON N1G 2W1 Canada

With the wide application of Bioinspired Neural Network in the field of robot path planning, the environmental scale of robot path planning is getting larger, and the environmental resolution requirements are getting higher. However, with the increase of the environment size and resolution requirement, the neuronal activity value calculation cost and the time cost of the Bioinspired Neural Network will increase sharply. Aiming at this problem, this paper proposes an improved Bioinspired Neural Network path planning method based on Scaling Terrain. Using a Multi-Scale Map method and dijkstra algorithm, the optimal path of a Coarse Scale Map is calculated. The optimal path obtained from the Coarse Scale Map is used to guide the neural network planning weights of the Fine Scale Map from the same terrain. Thus, the optimal path of the Fine Scale Map can be calculated by the improved BNN algorithm. Introducing this Multi-Scale Map Method into the Bioinspired Neural Network can greatly reduce the time cost of the Bioinspired Neural Network path planning algorithm and reduce the mathematical complexity. Simulation results in some computer integrated virtual environments further demonstrate the superiority of this method and the experimental results are encouraging.

关键词： Path planning Biological neural networks Three-dimensional displays Robots Heuristic algorithms Biological system modeling Real-time systems Multi-scale map method path planning bioinspired neural network dijkstra algorithm

来源：评论

学校读者我要写书评

暂无评论

Identification of accident scenarios involving scaffolding

引用

AUTOMATION IN CONSTRUCTION 2021年 126卷 103690-103690页

作者： Szostak, Mariusz Hola, Bozena Boguslawski, Pawel Wroclaw Univ Sci & Technol Dept Bldg Engn Fac Civil Engn 27 Wybrzeze Wyspianskiego St PL-50370 Wroclaw Poland Wroclaw Univ Environm & Life Sci Inst Geodesy & Geoinformat Grunwaldzka 53 PL-50357 Wroclaw Poland

The aim of the undertaken research was to identify the most frequently repeated accident scenarios in relation to accidents that involve scaffolding. The source of knowledge was accident documentation containing information on the circumstances of accidents, as well as their course and consequences. As part of the research, an IT Database (ITD) was developed, which involved accidents that occurred in Poland over the past five years which were related to work on scaffolding. An original graphical, mathematical and IT process model was developed in order to enable a large set of accidents involving construction scaffolding to be studied. Due to the fact that every accident proceeds according to a different scenario, a map of possible accident scenarios was developed and presented in the form of a directed graph. Graph algorithms, including the dijkstra algorithm, were used to build the IT model. Based on the information contained in the ITD, the course of the accident sequence was analysed in the proposed graph. The most probable accident scenarios, the probability of their occurrence, and the course of the critical path were determined. The obtained results constitute a starting point for estimating the occupational risk associated with working on scaffoldings.

关键词： Construction Scaffolding Fall from height Accident scenario Direct graph dijkstra algorithm Process model

来源：评论

学校读者我要写书评

暂无评论

Profiling charge transport: A new computational approach

引用

INTERNATIONAL JOURNAL OF BIOLOGICAL MACROMOLECULES 2023年第1期237卷 124065页

作者： Maqboul, Ibrahim Friedrich Alexander Univ Fac Sci Comp Chem Ctr CCC Dept Chem Nagelsbachstr 25 D-91052 Erlangen Germany

To maintain life, charge transfer processes must be efficient to allow electrons to migrate across distances as large as 30-50 angstrom within a timescale from picoseconds to milliseconds, and the free-energy cost should not exceed one electron volt. By employing local ionization and local affinity energies, we calculated the pathway for electron and electron-hole transport, respectively. The pathway is then used to calculate both the driving force and the activation energy. The electronic coupling is calculated using configuration interaction procedure. When the charge acceptor is not known, as in oxidative stress, the charge transport terminals are found using Monte-Carlo simulation. These parameters were used to calculate the rate described by Marcus theory. Our approach has been elaborately explained using the famous androstane example and then applied to two proteins: electron transport in azurin protein and hole-hopping migration route from the heme center of cytochrome c peroxidase to its surface. This model gives an effective method to calculate the charge transport pathway and the free-energy profile within 0.1 eV from the experimental measurements and electronic coupling within 3 meV.

关键词： Androstane Azurin Cytochrome C peroxidase dijkstra algorithm Electron transport Hole -hopping Ionization Metropolis Monte -Carlo

来源：评论

学校读者我要写书评

暂无评论

Robust Visual Place Recognition Based on Context Information

引用

IFAC-PapersOnLine 2019年第22期52卷 49-54页

作者： Deyun Dai Zonghai Chen Jikai Wang Peng Bao Hao Zhao Department of Automation University of Science and Technology of China Hefei PR China

In large-scale and long-term visual SLAM, robust place recognition is essential for building a global consistent map. However, sensor viewpoints and environmental condition changes, including lighting, weather, and seasons, bring a huge challenge to place recognition. We propose a place recognition algorithm based on CNN features and graph model. Firstly, CNN features of images are extracted though an AlexNet network with migration characteristics, and N-nearest neighbor image descriptors of the current image descriptor are found by approximate nearest neighbor searching. Then, according to the difference between descriptors, a weighted directed acyclic graph (weighted DAG) model which describes a cost of context matching between images is established. Finally, a candidate matching sequence with minimum cost on this model is achieved by using dijkstra algorithm. Compared with SeqCNNSLAM and Fast-SeqSLAM, the experimental results demonstrate higher recognition accuracy and robustness of our algorithm.

关键词： place recognition CNN features weighted DAG dijkstra algorithm

来源：评论

学校读者我要写书评

暂无评论

Location of Electric Vehicle Charging Station based on ArcGIS

International Core Journal of Engineering

引用

International Core Journal of Engineering 2022年第3期8卷 666-673页

作者： Jing Wang

With the rapid economic and social development of our country, the number of private cars has also increased rapidly, and at the same time, the problems of noise pollution and environmental pollution have become more and more prominent. As a kind of new energy vehicle, electric vehicle has quickly entered people's field of vision with its advantages of no pollution, low noise, convenient use and high energy utilization efficiency. However, wide-spread and universal adoption of electric vehicles requires a well-established infrastructure for electric vehicles, namely a network of charging facilities. Nowadays, there are still problems such as unreasonable location selection and unsound network in the setting of charging stations. It is urgent to analyze the current road network and build a reasonable charging station selection model. With the help of geographic information system, this paper analyzes and integrates the traffic hot spots and road network in Lingang area of Shanghai, and constructs a charging station site selection model with the help of charging station accessibility and charging station construction cost. The model composition is determined, and reference opinions are provided for the site selection and construction of the charging station.

关键词： Electric Vehicle Charging Station dijkstra algorithm ArcGIS

来源：评论

学校读者我要写书评

暂无评论

Live-wire method with wavelet cost map definition for mri images

引用

IFAC Proceedings Volumes 2006年第21期39卷 197-202页

作者： Wojciech Więlawek Division of Telecomunications Institiute of Electronics Faculty of Automatic Control Electronics and Computer Science Silesian University of Technology Postal address: Akademicka 16 44-100 Gliwice Poland Phone: (048) 32 23714 95

Abstract There are edge based segmentation approaches among the set of methods utilized to image segmentation. This type of methods analyse image gradient features (like the first, the second derivative or them modification). Perfect tool to image processing is wavelet transformation which enables edges detection and often gets better results. In this paper wavelet transformation advantages was utilized. This tool was used to cost map definition. Cost map is a matrix which informs how many features of boundary each pixel possess. Then this cost map definition was applied to live-wire method. The method is semi-automatic and requires user interaction rely on points specification.

关键词： image segmentation live-wire method cost map dijkstra algorithm wavelet transform MRI images

来源：评论

学校读者我要写书评

暂无评论

An Integratable V-X Communication based Conventional Vehicle Fuel Optimization model for distance based Ecological Driving Scheme

An Integratable V-X Communication based Conventional Vehicle...

引用

作者： Rongali, Prudhvi Raj University of Michigan

This thesis paper proposes An Integratable V-X Communication-based Conventional Vehicle Fuel Optimization model for real-time traffic conditions. Before departure, the speed profile for an entire route is optimized using signal phase and timing (SP AT) information and location of traffic lights to provide smooth transitions at traffic signal intersections. In this study, we are going to develop ”nonstop” optimal speed model that can be integrated to existing distance based eco-driving schemes. The initial simulation is done using MATLAB to evaluate optimal speed, fuel economy, the travel time of the ”nonstop” model and the results are compared with the optimization results from distance based eco-driving scheme which uses an estimation of distribution algorithm (EDA). Further integration compatibility of ”nonstop” model with the distance based eco-driving scheme is analyzed.

关键词： V-X communication Eco-driving Conventional vehicle Fuel optimization Urban traffic environment MATLAB SPAT Nonstop model EDA dijkstra algorithm Thesis

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：