24 papers · ranked by Valyu relevance
Siva Venkadesh, Wen-Jieh Linn, Yuhe Tian, G Allan Johnson + 1 more
We integrate tracer-derived projection polarity from ∼1,200 mouse injections with species-specific diffusion MRI (dMRI) tractography to construct directed connectomes for mouse, marmoset, rhesus macaque, and human. We model brain circuitry as a directed connectome, in which asymmetric pathways capture the forward flow…
Saad Ejaz, Marco Giberna, Muhammad Shaheer, Jose Andres Millan-Romera + 4 more
—3D Scene Graphs integrate both metric and semantic information, yet their structure remains underexploited for improving path planning efficiency and interpretability. In this work, we present S-Path, a Situationally-aware Path planner that leverages the metric-semantic structure of indoor 3D Scene Graphs to…
Kayson Fakhar, Fatemeh Hadaeghi, Caio Seguin, Shrey Dixit + 4 more
Communication in brain networks is the foundation of cognitive function and behavior. A multitude of evolutionary pressures, including the minimization of metabolic costs while maximizing communication efficiency, contribute to shaping the structure and dynamics of these networks. However, how communication efficiency…
Dequan Zhao, Li Ni, Kefa Zhou, Zhihong Lv + 7 more
'Weiting Yuan' 'Qiulan Wu' 'Feng Zhang' 'Qing Zhang' 'Felipe Jiménez'] To address the problem of ignoring unpaved roads when planning off-road emergency rescue paths, an improved A algorithm that incorporates road factors is developed to create an off-road emergency rescue path planning model in this study. To reduce…
Hanzhang Chen, Xiangzhi Zhang, Shufeng Gong, Feng Yao + 3 more
Networks with Restrictions Authors: ['Hanzhang Chen' 'Xiangzhi Zhang' 'Shufeng Gong' 'Feng Yao' 'Song Yu' 'Yanfeng Zhang' 'Ge Yu'] Path planning is a fundamental problem in road networks, with the goal of finding a path that optimizes objectives such as shortest distance or minimal travel time. Existing methods…
Qing Song, Meng Li, Xiaolei Li, Xiangtao Li
Accurate and fast path computation is essential for applications such as onboard navigation systems and traffic network routing. While a number of heuristic algorithms have been developed in the past few years for faster path queries, the accuracy of them are always far below satisfying. In this paper, we first develop…
Yingjun Sang, Xianyan Chen, Quanyu Chen, Jinglei Tao + 1 more
The traditional A algorithm suffers from issues such as sharp turning points in the path, weak directional guidance during the search, and a large number of computed nodes. To address these problems, a modified approach called the Directional Search A algorithm along with a path smoothing technique has been proposed.…
Joaquín Goñi, Andrea Avena-Koenigsberger, Nieves Velez de Mendizabal, Martijn P. van den Heuvel + 3 more
Graph theoretical analysis has played a key role in characterizing global features of the topology of complex networks, describing diverse systems such as protein interactions, food webs, social relations and brain connectivity. How system elements communicate with each other depends not only on the structure of the…
Faiza Jada Babakano, Ahmed Fahmin, Bojie Shen, Muhammad Aamir Cheema + 1 more
Autonomous Mobile Robots (AMRs) operate on battery power, making energy efficiency a critical consideration particularly in outdoor environments where terrain variations affect energy consumption. While prior research has primarily focused on computing energy-efficient paths from a source to a destination, these…
Olena Doroshenko
Pathfinding in complex topographies poses a challenge with applications extending from urban planning to autonomous navigation. While numerous algorithms offer potential solutions, their comparative efficiency and reliability when confronted with nonlinear terrains remain to be systematically evaluated. This study…
Zhigang Ren, Anjiang Cai, Feilong Xu, Syed Hassan Shah
In response to the issues of low computational efficiency, slow convergence speed, curvy paths, and the tendency to fall into local optima in rapidly-exploring random tree (RRT) algorithms for automated guided vehicle (AGV) path planning, this article proposes an improved RRT algorithm that combines adaptive step-size…
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…
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.…
Dale Zhou, Christopher W. Lynn, Zaixu Cui, Rastko Ciric + 8 more
In systems neuroscience, most models posit that brain regions communicate information under constraints of efficiency. Yet, metabolic and information transfer efficiency across structural networks are not understood. In a large cohort of youth, we find metabolic costs associated with structural path strengths…
Yuxin He, Jin Qin, Jian Hong, Wen-Bo Du
An effective evaluation of transportation network efficiency could offer guidance for the optimal control of urban traffic. Based on the introduction and related mathematical analysis of three quantitative evaluation methods for transportation network efficiency, this paper compares the information measured by them…
Stefan Zondag, Jasper Schuurmans, Arnab Chaudhuri, Robin Visser + 6 more
Photocatalysis for small molecule activation has seen significant advancements over the past decade, yet its scale-up remains a challenge due to photon attenuation effects. A promising solution lies in harnessing high photonic intensities paired with continuous-flow reactor technology. However, a deep grasp of photon…
Authors not listed
Every ten years the photovoltaic market grows tenfold, driven by increasing cell efficiencies and lower manufacturing and installation costs. If the next decade maintains this trend it must be via a technological transformation: The first commercial silicon-based devices that exceed the 29.4% efficiency limit of…
Shin-ichi Koda, Shinji Saito
This study introduces correlated flat-bottom elastic network model (CFB-ENM), an extension of our recently developed flat-bottom elastic network model (FB-ENM) for generating plausible reaction paths. While FB-ENM improved upon the widely used image-dependent pair potential (IDPP) by addressing unintended structural…
Haitao Wei, Shusheng Zhang, Xiaohui He
Accurate and fast path calculation is essential for applications such as vehicle navigation systems and transportation network routing. Although many shortest path algorithms for restricted search areas have been developed in the past ten years to speed up the efficiency of path query, the performance including the…
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…
Josh Neudorf, Shaylyn Kress, Ron Borowsky
The relationship between structural and functional connectivity in the human brain is a core question in network neuroscience, and a topic of paramount importance to our ability to meaningfully describe and predict functional outcomes. Graph theory has been used to produce measures based on the structural connectivity…
Authors not listed
Identifying synthesis routes from knowledge graphs poses challenges beyond retrosynthesis, including path–finding artifacts and data issues. We introduce “SynGPS”, a novel algorithm that overcomes these limitations by identifying viable routes even with common artifacts. SynGPS can resolve nonsensical cycles…
Lin Wang, Fa Zhang, Kai Zheng, Athanasios V. Vasilakos + 2 more
'Xiaogang Li'] Abstract—The power consumption of enormous network devices in data centers has emerged as a big concern to data center operators. Despite many traffic-engineering-based solutions, very little attention has been paid on performance-guaranteed energy saving schemes. In this paper, we propose a novel…
Authors not listed
We propose and establish a new catalytic paradigm—\textbf{Optical Fiber Chemistry (OFC)}—as the fourth generation of catalysis after thermocatalysis, electro-/photocatalysis, and photoelectrochemical synergy. OFC is a \textbf{multilayer interfacial chemistry} (planar or curved), with the sandwich-structured optical…