Magnetic Liquid Metals Manipulated in the Three-Dimensional Free Space

2019 ◽  
Vol 11 (8) ◽  
pp. 8685-8692 ◽  
Author(s):  
Liang Hu ◽  
Hongzhang Wang ◽  
Xiaofei Wang ◽  
Xiao Liu ◽  
Jiarui Guo ◽  
...  
Keyword(s):  
Free Space ◽  
Liquid Metals ◽  
Three Dimensional ◽  
Magnetic Liquid

scholarly journals Bifurcations from steady to quasi-periodic flows in a laterally heated cavity filled with low Prandtl number fluids

2018 ◽  
Vol 861 ◽  
pp. 223-252 ◽  
Author(s):  
A. Medelfef ◽  
D. Henry ◽  
A. Bouabdallah ◽  
S. Kaddeche
Keyword(s):  
Prandtl Number ◽  
Liquid Metals ◽  
Three Dimensional ◽  
Numerical Continuation ◽  
Arnoldi Method ◽  
Periodic Flows ◽  
Bifurcation Points ◽  
Prandtl Numbers ◽  
Stable Flow ◽  
Flow States

This study deals with the transition toward quasi-periodicity of buoyant convection generated by a horizontal temperature gradient in a three-dimensional parallelepipedic cavity with dimensions $4\times 2\times 1$ (length $\times$ width $\times$ height). Numerical continuation techniques, coupled with an Arnoldi method, are used to locate the steady and Hopf bifurcation points as well as the different steady and periodic flow branches emerging from them for Prandtl numbers ranging from 0 to 0.025 (liquid metals). Our results highlight the existence of two steady states along with many periodic cycles, all with different symmetries. The bifurcation scenarios consist of complex paths between these different solutions, giving a succession of stable flow states as the Grashof number is increased, from steady to periodic and quasi-periodic. The change of these scenarios with the Prandtl number, in connection with the crossing of bifurcation points, was carefully analysed.

scholarly journals Time-efficient path planning using two virtual robots

2019 ◽  
Vol 16 (6) ◽  
pp. 172988141988674
Author(s):  
Jonghoek Kim
Keyword(s):  
Path Planning ◽  
Finite Time ◽  
Free Space ◽  
Path Length ◽  
Optimal Path ◽  
Three Dimensional ◽  
Computational Time ◽  
Topological Map ◽  
Planning Algorithms ◽  
Safe Path

This article introduces time-efficient path planning algorithms handling both path length and safety within a reasonable computational time. The path is planned considering the robot’s size so that as the robot traverses the constructed path, it doesn’t collide with an obstacle boundary. This article introduces two virtual robots deploying virtual nodes which discretize the obstacle-free space into a topological map. Using the topological map, the planner generates a safe and near-optimal path within a reasonable computational time. It is proved that our planner finds a safe path to the goal in finite time. Using MATLAB simulations, we verify the effectiveness of our path planning algorithms by comparing it with the rapidly-exploring random tree (RRT)-star algorithm in three-dimensional environments.

Analysis of free-space optical interconnects for the three-dimensional optoelectronic stacked processor

2002 ◽  
Vol 202 (4-6) ◽  
pp. 319-329 ◽  
Author(s):  
Guoqiang Li ◽  
Emel Yuceturk ◽  
Dawei Huang ◽  
Sadik C Esener
Keyword(s):  
Free Space ◽  
Optical Interconnects ◽  
Three Dimensional ◽  
Free Space Optical
Sign in / Sign up

Export Citation Format

Share Document