scholarly journals Adaptive planning in human search

2018 ◽  
Author(s):  
Moritz J. F. Krusche ◽  
Eric Schulz ◽  
Arthur Guez ◽  
Maarten Speekenbrink
Keyword(s):  
Test Problems ◽  
Two Dimensional ◽  
Complex Environments ◽  
Adaptive Planning ◽  
Restricted Movement ◽  
Planning Algorithm ◽  
Complex Models ◽  
Root Sampling ◽  
Foraging Task

AbstractHow do people plan ahead when searching for rewards? We investigate planning in a foraging task in which participants search for rewards on an infinite two-dimensional grid. Our results show that their search is best-described by a model which searches at least 3 steps ahead. Furthermore, participants do not seem to update their beliefs during planning, but rather treat their initial beliefs as given, a strategy similar to a heuristic called root-sampling. This planning algorithm corresponds well with participants’ behavior in test problems with restricted movement and varying degrees of information, outperforming more complex models. These results enrich our understanding of adaptive planning in complex environments.

Investigation of two-dimensional nonstationary processes of outflow a gas-saturated liquid from axisymmetric vessels

2012 ◽  
Vol 9 (1) ◽  
pp. 47-52
Author(s):  
R.Kh. Bolotnova ◽  
V.A. Buzina
Keyword(s):  
Comparative Analysis ◽  
Numerical Model ◽  
Liquid Mixture ◽  
Phase Model ◽  
Test Problems ◽  
Two Dimensional ◽  
Nonstationary Processes ◽  
Saturated Liquid ◽  
Two Phase ◽  
One Dimensional

The two-dimensional and two-phase model of the gas-liquid mixture is constructed. The validity of numerical model realization is justified by using a comparative analysis of test problems solution with one-dimensional calculations. The regularities of gas-saturated liquid outflow from axisymmetric vessels for different geometries are established.

Effects of active crowder size and activity-crowding coupling on polymer translocation

Soft Matter ◽  
2020 ◽  
Author(s):  
Fei Tan ◽  
Ying Chen ◽  
Nanrong Zhao
Keyword(s):  
Langevin Dynamics ◽  
Dynamics Simulation ◽  
Biological Processes ◽  
Two Dimensional ◽  
Complex Environments ◽  
Polymer Translocation ◽  
Langevin Dynamics Simulation

Polymer translocation in complex environments is crucially important to many biological processes in life. In the present work, we adopted two-dimensional Langevin dynamics simulation to study the forced and unbiased...

scholarly journals A Novel Path Planning Algorithm for Warehouse Robots Based on a Two-Dimensional Grid Model

IEEE Access ◽  
2020 ◽  
Vol 8 ◽  
pp. 80347-80357 ◽  
Author(s):  
Bo Yang ◽  
Wentao Li ◽  
Jianrong Wang ◽  
Jingjie Yang ◽  
Tiantian Wang ◽  
...  
Keyword(s):  
Path Planning ◽  
Two Dimensional ◽  
Grid Model ◽  
Planning Algorithm ◽  
Path Planning Algorithm

A real-time immune planning algorithm incorporating a specific immune mechanism for multi-robots in complex environments

2017 ◽  
Vol 231 (1) ◽  
pp. 29-42
Author(s):  
Mingxin Yuan ◽  
Yafeng Jiang ◽  
Xiaobin Hua ◽  
Binbin Wang ◽  
Yi Shen
Keyword(s):  
Real Time ◽  
Obstacle Avoidance ◽  
Antibody Concentration ◽  
Minimum Problem ◽  
Local Minima ◽  
Immune Mechanism ◽  
Complex Environments ◽  
Avoidance Behaviors ◽  
Planning Algorithm ◽  
The Impact

To solve the real-time path planning of multi-robots in complex environments, a new immune planning algorithm incorporating a specific immune mechanism is presented. In the immune planning algorithm incorporating a specific immune mechanism, a new coding format for an antibody is first defined according to the impact of the obstacle distribution on the obstacle avoidance behaviors of multi-robots. Then, a new robot immune dynamic model for antibody selection is designed in terms of different impacts of obstacles and targets on robot behaviors. Finally, aiming at the local minimum problem in complex environments and inspired by the specific immune mechanism, a series of appropriate avoidance behaviors are selected through the calculation of a specific immune mechanism to help robots walk out of local minima. In addition, to solve deadlock situations, a learning strategy for the antibody concentration is presented. Compared with four related immune planning algorithms—an improved artificial potential field, a rapidly exploring random tree algorithm, a D* algorithm and a A* algorithm—the simulation results in four static environments show that the paths planned by immune planning algorithm incorporating a specific immune mechanism are the shortest and the path smoothness is generally the highest, which shows its strong planning capability in multi-obstacle environments. The simulation result in a dynamic environment with local minima shows that the immune planning algorithm incorporating a specific immune mechanism has strong planning ability in dynamic obstacle avoidance and in escaping from local minima. Additionally, an experiment in a multi-robot environment shows that two robots can not only avoid static obstacles but also avoid dynamic obstacles, which further supports the validity of the proposed immune planning algorithm incorporating a specific immune mechanism for multi-robots in real environments.

scholarly journals Analytical Solution of Two-Dimensional Sine-Gordon Equation

2021 ◽  
Vol 2021 ◽  
pp. 1-15
Author(s):  
Alemayehu Tamirie Deresse ◽  
Yesuf Obsie Mussa ◽  
Ademe Kebede Gizaw
Keyword(s):  
Numerical Solutions ◽  
Initial Conditions ◽  
Nonlinear Partial Differential Equations ◽  
Test Problems ◽  
Two Dimensional ◽  
Sine Gordon Equation ◽  
Science And Engineering ◽  
Transform Method ◽  
Differential Transform ◽  
Good Agreement

In this paper, the reduced differential transform method (RDTM) is successfully implemented for solving two-dimensional nonlinear sine-Gordon equations subject to appropriate initial conditions. Some lemmas which help us to solve the governing problem using the proposed method are proved. This scheme has the advantage of generating an analytical approximate solution or exact solution in a convergent power series form with conveniently determinable components. The method considers the use of the appropriate initial conditions and finds the solution without any discretization, transformation, or restrictive assumptions. The accuracy and efficiency of the proposed method are demonstrated by four of our test problems, and solution behavior of the test problems is presented using tables and graphs. Further, the numerical results are found to be in a good agreement with the exact solutions and the numerical solutions that are available in literature. We have showed the convergence of the proposed method. Also, the obtained results reveal that the introduced method is promising for solving other types of nonlinear partial differential equations (NLPDEs) in the fields of science and engineering.

scholarly journals A Novel Method for Solution of Fractional Order Two-Dimensional Nonlocal Heat Conduction Phenomena

2021 ◽  
Vol 2021 ◽  
pp. 1-17
Author(s):  
Hammad Khalil ◽  
Ishak Hashim ◽  
Waqar Ahmad Khan ◽  
Abuzar Ghaffari
Keyword(s):  
Heat Conduction ◽  
Fractional Order ◽  
Operational Matrix ◽  
Nonlocal Boundary ◽  
Nonlocal Boundary Conditions ◽  
Test Problems ◽  
Operational Matrices ◽  
Two Dimensional ◽  
Algebraic Equations ◽  
Operational Matrix Method

In this paper, we have extended the operational matrix method for approximating the solution of the fractional-order two-dimensional elliptic partial differential equations (FPDEs) under nonlocal boundary conditions. We use a general Legendre polynomials basis and construct some new operational matrices of fractional order operations. These matrices are used to convert a sample nonlocal heat conduction phenomenon of fractional order to a structure of easily solvable algebraic equations. The solution of the algebraic structure is then used to approximate a solution of the heat conduction phenomena. The proposed method is applied to some test problems. The obtained results are compared with the available data in the literature and are found in good agreement.Dedicated to my father Mr. Sher Mumtaz, (1955-2021), who gave me the basic knowledege of mathematics.

ON ONE EFFECTIVE DIFFERENCE SCHEME FOR THE CONVECTION‐DIFFUSION PROBLEM

2001 ◽  
Vol 6 (2) ◽  
pp. 231-240
Author(s):  
G. Gromyko
Keyword(s):  
Difference Scheme ◽  
Iterative Algorithm ◽  
Diffusion Problem ◽  
Point Of View ◽  
Numerical Calculations ◽  
Test Problems ◽  
Two Dimensional ◽  
Convection Diffusion ◽  
The Given ◽  
And Diffusion

The given paper is devoted to build‐up of the special economic difference schemes for non‐stationary one and two‐dimensional problems of a convection ‐ diffusion permitting to take into account convective and diffusion terms from the uniform point of view. On the basis of a multicomponent schemes build‐up procedure, bound up with region decomposition of the cells of mesh, the economic multicomponent iterative algorithm is constructed. A series of numerical calculations on some test problems solution including Burgers problem is reduced, and the comparison with known, most spread schemes is proceeded.

Sign in / Sign up

Export Citation Format

Share Document