Results 41 to 50 of about 5,433,526 (396)
Path planning for mobile robots using Morphological Dilation Voronoi Diagram Roadmap algorithm
Scientific African, 2021 This paper presents Morphological Dilation Voronoi Diagram Roadmap (MVDRM) algorithm to address unsafe path computation accompanied by high time and space computation complexity problems of roadmap path planning methods in complex environments for mobile
Ben Beklisi Kwame Ayawli +4 more
doaj
A simple scheme for expanding photonic cluster states for quantum information [PDF]
, 2010 We show how an entangled cluster state encoded in the polarization of single photons can be straightforwardly expanded by deterministically entangling additional qubits encoded in the path degree of freedom of the constituent photons.
A. Laing +26 more
core +3 more sources
A Survey of Path Planning Algorithms for Mobile Robots
Vehicles, 2021 Path planning algorithms are used by mobile robots, unmanned aerial vehicles, and autonomous cars in order to identify safe, efficient, collision-free, and least-cost travel paths from an origin to a destination.
Karthik Karur +3 more
semanticscholar +1 more source
Journal of Cloud Computing: Advances, Systems and Applications, 2022 In recent years, with the development of Unmanned Aerial Vehicle (UAV) and Cloud Internet-of-Things (Cloud IoT) technology, data collection using UAVs has become a new technology hotspot for many Cloud IoT applications.
Yiguang Gong +3 more
doaj +1 more source
Shortest Paths Avoiding Forbidden Subpaths [PDF]
, 2009 In this paper we study a variant of the shortest path problem in graphs: given a weighted graph G and vertices s and t, and given a set X of forbidden paths in G, find a shortest s-t path P such that no path in X is a subpath of P.
Ahmed, Mustaq, Lubiw, Anna
core +6 more sources
Dark path holonomic qudit computation
Physical Review A, 2022 New figure 2 added; several minor changes; references added; journal reference ...
Tomas André, Erik Sjöqvist
openaire +3 more sources
Generalizing Weighted Path Orders [PDF]
arXiv, 2023 We show that weighted path orders are special instances of a variant of semantic path orders. Exploiting this fact, we introduce a generalization of weighted path orders that goes beyond the realm of simple termination. Experimental data show that generalized weighted path orders are viable.
arxiv
Robot Static Path Planning Method Based on Deterministic Annealing
Machines, 2022 Heuristic calculation is an essential method to solve optimisation problems. However, its vast computing requirements limit its real-time and online applications, especially in embedded systems with limited computing resources, such as mobile robots ...
Jinyu Dai +5 more
doaj +1 more source
Computing and Listing Avoidable Vertices and Paths
Algorithmica, 2022 AbstractA simplicial vertex of a graph is a vertex whose neighborhood is a clique. It is known that listing all simplicial vertices can be done in O(nm) time or $$O(n^{\omega })$$ O ( n ω )
Charis Papadopoulos, Athanasios E. Zisis
openaire +2 more sources
A Strategic Value Appropriation Path for Cloud Computing
Journal of Management Information Systems, 2018 Cloud-based information management is one of the leading competitive differentiation strategies for firms. With the increasing criticality of information management in value creation and process support, establishing an integrated capability with cloud ...
A. Kathuria +4 more
semanticscholar +1 more source