Results 71 to 80 of about 989,695 (238)
Robot visual navigation estimation and target localization based on neural network
Paladyn, 2022 The high computational cost, complex external environment, and limited computing resources of embedded system are some major problems in traditional autonomous robot navigation methods.
Zhao Yanping +2 more
doaj +1 more source
When the path is never shortest: a reality check on shortest path biocomputation
, 2017 Shortest path problems are a touchstone for evaluating the computing performance and functional range of novel computing substrates. Much has been published in recent years regarding the use of biocomputers to solve minimal path problems such as route ...
A Adamatzky +28 more
core +1 more source
Finding Shortest Paths With Computational Geometry [PDF]
Journal of Graph Algorithms and Applications, 2003 Summary: We present a heuristic search algorithm for the \(\mathbb R^d\) Manhattan shortest path problem that achieves front-to-front bidirectionality in subquadratic time. In the study of bidirectional search algorithms, front-to-front heuristic computations were thought to be prohibitively expensive (at least quadratic time complexity); our algorithm
openaire +2 more sources
Optimal time reuse strategy-based dynamic multi-AGV path planning method
Complex & Intelligent SystemsThe window strategy, known for its flexibility and efficiency, is extensively used in dynamic path planning. To further enhance the performance of the Automated Guided Vehicles (AGVs) sorting system, the two processes of AGV movement and path planning ...
Ke Wang +4 more
doaj +1 more source
Application of New Technology of Intelligent Robot Plant Protection in Ecological Agriculture
Journal of Food Quality, 2022 Crop diseases, pest infestations, water shortages, weed infestations, and other issues affect the agriculture sector. Due to existing agricultural techniques, these issues result in significant crop loss, economic loss, and severe environmental hazards ...
Zhe An +6 more
doaj +1 more source
Path integral computation of phonon anharmonicity [PDF]
The European Physical Journal B, 2004 The partition function of an oscillator disturbed by a set of electron particle paths has been computed by a path integral method which permits to evaluate at any temperature the relevant cumulant terms in the series expansion. The time dependent source current peculiar of the semiclassical Su-Schrieffer-Heeger model induces large electron-phonon ...
openaire +4 more sources
Acceleration of Shortest Path and Constrained Shortest Path Computation [PDF]
, 2005 We study acceleration methods for point-to-point shortest path and constrained shortest path computations in directed graphs, in particular in road and railroad networks. Our acceleration methods are allowed to use a preprocessing of the network data to create auxiliary information which is then used to speed-up shortest path queries.
Köhler, Ekkehard +2 more
openaire +2 more sources
GPU Based Path Integral Control with Learned Dynamics [PDF]
, 2015 We present an algorithm which combines recent advances in model based path integral control with machine learning approaches to learning forward dynamics models.
Daniel, Tom +2 more
core
Maximum Flux Transition Paths of Conformational Change
, 2010 Given two metastable states A and B of a biomolecular system, the problem is to calculate the likely paths of the transition from A to B. Such a calculation is more informative and more manageable if done for a reduced set of collective variables chosen ...
Berkowitz M. +40 more
core +1 more source
On the computational complexity of path cover problems
Journal of Computer and System Sciences, 1984 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Teofilo F. Gonzalez, Simeon Ntafos
openaire +3 more sources