Inflow process of pedestrians to a confined space

To better design safe and comfortable urban spaces, understanding the nature of human crowd movement is important. However, precise interactions among pedestrians are difficult to measure in the presence of their complex decision-making processes and many related factors. While extensive studies on pedestrian flow through bottlenecks and corridors have been conducted, the dominant mode of interaction in these scenarios may not be relevant in different scenarios. Here, we attempt to decipher the factors that affect human reactions to other individuals from a different perspective. We conducted experiments employing the inflow process in which pedestrians successively enter a confined area (like an elevator) and look for a temporary position. In this process, pedestrians have a wider range of options regarding their motion than in the classical scenarios; therefore, other factors might become relevant. The preference of location is visualized by pedestrian density profiles obtained from recorded pedestrian trajectories. Non-trivial patterns of space acquisition, e.g., an apparent preference for positions near corners, were observed. This indicates the relevance of psychological and anticipative factors beyond the private sphere, which have not been deeply discussed so far in the literature on pedestrian dynamics. From the results, four major factors, which we call flow avoidance, distance cost, angle cost, and boundary preference, were suggested. We confirmed that a description of decision-making based on these factors can give a rise to realistic preference patterns, using a simple mathematical model. Our findings provide new perspectives and a baseline for considering the optimization of design and safety in crowded public areas and public transport carriers.Comment: 23 pages, 6 figure

Scutoids unveil the three-dimensional packing in curved epithelia

As animals develop, the initial simple planar epithelia of the early embryos must acquire complex three-dimensional architectures to form the final functional tissues of the organism. Epithelial bending is, therefore, a general principle of all developing systems. Scholarly publications depict epithelial cells as prisms where their basal and apical faces resemble polygons with the same number of sides. The accepted view is that, when a tissue bend, the cells of the epithelia modify their shape from columnar to what has been traditionally called “bottle shape”. However, the morphology and packing of curved epithelia remain largely unknown. Here, through mathematical and computational modelling, we show that cells in bent epithelia necessarily undergo intercalations along the apico-basal axis. This event forces cells to exchange their neighbours between their basal and apical surfaces. Therefore, the traditional view of epithelial cells as simple prisms is incompatible with this phenomenon. Consequently, epithelial cells are compelled to adopt a novel geometrical shape that we have named “scutoid”. The in-depth analysis of diverse epithelial tissues and organs confirm the generation of apico-basal transitions among cell during morphogenesis. Using biophysics arguments, we determine that scutoids support the energetic minimization on the tissue and conclude that the transitions along the apico-basal axis stabilize the threedimensional packing of the tissue. Altogether, we argue that scutoids are nature’s solution to bend efficiently epithelia, and the missing piece for developing a unifying and realistic model of epithelial architecture

Multiple particle tracking in PEPT using Voronoi tessellations

An algorithm is presented which makes use of three-dimensional Voronoi tessellations to track up to 20 tracers using a PET scanner. The lines of response generated by the PET scanner are discretized into sets of equidistant points, and these are used as the input seeds to the Voronoi tessellation. For each line of response, the point with the smallest Voronoi region is located; this point is assumed to be the origin of the corresponding line of response. Once these origin points have been determined, any outliers are removed, and the remaining points are clustered using the DBSCAN algorithm. The centroid of each cluster is classified as a tracer location. Once the tracer locations are determined for each time frame in the experimental data set, a custom multiple target tracking algorithm is used to associate identical tracers from frame to frame. Since there are no physical properties to distinguish the tracers from one another, the tracking algorithm uses velocity and position to extrapolate the locations of existing tracers and match the next frame's tracers to the trajectories. A series of experiments were conducted in order to test the robustness, accuracy and computational performance of the algorithm. A measure of robustness is the chance of track loss, which occurs when the algorithm fails to match a tracer location with its trajectory, and the track is terminated. The chance of track loss increases with the number of tracers; the acceleration of the tracers; the time interval between successive frames; and the proximity of tracers to each other. In the case of two tracers colliding, the two tracks merge for a short period of time, before separating and become distinguishable again. Track loss also occurs when a tracer leaves the field of view of the scanner; on return it is treated as a new object. The accuracy of location of the algorithm was found to be slightly affected by tracer velocity, but is much more dependent on the distance between consecutive points on a line of response, and the number of lines of response used per time frame. A single tracer was located to within 1.26mm. This was compared to the widely accepted Birmingham algorithm, which located the same tracer to within 0.92mm. Precisions of between 1.5 and 2.0mm were easily achieved for multiple tracers. The memory usage and processing time of the algorithm are dependent on the number of tracers used in the experiment. It was found that the processing time per frame for 20 tracers was about 15s, and the memory usage was 400MB. Because of the high processing times, the algorithm as is is not feasible for practical use. However, the location phase of the algorithm is massively parallel, so the code can be adapted to significantly increase the efficiency

Grain growth behavior and efficient large scale simulations of recrystallization with the phase-field method

This book summarizes the found insights of grain growth behavior, of multidimensional decomposition for regular grids to efficiently parallelize computing and how to simulate recrystallization by coupling the finite element method with the phase-field method for microstructure texture analysis. The frame of the book is created by the phase-field method, which is the tool used in this work, to investigate microstructure phenomena

Incompressible Lagrangian fluid flow with thermal coupling

In this monograph is presented a method for the solution of an incompressible viscous fluid flow with heat transfer and solidification usin a fully Lagrangian description on the motion. The originality of this method consists in assembling various concepts and techniques which appear naturally due to the Lagrangian formulation.Postprint (published version

Optimisation-based verification process of obstacle avoidance systems for unmanned vehicles

This thesis deals with safety verification analysis of collision avoidance systems for unmanned vehicles. The safety of the vehicle is dependent on collision avoidance algorithms and associated control laws, and it must be proven that the collision avoidance algorithms and controllers are functioning correctly in all nominal conditions, various failure conditions and in the presence of possible variations in the vehicle and operational environment. The current widely used exhaustive search based approaches are not suitable for safety analysis of autonomous vehicles due to the large number of possible variations and the complexity of algorithms and the systems. To address this topic, a new optimisation-based verification method is developed to verify the safety of collision avoidance systems. The proposed verification method formulates the worst case analysis problem arising the verification of collision avoidance systems into an optimisation problem and employs optimisation algorithms to automatically search the worst cases. Minimum distance to the obstacle during the collision avoidance manoeuvre is defined as the objective function of the optimisation problem, and realistic simulation consisting of the detailed vehicle dynamics, the operational environment, the collision avoidance algorithm and low level control laws is embedded in the optimisation process. This enables the verification process to take into account the parameters variations in the vehicle, the change of the environment, the uncertainties in sensors, and in particular the mismatching between model used for developing the collision avoidance algorithms and the real vehicle. It is shown that the resultant simulation based optimisation problem is non-convex and there might be many local optima. To illustrate and investigate the proposed optimisation based verification process, the potential field method and decision making collision avoidance method are chosen as an obstacle avoidance candidate technique for verification study. Five benchmark case studies are investigated in this thesis: static obstacle avoidance system of a simple unicycle robot, moving obstacle avoidance system for a Pioneer 3DX robot, and a 6 Degrees of Freedom fixed wing Unmanned Aerial Vehicle with static and moving collision avoidance algorithms. It is proven that although a local optimisation method for nonlinear optimisation is quite efficient, it is not able to find the most dangerous situation. Results in this thesis show that, among all the global optimisation methods that have been investigated, the DIviding RECTangle method provides most promising performance for verification of collision avoidance functions in terms of guaranteed capability in searching worst scenarios

Grain growth behavior and efficient large scale simulations of recrystallization with the phase-field method

This book summarizes the found insights of grain growth behavior, of multidimensional decomposition for regular grids to efficiently parallelize computing and how to simulate recrystallization by coupling the finite element method with the phase-field method for microstructure texture analysis. The frame of the book is created by the phase-field method, which is the tool used in this work, to investigate microstructure phenomena

TESS: A Relativistic Hydrodynamics Code on a Moving Voronoi Mesh

We have generalized a method for the numerical solution of hyperbolic systems of equations using a dynamic Voronoi tessellation of the computational domain. The Voronoi tessellation is used to generate moving computational meshes for the solution of multi-dimensional systems of conservation laws in finite-volume form. The mesh generating points are free to move with arbitrary velocity, with the choice of zero velocity resulting in an Eulerian formulation. Moving the points at the local fluid velocity makes the formulation effectively Lagrangian. We have written the TESS code to solve the equations of compressible hydrodynamics and magnetohydrodynamics for both relativistic and non-relativistic fluids on a dynamic Voronoi mesh. When run in Lagrangian mode, TESS is significantly less diffusive than fixed mesh codes and thus preserves contact discontinuities to high precision while also accurately capturing strong shock waves. TESS is written for Cartesian, spherical and cylindrical coordinates and is modular so that auxilliary physics solvers are readily integrated into the TESS framework and so that the TESS framework can be readily adapted to solve general systems of equations. We present results from a series of test problems to demonstrate the performance of TESS and to highlight some of the advantages of the dynamic tessellation method for solving challenging problems in astrophysical fluid dynamics.Comment: ApJS, 197, 1