Results 51 to 60 of about 154,862 (311)

Hamiltonian path planning in constrained workspace [PDF]

open access: yesEuropean Journal of Control, 2017
Abstract A methodology to plan the trajectories of robots that move in an n-dimensional Euclidean space, have to reach a target avoiding obstacles and are constrained to move in a region of the space is described. It is shown that if the positions of the obstacles are known then a Hamiltonian function can be constructed and used to define a collision ...
Casagrande, Daniele   +2 more
openaire   +4 more sources

Canonical Transformations and Path Integral Measures

open access: yes, 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

Covariant Hamiltonian field theory. Path integral quantization

open access: yes, 2004
The Hamiltonian counterpart of classical Lagrangian field theory is covariant Hamiltonian field theory where momenta correspond to derivatives of fields with respect to all world coordinates.
Bashkirov, D., Sardanashvily, G.
core   +3 more sources

Hamilton-chain saturated hypergraphs [PDF]

open access: yes, 2010
We say that a hypergraph H is hamiltonian path (cycle) saturated if H does not contain an open (closed) hamiltonian chain but by adding any new edge we create an open (closed) hamiltonian chain in H.
Andrzej Żak   +2 more
core   +1 more source

Consolidate Overview of Ribonucleic Acid Molecular Dynamics: From Molecular Movements to Material Innovations

open access: yesAdvanced Engineering Materials, EarlyView.
Molecular dynamics simulations are advancing the study of ribonucleic acid (RNA) and RNA‐conjugated molecules. These developments include improvements in force fields, long‐timescale dynamics, and coarse‐grained models, addressing limitations and refining methods.
Kanchan Yadav, Iksoo Jang, Jong Bum Lee
wiley   +1 more source

Solving a Hamiltonian Path Problem with a bacterial computer

open access: yesJournal 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

New Developments in the Field of Production and Application of Multi‐Material Wire Arc Additive Manufacturing Components: A Review

open access: yesAdvanced Engineering Materials, EarlyView.
The utilization of direct energy deposition (DED)‐arc additive manufacturing processes in industrial applications is increasing, and these processes have the potential for multi‐material applications. This work provides a overview of the state of research in DED‐arc made functional graded structures, to establish a link to potential industrial ...
Kai Treutler, Volker Wesling
wiley   +1 more source

Chain level Floer theory and Hofer's geometry of the Hamiltonian diffeomorphism group

open access: yes, 2001
In this paper we first apply the chain level Floer theory to the study of Hofer's geometry of Hamiltonian diffeomorphism group in the cases without quantum contribution: we prove that any quasi-autonomous Hamiltonian path on weakly exact symplectic ...
Oh, Yong-Geun
core   +4 more sources

The Hamiltonian limit of (3+1)D SU(3) lattice gauge theory on anisotropic lattices [PDF]

open access: yes, 2003
The extreme anisotropic limit of Euclidean SU(3) lattice gauge theory is examined to extract the Hamiltonian limit, using standard path integral Monte Carlo (PIMC) methods.
A. Hasenfratz   +62 more
core   +2 more sources

Path Independence in Adiabatic Quantum Computing for Hadamard Gate

open access: yesJournal 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

Home - About - Disclaimer - Privacy