Results 41 to 50 of about 47,124 (214)
Path Planning Algorithms for Smart Parking: Review and Prospects
World Electric Vehicle JournalPath planning algorithms are crucial components in the process of smart parking. At present, there are many path planning algorithms designed for smart parking.
Zhonghai Han +5 more
doaj +1 more source
Optimal Path in Two and Three Dimensions
, 1998 We apply the Dijkstra algorithm to generate optimal paths between two given sites on a lattice representing a disordered energy landscape. We study the geometrical and energetic scaling properties of the optimal path where the energies are taken from a ...
Havlin, Shlomo +2 more
core +1 more source
Exact Distance Oracles for Planar Graphs [PDF]
, 2010 We present new and improved data structures that answer exact node-to-node distance queries in planar graphs. Such data structures are also known as distance oracles.
Mozes, Shay, Sommer, Christian
core +3 more sources
Path Planning of a Mobile Robot Based on the Improved RRT Algorithm
Applied Sciences, 2023 RRT (rapidly exploring random tree) is a sampling-based planning algorithm that has been widely used due to its simple structure and fast speed. However, the RRT algorithm has several issues such as low planning efficiency, high randomness, and poor path
Xiangjie Li, Yala Tong
doaj +1 more source
Property-Driven Fence Insertion using Reorder Bounded Model Checking [PDF]
, 2015 Modern architectures provide weaker memory consistency guarantees than sequential consistency. These weaker guarantees allow programs to exhibit behaviours where the program statements appear to have executed out of program order.
Joshi, Saurabh, Kroening, Daniel
core +2 more sources
Comparison of Dijkstra dan Floyd-Warshall Algorithm to Determine the Best Route of Train
IJID (International Journal on Informatics for Development), 2019 This study aims to find out the comparison of Dijkstra and Floyd-Warshall algorithms in finding the best path on a train trip. The best route is the path, which has the minimum price of a train journey.
Tri Setya Dermawan
doaj +1 more source
An implementation of the Dilkstra algorithm for fuzzy costs (Technical report 2018) [PDF]
, 2019 This report presents an implementation the Dijkstra algorithm applied to a type V fuzz graph. This new algorithm can find the shortest path in a graph with edge costs are defined as positive triangular fuzzy ...
Alonso, Sira +3 more
core +1 more source
Automating AI Discovery for Biomedicine Through Knowledge Graphs and Large Language Models Agents
Advanced Intelligent Discovery, EarlyView.This work proposes a novel framework that automates biomedical discovery by integrating knowledge graphs with multiagent large language models. A biologically aligned graph exploration strategy identifies hidden pathways between biomedical entities, and specialized agents use this pathway to iteratively design AI predictors and wet‐lab validation ...
Naafey Aamer +3 more
wiley +1 more source
An algorithm for operational navigation in urban development using reinforcement learning [PDF]
The International Archives of the Photogrammetry, Remote Sensing and Spatial Information SciencesThis paper presents a navigation system for unmanned aerial vehicles (UAVs) operating in urban environments, where the main challenges include changes to the city layout that may not be reflected on existing maps.
I. Alyrchikov +3 more
doaj +1 more source
Advanced Intelligent Systems, EarlyView.Four decades of retinal vessel segmentation research (1982–2025) are synthesized, spanning classical image processing, machine learning, and deep learning paradigms. A meta‐analysis of 428 studies establishes a unified taxonomy and highlights performance trends, generalization capabilities, and clinical relevance.
Avinash Bansal +6 more
wiley +1 more source