Results 41 to 50 of about 158,681 (246)
Measurement + Control, 2019 Wheeled mobile robots are widely utilized for environment-exploring tasks both on earth and in space. As a basis for global path planning tasks for wheeled mobile robots, in this study we propose a method for establishing an energy-based cost map.
Bo You +4 more
doaj +1 more source
Solving a Hamiltonian Path Problem with a bacterial computer
Journal of Biological Engineering, 2009 Background The Hamiltonian Path Problem asks whether there is a route in a directed graph from a beginning node to an ending node, visiting each node exactly once. The Hamiltonian Path Problem is NP complete, achieving surprising computational complexity
Treece Jessica +18 more
doaj +1 more source
Canonical Transformations and Path Integral Measures
, 1994 This paper is a generalization of previous work on the use of classical canonical transformations to evaluate Hamiltonian path integrals for quantum mechanical systems.
A. Niemi +19 more
core +2 more sources
DNA Computing the Hamiltonian Path Problem
Molecules and Cells, 1999 The directed Hamiltonian path (DHP) problem is one of the hard computational problems for which there is no practical algorithm on a conventional computer available. Many problems, including the traveling sales person problem and the longest path problem, can be translated into the DHP problem, which implies that an algorithm for DHP can also solve all
C M, Lee, S W, Kim, S M, Kim, U, Sohn
openaire +2 more sources
Imaging of Biphoton States: Fundamentals and Applications
Advanced Functional Materials, EarlyView.Quantum states of two photons exhibit a rich polarization and spatial structure, which provides a fundamental resource of strongly correlated and entangled states. This review analyzes the physics of these intriguing properties and explores the various techniques and technologies available to measure them, including the state of the art of their ...
Alessio D'Errico, Ebrahim Karimi
wiley +1 more source
Path Independence in Adiabatic Quantum Computing for Hadamard Gate
Journal of Mathematical and Fundamental Sciences, 2014 The computation time in adiabatic quantum computing (AQC) is determined by the time limit of the adiabatic evolution, which in turn depends on the evolution path. In this research we have used the variational method to find an optimized path.
Jusak Sali Kosasih +2 more
doaj +1 more source
Robust and Safe Autonomous Navigation for Systems With Learned SE(3) Hamiltonian Dynamics
IEEE Open Journal of Control Systems, 2022 Stability and safety are critical properties for successful deployment of automatic control systems. As a motivating example, consider autonomous mobile robot navigation in a complex environment. A control design that generalizes to different operational
Zhichao Li, Thai Duong, Nikolay Atanasov
doaj +1 more source
2D Magnetic and Topological Quantum Materials and Devices for Ultralow Power Spintronics
Advanced Functional Materials, EarlyView.2D magnets and topological quantum materials enable ultralow‐power spintronics by combining robust magnetic order with symmetry‐protected, Berry‐curvature‐driven transport. Fundamentals of 2D anisotropy and spin‐orbit‐coupling induced band inversion are linked to scalable growth and vdW stacking.
Brahmdutta Dixit +5 more
wiley +1 more source
On hamiltonian chain saturated uniform hypergraphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2012 Graphs and ...
Aneta Dudek, Andrzej Zak
doaj +1 more source
On reciprocal degree distance of graphs
Heliyon, 2023 Given a connected graph H, its reciprocal degree distance is defined asRDD(H)=∑x≠ydH(vx)+dH(vy)dH(vx,vy), where dH(vx) denotes the degree of the vertex vx in the graph H and dH(vx,vy) is the shortest distance between vx and vy in H.
Mingqiang An +3 more
doaj +1 more source