Results 51 to 60 of about 16,130 (172)
Journal of Field Robotics, EarlyView.ABSTRACT This work presents a non‐geometrical navigation approach based on a purely topological understanding of underground environments. By conceptualizing subterranean scenarios as a set of tunnels that intersect with each other, and taking a navigation approach based on topological instructions, we simplify the navigation problem to the sequential ...
Lorenzo Cano +2 more
wiley +1 more source
Path planning algorithm for a car-like robot based on cell decomposition method [PDF]
, 2013 This project proposes an obstacle avoiding path planning algorithm based on cell decomposition method for a car-like robot. Dijkstra’s algorithm is applied in order to find the shortest path. Using cell decomposition, the free space of the robot is
Omar, Nurhanum
core
Path‐Based Deep Reinforcement Learning for On‐Board Routing in Satellite Constellation Networks
International Journal of Satellite Communications and Networking, EarlyView.ABSTRACT Efficient usage of available network resources is a crucial factor for broadband services in interconnected satellite constellations. To meet required quality of service standards under heavy network loads, it is essential to optimize traffic distribution among the intersatellite links. To address this challenge, we propose an adaptive traffic
Manuel M. H. Roth +4 more
wiley +1 more source
Recent Application of Dijkstra’s Algorithm in the Process of Production Planning
Applied Sciences, 2022 This paper aims to develop a method that could serve as a tool for evaluating extracted raw materials in terms of use by considering the place of extraction and consumption.
Marcel Behún +4 more
doaj +1 more source
Causal Domain Restriction for Eikonal Equations
, 2014 Many applications require efficient methods for solving continuous shortest path problems. Such paths can be viewed as characteristics of static Hamilton-Jacobi equations.
Chacon, Adam +2 more
core +1 more source
Sustainable Development, EarlyView.ABSTRACT Education is a cornerstone of sustainable development, yet large disparities in access persist across and within countries—particularly in Africa, where millions remain underserved. Among several factors influencing educational participation, physical accessibility to schools (in terms of travel time) is not comprehensively understood ...
Diana Jaramillo‐Araujo, Jim W. Hall
wiley +1 more source
Potential of Using the Ant Colony Optimization Algorithm for Optimal Network Path Selection
Proceedings of the International Conference on Applied Innovations in ITThe article considers the possibilities of using the Ant Colony Optimization algorithm to find the shortest path in the network based on the selected criteria. Its performance is compared to Dijkstra's algorithm and LCA algorithm, which is widely used in
Oleksandra Yaroshevska, Veronika Kirova
doaj +1 more source
Defining Equitable Geographic Districts in Road Networks via Stable Matching
, 2017 We introduce a novel method for defining geographic districts in road networks using stable matching. In this approach, each geographic district is defined in terms of a center, which identifies a location of interest, such as a post office or polling ...
Eppstein, David +3 more
core +1 more source
Volume Quantization with Flexible Singularities for Hexahedral Meshing
Computer Graphics Forum, EarlyView.Abstract We present a novel algorithm for quantization and subsequent hexahedral mesh generation from seamless volumetric maps. Quantization is the process of choosing integers that represent the numbers of hexahedral elements to be placed in each region of the volume, and transforming the seamless map into an integer‐grid map matching that choice ...
H. Brückler, M. Campen
wiley +1 more source
A QUANTUM IMPROVEMENT ON DIJKSTRA’S ALGORITHM FOR COMPUTER NETWORK ROUTING [PDF]
مجلة جامعة الانبار للعلوم الصرفة, 2008 The aim of this paper is to improve the Dijkstra algorithm which is widely used in the internet routing. Quantum computing approach is used to improve the work of Dijkstra algorithm for network routing by exploiting the massive parallelism existing in ...
Rana F. Ghani, Ahmed T. Sadik
doaj +1 more source