نتایج جستجو برای: random particle method

تعداد نتایج: 1991273  

Journal: :Computers & Chemical Engineering 2003
Z. Chen L. G. Gibilaro N. Jand

A procedure is described for limiting the void fraction in fluid particle systems, computed by means of numerical multiphase flow simulation codes, to values which do not fall below those realisable in practice. It is based on a computation of the particle /particle contact forces which come into play only when computed void fractions fall to values below those corresponding to random packing o...

Journal: :journal of computer and robotics 0
roham shakiba mechatronics research lab., electrical, computer, and it dept, qazvin branch, islamic azad university, qazvin, iran mostafa e. salehi mechatronics research lab., electrical, computer, and it dept, qazvin branch, islamic azad university, qazvin, iran

in this paper we introduce an improvement in the path planning algorithm for the humanoid soccer playing robot which uses ferguson splines and pso (particle swarm optimization). the objective of the algorithm is to find a path through other playing robots to the ball, which should be as short as possible and also safe enough. ferguson splines create preliminary paths using random generated para...

2014
Zhou Feng

Received Aug 11, 2013 Revised Feb 20, 2014 Accepted Mar 10, 2014 A based on Rapidly-exploring Random Tree (RRT) and Particle Swarm Optimizer (PSO) for path planning of the robot is proposed. First the grid method is built to describe the working space of the mobile robot, then the Rapidly-exploring Random Tree algorithm is used to obtain the global navigation path, and the Particle Swarm Optimi...

2008
Majid Hosseini

In this note we introduce a self-interacting random walk in a dynamic random environment, prove that it is recurrent and find its scaling limit. The environment evolves in time in conjunction with the random walk and is nonmarkovian; however we will show that the walk only remembers the recent past. Various models of self-interacting random walks and random walks in dynamic random environments ...

2016
Peiyu Ren Yancang Li Huiping Song Zhiyong Zhang Xiaoyang He Xiaohua Sun Junhao Wang Fushun Wang Yazhong Lin

A method based on particle swarm optimization (PSO) for steel strip image segmentation was presented. Considered the traditional markov method is hard to get good effect in global optimization solution, the particle swarm optimization is used to enhance search capacity in the multi-dimensional space and determine the parameters of markov random field to optimize the objective function which com...

2009
Shuming Wang Junzo Watada

This paper studies reliability optimization of a series-parallel system with fuzzy random lifetimes. A fuzzy random reliability model is developed to maximize the system reliability. Since the reliability function consists of fuzzy random parameters, classical mathematical programming methods is not applicable to the reliability model. Therefore, in order to solve the model, a fuzzy random simu...

2008
Iwan Schenker Frank T. Filser Hans J. Herrmann Ludwig J. Gauckler

The newly developed “void expansion method” allows for an efficient generation of porous packings of spherical particles over a wide range of volume fractions using the discrete element method. Particles are randomly placed under addition of much smaller “void-particles”. Then, the void-particle radius is increased repeatedly, thereby rearranging the structural particles until formation of a de...

Journal: :CoRR 2013
Jun Sun Xiaojun Wu Vasile Palade Wei Fang Yuhui Shi

The random drift particle swarm optimization (RDPSO) algorithm, inspired by the free electron model in metal conductors placed in an external electric field, is presented, systematically analyzed and empirically studied in this paper. The free electron model considers that electrons have both a thermal and a drift motion in a conductor that is placed in an external electric field. The motivatio...

2003
Hedvig Sidenbladh Sven-Lennart Wirkander

Tracking of multiple objects simultaneously over time is an important research problem. When the number of objects to track is known, standard Bayesian methods like PDA/JPDA can be employed. However, when the number of objects to track is unknown or varies over time, tracking hypotheses with different numbers of objects have to be compared. This can be addressed in a mathematically grounded man...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید