18 papers · ranked by Valyu relevance
Kevin Y. Chen
Finding the shortest path between two points in a graph is a fundamental problem that has been well-studied over the past several decades. Shortest path algorithms are commonly applied to modern navigation systems, so our study aims to improve the efficiency of an existing algorithm on large-scale Euclidean networks.…
Rhyd Lewis
This paper describes the shortest path problem in weighted graphs and examines the differences in efficiency that occur when using Dijkstra's algorithm with a Fibonacci heap, binary heap, and self-balancing binary tree. Using C++ implementations of these algorithm variants, we find that the fastest method is not always…
Piyush Udhan, Akhilesh Ganeshkar, Poobigan Murugesan, Abhishek Raj Permani + 2 more
'Abhishek Raj Permani' 'Sameep Sanjeeva' 'Parth Deshpande'] Abstract—Traditional vehicle routing algorithms do not consider the changing nature of traffic. While implementations of Dijkstra's algorithm with varying weights exist, the weights are often changed after the outcome of algorithm is executed, which may not…
Zongchao Wei
At present, e-commerce drives the logistics industry to develop greatly, but at the same time, there is a huge demand in this field, such as lower cost and higher efficiency. Facing the needs of logistics management development, it needs the blessing of intelligent technology, which involves countless fields at…
Kornél Katona, Husam A. Neamah, Péter Korondi, David Cheneler + 1 more
'Stephen Monk'] Path planning creates the shortest path from the source to the destination based on sensory information obtained from the environment. Within path planning, obstacle avoidance is a crucial task in robotics, as the autonomous operation of robots needs to reach their destination without collisions.…
Yuexia Tang, Muhammad Aizzat Zakaria, Maryam Younas, Marco Leo
With the development of robotics technology, there is a growing demand for robots to perform path planning autonomously. Therefore, rapidly and safely planning travel routes has become an important research direction for autonomous mobile robots. This paper elaborates on traditional path-planning algorithms and the…
Zhaodi Li, Dan Li
At present, the large amount of data generated by transportation and logistics in cities brings great difficulties to data management and operation. The purpose is to explore the applicability of WebGIS and expand the application of intelligent interactive urban traffic logistics management. An urban traffic logistics…
Yunfeng Yao, Na He, Min Zhang
With the advent of the Internet of Everything era, multi-information integration, and development, technology has penetrated into all aspects of life, promoting the continuous progress of social development, and people's requirements for a happy life are getting higher and higher. In this, robots play an extremely…
Guojun Nan, Zhuo Liu, Haibo Du, Wenwu Zhu + 2 more
'Fco Javier Rodríguez'] An improved Dijkstra algorithm based on adaptive resolution grid (ARG) is proposed to assist manual transmission line planning, shorten the construction period and achieve lower cost and higher efficiency of line selection. Firstly, the semantic segmentation network is used to change the remote…
Wei-Chang Yeh
This paper proposes earliest and latest path algorithms based on binary weight allocation, assigning weights of 2(i-1) and 2(m-i) to the i-th arc in a network. While traditional shortest path algorithms optimize only distance, our approach leverages Binary-Addition-Tree ordering to efficiently identify…
Jing Xie, Qi Duan
Biological pathway analysis often requires identifying interventions that block reachability to an undesirable state, such as a disease-associated module, toxic byproduct, or adverse phenotype, while preserving reachability among essential biological functions. Motivated by this setting, we study the Reachability…
Yael Kirkpatrick, Liam Roditty, Richard Qi, Virginia Vassilevska Williams
Computing the diameter of a graph is a problem of great interest both in general algorithms research and specifically within fine-grained complexity, where it is a cornerstone hard problem. Recent work has achieved a full conditional lower bound tradeoff curve for both directed and undirected graphs. However, the best…
Simon Van den Eynde, Pieter Audenaert, Didier Colle, Mario Pickavet + 1 more
Many real-life problems boil down to a variant of the Minimum Steiner Tree Problem (STP). In telecommunications, Fiber-To-The-Home (FTTH) houses are clustered so they can be connected with fiber as cost-efficiently as possible. The cost calculation of a fiber installment can be formulated as a capacitated STP. Often…
Ragnar Groot Koerkamp, Pesho Ivanov
Sequence alignment has been at the core of computational biology for half a century. Still, it is an open problem to design a practical algorithm for exact alignment of a pair of related sequences in linear-like time (25). We solve exact global pairwise alignment with respect to edit distance by using the A shortest…
Lionel Zoubritzky, François-Xavier Coudert
We present here an open-source Julia library for the topological identification of crystalline materials, with algorithmic and computational improvements over the previously available software in the field, resulting in a speed increase of one order of magnitude. This new algorithm and implementation can therefore be…
Yukun Yang, Wolfgang Maass
Most current methods for goal-directed action selection in the face of changing goals and contingencies require DNNs or LLMs. Therefore they are less suited for implementation in edge devices, where low energy-consumption is imperative. The brain shows that similar functionality can be produced with just 20W, even with…
Udit Agarwal
We present new deterministic algorithms for computing distributed weighted minimum weight cycle (MWC) in undirected and directed graphs and distributed weighted all nodes shortest cycle (ANSC) in directed graphs. Our algorithms for these problems run in O˜(n) rounds in the CONGEST model on graphs with arbitrary…
Jyotshna Rajput, Ghanshyam Chandra, Chirag Jain
Pangenome reference graphs are useful in genomics because they compactly represent the genetic diversity within a species, a capability that linear references lack. However, efficiently aligning sequences to these graphs with complex topology and cycles can be challenging. The seed-chain-extend based alignment…