相关论文: On swimmer's strategies in various currents

This paper examines the degree to which an evader seeking a safe and efficient path to a target location can benefit from increasing levels of knowledge regarding one or more range-limited pursuers seeking to intercept it. Unlike previous…

Efficient locomotion is important for the evolution of complex life, yet the physical principles selecting specific swimming strokes often remain entangled with biological constraints. In viscous fluids, the scallop theorem constrains the…

Consider a communication network with a source, a relay and a destination. Each time interval, the source may dynamically choose between a few possible coding schemes, based on the channel state, traffic pattern and its own queue status.…

With the continuing rapid development of artificial microrobots and active particles, questions of microswimmer guidance and control are becoming ever more relevant and prevalent. In both the applications and theoretical study of such…

We study the fluid dynamics of two fish-like bodies with synchronised swimming patterns. Our studies are based on two-dimensional simulations of viscous incompressible flows. We distinguish between motion patterns that are externally…

We introduce a model of interacting random walkers on a finite one dimensional chain with absorbing boundaries or targets at the ends. Walkers are of two types: informed particles that move ballistically towards a given target, and…

In swimming competitions, the center lane is considered to be the best lane. The main objective of this study is to discuss the validity of the assertion, "good swimmers should be placed in the center lanes because these lanes has…

Swimming velocity and rate of dissipation of a sphere with surface distortions are discussed on the basis of the Stokes equations of low Reynolds number hydrodynamics. At first the surface distortions are assumed to cause an irrotational…

We study a simple model of periodic contraction and extension of large intruders in a granular bed to understand the mechanism for swimming in an otherwise solid media. Using an event-driven simulation, we find optimal conditions that…

Natural swimmers rely for their survival on sensors that gather information from the environment and guide their actions. The spatial organization of these sensors, such as the visual fish system and lateral line, suggests evolutionary…

We consider active particles swimming in a convergent fluid flow in a trapezoid nozzle with no-slip walls. We use mathematical modeling to analyze trajectories of these particles inside the nozzle. By extensive Monte Carlo simulations, we…

Surface interactions provide a class of mechanisms which can be employed for propulsion of micro- and nanometer sized particles. We investigate the related efficiency of externally and self-propelled swimmers. A general scaling relation is…

Motion planning for vehicles under the influence of flow fields can benefit from the idea of streamline-based planning, which exploits ideas from fluid dynamics to achieve computational efficiency. Important to such planners is an efficient…

Path finding is a well-studied problem in AI, which is often framed as graph search. Any-angle path finding is a technique that augments the initial graph with additional edges to build shorter paths to the goal. Indeed, optimal algorithms…

We study dynamic network flows with uncertain input data under a robust optimization perspective. In the dynamic maximum flow problem, the goal is to maximize the flow reaching the sink within a given time horizon $T$, while flow requires a…

The swimming trajectories of self-propelled organisms or synthetic devices in a viscous fluid can be altered by hydrodynamic interactions with nearby boundaries. We explore a multipole description of swimming bodies and provide a general…

We present theoretical and numerical results concerning the problem to find the path that minimizes the time to navigate between two given points in a complex fluid under realistic navigation constraints. We contrast deterministic Optimal…

We give an iterative algorithm for finding the maximum flow between a set of sources and sinks that lie on the boundary of a planar graph. Our algorithm uses only O(n) queries to simple data structures, achieving an O(n log n) running time…

We consider flow rounding: finding an integral flow from a fractional flow. Costed flow rounding asks that we find an integral flow with no worse cost. Randomized flow rounding requires we randomly find an integral flow such that the…

This article overviews how gradient flows, and discretizations thereof, are useful to design and analyze optimization and sampling algorithms. The interplay between optimization, sampling, and gradient flows is an active research area; our…