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

Automatic cable routing based on improved pathfinding algorithm and B-spline optimization for collision avoidance

JOURNAL OF COMPUTATIONAL DESIGN AND ENGINEERING 2024年第5期11卷 303-317页

作者： Kim, Kunchan Yoon, Yeongjun Kim, Byung Chul Kim, Jongguk Han, Soonhung Kwon, Soonjo Kumoh Natl Inst Technol Grad Sch Dept Mech Engn 61 Daehak Ro Gumi 39177 South Korea Korea Univ Technol & Educ Sch Mech Engn 1600 Chungjeol Ro Cheonan 34036 South Korea Elozen Co Ltd 205 Yangji Ro Bucheon 14786 South Korea Korea STEP Ctr 314 Gyeryong Ro Daejeon 30147 South Korea Kumoh Natl Inst Technol Sch Mech Syst Engn 61 Daehak Ro Gumi 39177 South Korea

With the recent growth of electrical and electronic systems such as electric vehicles, the demand for automatic cable routing for electrical wiring design is increasing. However, real industry use cases of automatic cable routing are still rare especially in three-dimensional design. In this study, we propose a new pathfinding algorithm, JPS-Theta*, which combines the existing pathfinding algorithms, Jump Point Search and Theta*, that is better suited for cable routing. In addition, we propose a B-spline optimization algorithm to create natural cable shapes while avoiding collisions. In the experiments, it was found that the proposed pathfinding algorithm complements the existing algorithms and is thought to be more suitable for the purpose of automatic cable routing. Additionally, ant colony optimization for continuous domains, a meta-heuristic algorithm, was successfully used for optimizing the B-spline to obtain cable shapes without collision. Lastly, as a case study, the proposed method was directly applied to the electrical panel design to show its effectiveness. We expect that the proposed method will be able to improve the efficiency and quality of electrical wiring design. Graphical Abstract

关键词： automatic cable routing pathfinding algorithm Jump Point Search Theta B-spline optimization ant colony optimization

来源：评论

学校读者我要写书评

暂无评论

Method for pipe routing using the expert system and the heuristic pathfinding algorithm in shipbuilding

引用

INTERNATIONAL JOURNAL OF NAVAL ARCHITECTURE AND OCEAN ENGINEERING 2023年 15卷

作者： Ha, Jisang Roh, Myung-Il Kim, Ki-Su Kim, Jin-Hyeok Seoul Natl Univ Dept Naval Architecture & Ocean Engn Seoul South Korea Seoul Natl Univ Res Inst Marine Syst Engn Dept Naval Architecture & Ocean Engn Seoul South Korea Univ Ulsan Sch Naval Architecture & Ocean Engn Ulsan South Korea

Pipe routing during the design process of a ship depends on the design experience or knowledge of experts. In this study, an expert system that can systematize expert knowledge was constructed to enhance the design of a ship's pipe routing, which relies on experts. In addition, a method for pipe routing using a pathfinding algorithm was proposed. An arrangement template model (a type of data structure for pipe routing) and an arrangement evaluation model (a type of expert system) were pro-posed to systematically concretize and computerize expert knowledge. To review several alternatives for pipe routing in a short time and derive an optimal alternative, an optimization technique was combined with an expert system, and the optimization problem was mathematically formulated. That is, the design alternatives for pipe routing were evaluated using the arrangement evaluation model, and the results were used as one of the objective functions of the optimization problem for optimal pipe routing. To verify the proposed method, examples were selected, pipe routing was performed on the examples, and the results were compared with those of the manual design. As a result, an improved pipe routing could be obtained using the proposed method. & COPY;2023 Production and hosting by Elsevier B.V. on behalf of Society of Naval Architects of Korea. This is an open access article under the CC BY-NC-ND license (http://***/licenses/by-nc-nd/4.0/).

关键词： Pipe routing Expert system Optimization technique pathfinding algorithm

来源：评论

学校读者我要写书评

暂无评论

Application of pathfinding algorithms in Partial Discharge Localization in Power Transformers

引用

SENSORS 2024年第2期24卷 685页

作者： Beura, Chandra Prakash Wolters, Jorim Tenbohlen, Stefan Univ Stuttgart Inst Power Transmiss & High Voltage Technol IEH D-70569 Stuttgart Germany

The introduction of artificial intelligence (AI) to ultra-high-frequency (UHF) partial discharge (PD) monitoring systems in power transformers for the localization of PD sources can help create a robust and reliable system with high usability and precision. However, training the AI with experimental data or data from electromagnetic simulation is costly and time-consuming. Furthermore, electromagnetic simulations often calculate more data than needed, whereas, for localization, the signal time-of-flight information is the most important. A tailored pathfinding algorithm can bypass the time-consuming and computationally expensive process of simulating or collecting data from experiments and be used to create the necessary training data for an AI-based monitoring system of partial discharges in power transformers. In this contribution, Dijkstra's algorithm is used with additional line-of-sight propagation algorithms to determine the paths of the electromagnetic waves generated by PD sources in a three-dimensional (3D) computer-aided design (CAD) model of a 300 MVA power transformer. The time-of-flight information is compared with results from experiments and electromagnetic simulations, and it is found that the algorithm maintains accuracy similar to that of the electromagnetic simulation software, with some under/overestimations in specific scenarios, while being much faster at calculations.

关键词： power transformer partial discharge UHF localization condition monitoring pathfinding algorithm

来源：评论

学校读者我要写书评

暂无评论

A systematic review and analysis of A-star pathfinding algorithms and its variations

A systematic review and analysis of A-star pathfinding algor...

引用

作者： Zuoyu Wang Xinduo Fan Department of Computer Science Denison University

This paper presents a comprehensive review and analysis of the A-star（A） pathfinding algorithm and its variations. A-star algorithm's core principles, practical representations, and diverse applications are examined. The study extends to various A derivatives, including Weighted A, IDA（Iterative Deepening A）, ARA（Anytime Repairing A）, D（Dynamic A）,LPA（Lifelong Planning A）, D Lite, and AD（Anytime Dynamic D）. Each variant's unique adaptations and efficiencies are explored, highlighting their suitability for specific challenges in pathfinding tasks. This work aims to elucidate the intricacies of these algorithms, demonstrating their significance and versatility in solving complex navigational problems,thus offering valuable insights for future research and application development in the field of artificial intelligence and game industry.

关键词： A star algorithm pathfinding algorithm D~*/D~* Lite/LPA~*(incremental search algorithms) Weighted A~ A~*/ARA~*(anytime algorithms) IDA~ AD~

来源：评论

学校读者我要写书评

暂无评论

A parallel programming application of the A* algorithm in digital rock physics

引用

COMPUTERS & GEOSCIENCES 2024年 187卷

作者： Raeli, Alice Borello, Eloisa Salina Panini, Filippo Serazio, Cristina Viberti, Dario Politecn Torino DIATI Dipartimento Ingn Ambiente Terr & Infrastrut Corso Duca Abruzzi 24 I-10129 Turin TO Italy

Pore-scale analysis and characterization of reservoir rocks provide valuable information for the definition and management of underground hydrogen storage and CO2 storage or sequestration. This article presents an optimized implementation of the A* algorithm, the most popular pathfinding method in the presence of obstacles. In this context, the algorithm is applied to recognize the minimum length connected paths through each flow direction of 3D images of a porous medium representative of a reservoir rock. The identification of the main paths allows the characterization of the pore space and the calculation of fundamental petrophysical properties such as tortuosity and effective porosity, which can be used for permeability estimation. Compared to other algorithms available for pore-scale characterization, such as the pore centroid, A* provides a better approximation of the pore space available for the flow and, therefore, a reliable characterization of the petrophysical properties. On the other hand, path identification is significantly consuming in terms of time and memory. In this paper, an efficient and optimized implementation based on C++/OpenMP programming language is presented. The proposed implementation aims to the analysis of large-scale models profiting from parallelization, memory optimization, and enhanced managing of dead paths. Three test cases of increasing sizes are presented, to analyze the advantages and the disadvantages of the algorithm as the number of explored points increases. The 3D binary images analyzed are related to a synthetic domain (1 million voxels) and two actual sandstone samples (about 4 and 64 million voxels respectively). The code is validated against a Matlab serial implementation, showing a significant improvement in efficiency. Remarkable test cases of several millions of voxels were afforded, overcoming the memory and execution slowness issues. Moreover, the proposed implementation is suitable for large pore-scale models run

关键词： pathfinding algorithm Energy storage Porous medium Geometric tortuosity A* algorithm

来源：评论

学校读者我要写书评

暂无评论

On Comparative algorithmic pathfinding in Complex Networks for Resource-Constrained Software Agents

On Comparative Algorithmic Pathfinding in Complex Networks f...

引用

作者： Moran Michael J. Walden University

学位级别：D . I . T

aSoftware engineering projects that utilize inappropriate pathfinding algorithms carry a significant risk of poor runtime performance for customers. Using social network theory, this experimental study examined the impact of algorithms, frameworks, and map complexity on elapsed time and computer memory consumption. The 1,800 2D map samples utilized were computer random generated and data were collected and processed using Python language scripts. Memory consumption and elapsed time results for each of the 12 experimental treatment groups were compared using factorial MANOVA to determine the impact of the 3 independent variables on elapsed time and computer memory consumption. The MANOVA indicated a significant factor interaction between algorithms, frameworks, and map complexity upon elapsed time and memory consumption, F(4, 3576) ＝ 94.09, p ＜ .001, eta2 ＝ .095. The main effects of algorithms, F(4, 3576) ＝ 885.68, p ＜ .001, eta2 ＝ .498； and frameworks, F(2, 1787) ＝ 720,360.01,p ＜ .001, eta2 ＝ .999； and map complexity, F(2, 1787) ＝ 112,736.40, p ＜ .001, eta2 ＝ .992, were also all significant. This study may contribute to positive social change by providing software engineers writing software for complex networks, such as analyzing terrorist social networks, with empirical pathfinding algorithm results. This is crucial to enabling selection of appropriately fast, memory-efficient algorithms that help analysts identify and apprehend criminal and terrorist suspects in complex networks before the next attack.

关键词： Pure sciences Applied sciences Complex network Factorial manova pathfinding algorithm Python Shortest path Small world

来源：评论

学校读者我要写书评

暂无评论

SOME VARIATIONS OF LEES algorithm

引用

IEEE TRANSACTIONS ON COMPUTERS 1976年第1期25卷 19-24页

作者： HOEL, JH SPERRY RAND CORP UNIVAC DIV COMP AIDED DESIGN DEPT ROSEVILLE MN 55113 USA

Lee"s algorithm is a pathfinding algorithm, which is often used in computer-aided design systems to route wires on printed circuit boards. This paper discusses some variations of Lee"s algorithm which can be used in certain contexts to improve its efficiency. First, it is shown that, by storing ❉ier cells in an array of stacks rather than a single list, costly searching operations can be eliminated without significantly increasing storage requirements. Second, it is shown that if each path"s cost is the sum of the weights of its cells then retrace codes can be assigned to cells as soon as they are reached rather than when they are expanded. Third, it is shown that if the additional restriction is made that each cell"s weight is not a function of the state of any nonneighbor cell, then an encoding scheme requiring only two bits/cell can be used for both rectangular and hexagonal grids.

关键词： Cell coding Lee"s algorithm computer-aided design pathfinding algorithm printed circuit routing

来源：评论

学校读者我要写书评

暂无评论

A Novel Fire Rescue System with Fog Computing 19

A Novel Fire Rescue System with Fog Computing

引用

4th International Conference on Cloud Computing and Internet of Things (CCIOT) / International Conference on Emerging Networks Technologies (ICENT)

作者： Luo, Tianhang Wan, Wanggen Gao, Yue Zhao, Yuepeng Li, Yumei Shanghai Univ JiaDing Chenzhong Rd 20 Shanghai Peoples R China Shanghai Univ BaoShan Shangda Rd 99 Shanghai Peoples R China

ISBN: (纸本)9781450372411

Fire as a common disaster, because of its perniciousness, which has aroused a lot of attention of public. Fire rescue is one of the most urgent tasks that we need to take care. Normally, firefighters make the rescue plan by the 2D map, but things cannot be predicted well without enough information. And because of the interference of fire, the transmission of data can be easily blocked. In order to play the full potential of the IoT design, and consider all the factors that may influence the indoor-environment to help make the fire rescue. First, we use Raspberry Pi to work as the fog server, Arduino mega 2560 to make the sensor, combined with PC (personal computer) to make the framework of the IoT (Internet of thing) design. And here, we put the crowd and the indoor environment as the main factors. We use PSO-SVM (Particle Swarm Optimization-Support Vector Machine) to reduce the error of prediction, neural network to analysis the image to give the number of people. And according to all the result to make the plan based on a 3D view to help make the rescue. We also make some experiments to show that the algorithms can have a good performance to improve the work.

关键词： Fog computing IoT Crowd Counting Fire detection pathfinding algorithm

来源：评论

学校读者我要写书评

暂无评论

Potential economic benefits of using a weather ship routing system at Short Sea Shipping

引用

WMU JOURNAL OF MARITIME AFFAIRS 2018年第2期17卷 195-211页

作者： Grifoll, M. Martinez de Oses, F. X. Castells, M. Univ Politecn Catalunya BarcelonaTech Civil & Environm Dept Barcelona Spain Univ Politecn Catalunya BarcelonaTech Naut Sci & Engn Dept Barcelona Spain

This contribution investigates the economic benefits of using weather ship routing on Short Sea Shipping (SSS) activities. The investigation is supported with the development of a ship routing system based on pathfinding algorithm, the parametrization of the wave effect on navigation, and the use of high-resolution meteo-oceanographic predictions. The optimal ship routing analysis is investigated in a European SSS system: the link between Spanish and Italian ports. The results show the economic benefits using ship routing in SSS during energetic wave episodes. The rate of cost savings may reach 18% of the total costs under particular bad weather conditions in the navigation area. The work establishes the basis of further developments in optimal route applied in relatively short distances and its systematic use in the SSS maritime industry.

关键词： Ship routing pathfinding algorithm Short Sea Shipping Cost reduction Wave effect on ship A

来源：评论

学校读者我要写书评

暂无评论

Consistency of Criteria in Building Interiors through the Analytic Hierarchy Process for Simulation of Feasible Evacuation Routes

引用

SENSORS AND MATERIALS 2020年第11期32卷 3835-3851页

作者： Osorio, Ever Enrique Castillo Seo, Min Song Yoo, Hwan Hee Gyeongsang Natl Univ Dept Urban Engn BK21 501 Jinju Daero Jinju 660701 Gyeongsangnam D South Korea

Disasters can happen anytime in urban areas, forcing people to evacuate buildings to safeguard their lives. Therefore, it is important that safe routes for the transit of people are first identified. However, when defining evacuation routes to safer places, the basic condition considered is the shortest distance, excluding other criteria related to the security of environmental elements. We propose the simulation of feasible evacuation routes under the influence of importance indexes obtained from the validation and consistency of the security criteria of building elements performed by the analytical hierarchy process (AHP). We find that the security criteria of building elements can be classified into ranges of a suitability model and validated in comparison matrices with consistency ratios (CR) < 10%, which guarantee data consistency. Furthermore, we obtain the importance indices S(n) interpreted by a variant of the A-star (A*) pathfinding algorithm, showing evacuation routes traced through safe areas, when performing simulations. Our results demonstrate the importance of the consistency of security criteria employed in the AHP, whose indexes highly influence the execution of the variant of the A* pathfinding algorithm when it determines safer rather than shorter evacuation routes, for different simulation scenarios.

关键词： analytical hierarchy process multicriteria evacuation route geometry pathfinding algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：