Results 31 to 40 of about 22,360 (263)

Efficient Pathfinding on Grid Maps: Comparative Analysis of Classical Algorithms and Incremental Line Search

open access: yesIEEE Access
Pathfinding on grid maps is a cornerstone problem in robotics, autonomous navigation, and game development. Classical algorithms such as A*, Dijkstra’s, and Breadth-First Search (BFS) are known for their ability to guarantee optimal solutions ...
Amr Elshahed   +4 more
doaj   +1 more source

Testing a Personalized Approach to Chronic Low Back Pain: A Randomized Controlled Trial in Older Veterans

open access: yesArthritis Care &Research, EarlyView.
Objective We aimed to test the efficacy of personalized treatment of older veterans with chronic low back pain (CLBP) delivered by Aging Back Clinics (ABCs) as compared with usual care (UC). Methods Two hundred ninety‐nine veterans aged 65 to 89 with CLBP from three Veterans Affairs (VA) medical centers underwent baseline testing, randomization to ABC ...
Debra K. Weiner   +9 more
wiley   +1 more source

The Application of Floyd Algorithm for Returning Path Algorithm with Constraints of Time and Limit of Load

open access: yesMATEC Web of Conferences, 2016
Under ideal condition, there are lots of Shortest Path Algorithms such as Dijkstra, Floyd, Johnson algorithms. However, putting these algorithms into use is not as we expected.
Luo Jian Feng, Chen Yu Qiang
doaj   +1 more source

Hopfield Neural Networks for Online Constrained Parameter Estimation With Time‐Varying Dynamics and Disturbances

open access: yesInternational Journal of Adaptive Control and Signal Processing, EarlyView.
This paper proposes two projector‐based Hopfield neural network (HNN) estimators for online, constrained parameter estimation under time‐varying data, additive disturbances, and slowly drifting physical parameters. The first is a constraint‐aware HNN that enforces linear equalities and inequalities (via slack neurons) and continuously tracks the ...
Miguel Pedro Silva
wiley   +1 more source

A fast layered path planning algorithm for job shop scheduling problem

open access: yesIET Collaborative Intelligent Manufacturing, 2022
Job shop scheduling problem (JSP) is a classical system resource optimisation problem and also an NP hard problem. The search algorithm based on Akers obstacle graph model is an effective algorithm to solve JSP, which first removes part of jobs from the ...
Lin Huang, Shikui Zhao, Qing Han
doaj   +1 more source

Bistable Mechanisms 3D Printing for Mechanically Programmable Vibration Control

open access: yesAdvanced Engineering Materials, EarlyView.
This work introduces a 3D‐printed bistable mechanism integrated into tuned mass dampers (TMDs) for mechanically adaptive passive vibration suppression. Through optimized geometry, the bistable design provides adaptable vibration reduction across a broad range of scenarios, achieving effective vibration mitigation without complex controls or external ...
Ali Zolfagharian   +4 more
wiley   +1 more source

Randomized Shortest-Path Problems: Two Related Models [PDF]

open access: yesNeural Computation, 2009
This letter addresses the problem of designing the transition probabilities of a finite Markov chain (the policy) in order to minimize the expected cost for reaching a destination node from a source node while maintaining a fixed level of entropy spread throughout the network (the exploration). It is motivated by the following scenario.
Saerens, Marco   +3 more
openaire   +3 more sources

Efficient Process Development for Laser Powder Bed Fusion of a Soft‐Magnetic Metallic Glass Composite

open access: yesAdvanced Engineering Materials, EarlyView.
Iron‐based metallic glass alloys exhibit excellent soft‐magnetic properties, and unprecedented geometrical freedom in the design of soft‐magnetic metallic glass components is made possible by additive manufacturing. An efficient workflow for developing parameters for laser‐based powder bed fusion of a Fe‐based metallic glass alloy is presented along ...
Julia Löfstrand   +7 more
wiley   +1 more source

INTRODUCING A NOVEL METHOD TO SOLVE SHORTEST PATH PROBLEMS BASED ON STRUCTURE OF NETWORK USING GENETIC ALGORITHM [PDF]

open access: yesThe International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences, 2019
The shortest path problem is widely applied in transportation, communication and computer networks. It addresses the challenges of determining a path with minimum distance, time or cost from a source to the destination.
S. Behzadi, M. Kolbadinejad
doaj   +1 more source

Transfer of Energy and Momentum Between Magnetoactive Surface Microstructure and a Solid Object

open access: yesAdvanced Engineering Materials, EarlyView.
We demonstrate that magnetoactive multilamellar arrays subjected to a rotating magnetic field can function as platforms for controlled transport of physical objects. Through systematic experimental investigation, we elucidate the underlying physical mechanisms determining the upper limit of the achievable transportation speed in such magnetic “conveyor‐
Arne Geldof   +9 more
wiley   +1 more source

Home - About - Disclaimer - Privacy