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

Topological routing path search algorithm with incremental routability test

IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS 1999年第2期18卷 142-150页

作者： Hama, T Etoh, H IBM Japan Ltd IBM Res Tokyo Res Lab Kanagawa 242 Japan

This paper describes a topological routing path search algorithm embedded in our rubber-band-based autorouter for single-layer printed circuit boards, The algorithm searches for a topological path that is guaranteed to be transformable into a physical wire satisfying design rules. Topological path search algorithms used in existing autorouters verify design rules only locally and approximately. However, it is preferable to satisfy design rules exactly in the global routing phase, especially for routing a densely wired printed circuit board. We propose a method for incrementally verifying design rules during the topological routing path search and describe several improvements to the algorithm that reduce the overhead of the routability test and suppress combinatorial explosion. We also discuss the practical feasibility of the proposed algorithm on the basis of the results of experiments using several printed circuit boards.

关键词： global routing path search algorithm routability test algorithm topological routing

来源：评论

学校读者我要写书评

暂无评论

Net by Net Routing with a New path search algorithm 00

Net by Net Routing with a New Path Search Algorithm

引用

Proceedings of the 13th symposium on Integrated circuits and systems design

作者： M. Johann R. Reis

ISBN: (纸本)9780769508436

Net by net routing is still a very important technique used to make connections in VLSI circuits. The maze routing algorithms used for this purpose correspond to shortest path searches derived from basic BFS or from A*, with many dedicated improvements. This paper proposes the use of a new path search algorithm, LCS*, for routing individual connections in VLSI circuits. LCS* is a generic and simultaneous bidirectional heuristic algorithm which is faster than A* in most graph domains, such as VLSI routing grids. This is achieved by using dynamic estimation with the separation of computed values for open and closed nodes. Results show that the running time is reduced and little storage space is needed.

关键词： A path search algorithm simultaneous bidirectional heuristic algorithm VLSI dynamic estimation maze routing algorithms net by net routing integrated circuit layout network routing routing grids VLSI circuits shortest path searches circuit layout CAD BFS storage space

来源：评论

学校读者我要写书评

暂无评论

Revealing the hidden correlations of elements in intelligent transportation systems with a novel knowledge graph-based path calculation approach

引用

ADVANCED ENGINEERING INFORMATICS 2025年 65卷

作者： Huang, Ke Cai, Ming Xiao, Yao Sun Yat sen Univ Sch Intelligent Syst Engn Guangdong Prov Key Lab Intelligent Transportat Sys Shenzhen Campus Shenzhen 518107 Peoples R China

Intelligence has emerged as an integral trend within Intelligent Transportation Systems (ITS), making the comprehension of interrelations among its key elements critical for unveiling potential influence mechanisms. To foster research in this domain, we present an innovative method aimed at unearthing explainable correlations among these pivotal ITS elements. Our approach is underpinned by two primary stages: the construction of a knowledge graph drawn from ITS-related patents, followed by the application of an enhanced breadth-first path calculation algorithm. This novel algorithm carefully balances consideration between element correlations and the structural nuances of the knowledge graph. To verify the robustness of our algorithm, we engage in meticulous node similarity calculations and undertake an assessment of its effectiveness using an array of performance indicators. Furthermore, to provide practical insight, we offer two case studies exploring the correlation among elements within the realms of Vehicle-to-Everything (V2X) communication system and smart logistics center. These case studies not only validate the method's effectiveness but also illustrate its broad applicability. Our method's utility extends beyond merely unraveling evolution mechanisms and forecasting development trends within transportation systems, and it has the potential to significantly contribute to correlation research across a broad spectrum of fields.

关键词： Intelligent transportation systems Transportation element Explainable correlation Knowledge graph path search algorithm

来源：评论

学校读者我要写书评

暂无评论

A genetic algorithm for PDA optimal path generation using GPS

引用

APPLIED SOFT COMPUTING 2012年第8期12卷 2379-2386页

作者： Lee, Malrey Lee, Young-Keun Rittenhouse, Robert G. Chonbuk Natl Univ Sch Elect & Informat Engn Ctr Adv Image & Informat Technol Jeonju 561756 South Korea Keimyung Univ Informat Technol Keimyung Adams Coll Taegu 704701 South Korea

Many web-sites provide a variety of electronic mapping services. Currently, many studies are underway to develop vehicle navigation software for PDA maps using GPS data. Popular among these services is one that computes the optimal route between two locations input by a user. This service of computing the optimal route plays an important role in vehicular navigation and distribution and delivery industries. The calculation and manipulation of the optimal route for navigation and vehicular delivery system improve the efficiency of vehicle use and delivery times, thereby reducing costs. The purpose of this study is to compute the optimal route by considering the direction of distribution vehicles and the delivery location and develop a genetic based algorithm that quickly generates the shortest route for delivery. The algorithm also generates the optimal route for itineraries having several destinations. (C) 2012 Elsevier B. V. All rights reserved.

关键词： Genetic algorithm Optimal method GPS path search algorithm Delivery system A* algorithm

来源：评论

学校读者我要写书评

暂无评论

Static Balance for Rescue Robot Navigation: Losing Balance on Purpose within Random Step Environment

Static Balance for Rescue Robot Navigation: Losing Balance o...

引用

IEEE/RSJ International Conference on Intelligent Robots and Systems

作者： Magid, Evgeni Tsubouchi, Takashi Koyanagi, Eiji Yoshida, Tomoaki Univ Tsukuba Inst Engn Mech & Syst ROBOKEN Intelligent Robot Lab Tsukuba Ibaraki Japan Chiba Inst Technol Future Robot Technol Narashino Chiba Japan

ISBN: (纸本)9781424466757

The goal of rescue robotics is to extend the capabilities and to increase the safety of human rescue teams. During a rescue mission a mobile robot is deployed on a rescue site and is operated from a safe place by a human operator. The operator can not see the robot and the environment and a decision on the path selection is very complicated. Our goal is to provide a kind of automatic "pilot system" to propose an operator a good direction or several options to traverse the environment, taking into an account the robot's static and dynamic properties. To find a good path we need a special path search algorithm on debris and a proper definition of a search tree, which can ensure smooth exploration. While the main goal of the algorithm is to keep the robot maximally stable at every step of its path, in some cases we need the robot to lose its balance and to change a 3D orientation discontinuously. Losing balance on purpose is an important feature for safe climbing up and going down the debris and it is the central issue of this paper. Exhaustive simulations were used to structure and analyze data and experiments were used to verify our approach to removing unsuitable directions of the search from the search tree.

关键词： automatic pilot system hazardous areas health and safety human rescue team safety mobile robot mobile robots path planning path search algorithm rescue robot navigation service robots tree searching tree searching

来源：评论

学校读者我要写书评

暂无评论

An Optimum search algorithm of Simulating Hydrokinetics 8

An Optimum Search Algorithm of Simulating Hydrokinetics

引用

8th International Conference on Intelligent Computation Technology and Automation (ICICTA)

作者： Ma, Jun Guan, Xingmeng Lanzhou Univ Sch Informat Sci & Engn Lanzhou Gansu Peoples R China

ISBN: (纸本)9781467376440

The shortest path problem, one of classic topic in the field of Graph Theory and path search, majors in the method about how to find the shortest path between two nodes in a directed-graph. Based on observing the relationship between water flow rate and pipe diameter in a pipeline network, the paper puts forward a kind of multi-thread parallel path search algorithm deriving of Hydrokinetics, namely Water flow search algorithm, WFS. Besides, the author has designed a multi-thread program to conduct test. It has been proved that WFS is of great feasibility and applicability to deal with the shortest path problem.

关键词： Multi-thread path search algorithm Optimum search algorithm Water flow search algorithm

来源：评论

学校读者我要写书评

暂无评论

Financial fraud risk analysis based on audit information knowledge graph 8

Financial fraud risk analysis based on audit information kno...

引用

8th International Conference on Information Technology and Quantitative Management (ITQM) - Developing Global Digital Economy after COVID-19

作者： Wu, Huidong Chang, Yanpeng Li, Jianping Zhu, Xiaoqian Chinese Acad Sci Inst Sci 15 Beiyitiao Alley Beijing 100190 Peoples R China Chinese Acad Sci Inst Dev 15 Beiyitiao Alley Beijing 100190 Peoples R China Cent Univ Finance & Econ Sch Management Sci & Engn 39 South Coll Rd Beijing 100080 Peoples R China Univ Chinese Acad Sci Sch Publ Policy & Management 19A Yuquan Rd Beijing 100049 Peoples R China Univ Chinese Acad Sci Sch Econ & Management 80 Zhongguancun East Rd Beijing 100190 Peoples R China

The frequent occurrence of financial fraud caused by listed companies has seriously hindered the healthy development of the capital market. Existing studies usually analyze financial fraud through the effectiveness of audit opinion or the correlation between auditor change rate and financial fraud, ignoring the relationship between different participants. By using the audit relationships among corporations, audit firms and auditors, this paper constructs an audit information knowledge graph and proposes a knowledge graph reasoning framework based on the Sub Feature Extraction method to detect potential fraud corporations. In the process of analyzing the audit data of 376 companies in the China Growth Enterprises Market from 2013 to 2019, it is found that potential fraud corporations can be well identified by searching from the known fraud corporations using searched paths. In addition, we find two new audit features of financial fraud corporations which are respectively related to abnormal audit opinions issued by auditors and abnormal associations of audit firms. They can help regulators more effectively find the potential financial fraud corporations that need to be supervised. (C) 2021 The Authors. Published by Elsevier B.V.

关键词： Financial fraud Audit information Knowledge graph Knowledge reasoning path search algorithm

来源：评论

学校读者我要写书评

暂无评论

An Efficient search algorithm to Find the Elementary Circuits of a Graph

引用

Communications of the ACM 1970年第12期13卷 722-726页

作者： Tiernan, James C. Department of Applied Physics and Information Science University of California San Diego La Jolla California United States

A theoretically most efficient search algorithm is presented which uses an exhaustive search to find all of the elementary circuits of a graph. The algorithm can be easily modified to find all of the elementary circuits with a particular attribute such as length. A rigorous proof of the algorithm is given as well as an example of its application. Empirical bounds are presented relating the speed of lhe algorithm to the number of vertices and the number of arcs. The speed is also related to the number of circuits inthe graph to give a relation between speed and complexity. Extensions to undirected and s-graphs are discussed. © 1970, ACM. All rights reserved.

关键词： algorithm circuit search algorithm graph theory path search algorithm searching

来源：评论

学校读者我要写书评

暂无评论

algorithm 459: The Elementary Circuits of a Graph [H]

引用

Communications of the ACM 1973年第10期16卷 632-633页

作者： Syslo, Maciej M. Department of Numerical Methods University of Wroclaw Grunwaldzki 2/4 Wroclaw pl. Poland

来源：评论

学校读者我要写书评

暂无评论

Development of Augmented Reality Indoor Navigation System based on Enhanced A* algorithm

引用

KSII TRANSACTIONS ON INTERNET AND INFORMATION SYSTEMS 2019年第9期13卷 4606-4623页

作者： Yao, Dexiang Park, Dong-Won An, Syung-Og Kim, Soo Kyun PaiChai Univ Dept Game Engn Daejeon South Korea

Nowadays modern cities develop in a very rapid speed. Buildings become larger than ever and the interior structures of the buildings are even more complex. This drives a high demand for precise and accurate indoor navigation systems. Although the existing commercially available 2D indoor navigation system can help users quickly find the best path to their destination, it does not intuitively guide users to their destination. In contrast, an indoor navigation system combined with augmented reality technology can efficiently guide the user to the destination in real time. Such practical applications still have various problems like position accuracy, position drift, and calculation delay, which causes errors in the navigation route and result in navigation failure. During the navigation process, the large computation load and frequent correction of the displayed paths can be a huge burden for the terminal device. Therefore, the navigation algorithm and navigation logic need to be improved in the practical applications. This paper proposes an improved navigation algorithm and navigation logic to solve the problems, creating a more accurate and effective augmented reality indoor navigation system.

关键词： A* algorithm Augmented Reality indoor navigation path search algorithm navigation logic

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：