Results 21 to 30 of about 1,852 (138)

Rapid path planning algorithm for mobile robot in dynamic environment

Advances in Mechanical Engineering, 2017
Searching the lowest-cost path through a graph is central to many problems, including path planning for a mobile robot. By combining Dijkstra’s algorithm, A* algorithm, and rolling window principle, a new rapid path planning algorithm for a mobile robot ...
Hong-mei Zhang, Ming-long Li
doaj   +1 more source

Algorithms for Finding Shortest Paths in Networks with Vertex Transfer Penalties

Algorithms, 2020
In this paper we review many of the well-known algorithms for solving the shortest path problem in edge-weighted graphs. We then focus on a variant of this problem in which additional penalties are incurred at the vertices. These penalties can be used to
Rhyd Lewis
doaj   +1 more source

Strategic Impact of EU Taxonomy on Pharmaceutical Firms' Performance

Business Strategy and the Environment, EarlyView.
ABSTRACT Sustainability has become a central concern in economic policy and corporate governance, increasingly formalised through regulatory frameworks of the European Union (EU). The European Commission has published the EU Taxonomy, which allows economic activities and their contribution to sustainability to be analysed, taking into account ...
Alicia Ramírez‐Orellana, Cristina Blanco González‐Tejero, Silvia Giralt Escobar, Antonio Garcia‐Amate   +3 more
wiley   +1 more source

A Two‐Stage Optimization Approach for Selecting Electric‐Flight Airports

Networks, EarlyView.
ABSTRACT The decarbonization of short‐haul air transport has gained increasing attention, with electric aircraft emerging as a promising alternative to conventional short‐haul aviation. However, given the substantial investment anticipated for the necessary infrastructure, a strategic and globally coordinated selection of airports is imperative.
Imke Joormann, Frederic Kroner, Andreas M. Tillmann   +2 more
wiley   +1 more source

Routing in triple loop circulants: A case of networks-on-chip

Heliyon, 2020
In this paper we propose and analyze various approaches to organizing routing in a triple loop circulant topologies as applied to networks-on-chip: static routing based on universal graph search algorithms, such as Dijkstra's algorithm and a possible ...
Aleksandr Yu. Romanov, Vladimir A. Starykh   +1 more
doaj   +1 more source

Optimal Path Planning Method for IMU System-Level Calibration Based on Improved Dijkstra’s Algorithm

IEEE Access, 2023
The calibration path of system-level calibration directly affects the incentive effect of the error term and thus the calibration accuracy. Currently, the planning of system-level calibration paths is predominantly designed based on personal experience ...
Xuesong Bai, Lu Wang, Yuanbiao Hu, Pingfei Li, Yutong Zu   +4 more
doaj   +1 more source

Hunting Strategies and Game Exploitation Organization in the Magdalenian: An Integrated Approach Based on Mortality Profiles and Stable Isotopes at Chaves Cave (Huesca, Spain)

International Journal of Osteoarchaeology, EarlyView.
ABSTRACT Understanding hunting strategies in Upper Paleolithic contexts remains challenging due to the complex relationships between prey behavior, environmental conditions, and human decision‐making. Addressing these dynamics requires integrating archeozoological, geospatial, and geochemical proxies capable of capturing demographic patterns, landscape
Alejandro Sierra, Marie Balasse, Luis Jiménez, Rafael Domingo, Lourdes Montes, Denis Fiorillo, Pilar Utrilla   +6 more
wiley   +1 more source

Competing all-pairs shortest paths algorithms for sparse / dense graphs: implementation and comparison

Системный анализ и прикладная информатика
In this paper we consider two families of competing algorithms for finding the shortest paths between all pairs of vertices (APSP) in directed weighted large graphs with different edge densities: Dijkstra and Floyd-Warshall. For comparison, we have taken
A. A. Prihozhy, O. N. Karasik
doaj   +1 more source

NNIR: N-Non-Intersecting-Routing Algorithm for Multi-Path Resilient Routing in Telecommunications Applications

International Journal of Computational Intelligence Systems, 2020
In this paper, we will present a N-Non-Intersecting-Routing (NNIR) algorithm which is used to reduce the cost of resilient routing in telecommunications problems.
Lewis Veryard, Hani Hagras, Andrew Starkey, Anthony Conway, Gilbert Owusu   +4 more
doaj   +1 more source

Implementation of Dijkstra's Algorithm to Find a School Shortest Distance Based on The Zoning System in South Tangerang

Intensif: Jurnal Ilmiah Penelitian Teknologi dan Penerapan Sistem Informasi, 2022
School is an essential thing for education quality. This time, the South Tangerang government is implementing a new student admission process using a zoning system; all prospective students must choose a school that has the shortest distance from their ...
Maulana Muhamad Sulaiman, Sahlan Sahlan
doaj   +1 more source