English
Related papers

Related papers: Optimal Path in Two and Three Dimensions

200 papers

The recently-proposed generic Dijkstra algorithm finds shortest paths in networks with continuous and contiguous resources. While the algorithm was proposed in the context of optical networks (and is applicable to other networks with finite…

Networking and Internet Architecture · Computer Science 2026-03-04 Ireneusz Szcześniak , Bożena Woźna-Szcześniak , Ireneusz Olszewski

A new, fully-localised, energy growth optimal is found over large times and in long pipe domains at a given mass flow rate. This optimal emerges at a threshold disturbance energy below which a nonlinear version of the known…

Fluid Dynamics · Physics 2014-08-08 Chris C. T. Pringle , Ashley P. Willis , Rich R. Kerswell

A variant of the classical optimal transportation problem is: among all joint measures with fixed marginals and which are dominated by a given density, find the optimal one. Existence and uniqueness of solutions to this variant were…

Optimization and Control · Mathematics 2018-01-23 Jonathan Korman , Robert J. McCann

We study the local eigenvalue statistics (LES) associated with one-dimensional lattice models of random polymers. We consider models constructed from two polymers. Each polymer is a finite interval of lattice points with a finite potential.…

Mathematical Physics · Physics 2025-09-01 Peter D. Hislop , Fumihiko Nakano

Directions and paths, as commonly provided by navigation systems, are usually derived considering absolute metrics, e.g., finding the shortest path within an underlying road network. With the aid of crowdsourced geospatial data we aim at…

We introduce a robust optimization method for flip-free distortion energies used, for example, in parametrization, deformation, and volume correspondence. This method can minimize a variety of distortion energies, such as the symmetric…

Graphics · Computer Science 2022-11-17 Oded Stein , Jiajin Li , Justin Solomon

In this work, we present a workspace-based planning framework, which though using redundant workspace key-points to represent robot states, can take advantage of the interpretable geometric information to derive good quality collision-free…

Robotics · Computer Science 2022-06-17 Weifu Wang , Ping Li

Optimal motion planning involves obstacles avoidance where path planning is the key to success in optimal motion planning. Due to the computational demands, most of the path planning algorithms can not be employed for real-time based…

Robotics · Computer Science 2022-02-15 Geesara Kulathunga

Robots are widely used in industry due to their efficiency and high accuracy in performance. One of the most intriguing issues in manufacturing stage of production line is to minimize significantly high percentage of energy consumed by…

Robotics · Computer Science 2018-06-26 Sourya Dipta Das , Victor Bain , Pratyusha Rakshit

We propose the Selective Densification method for fast motion planning through configuration space. We create a sequence of roadmaps by iteratively adding configurations. We organize these roadmaps into layers and add edges between…

Robotics · Computer Science 2020-02-13 Brad Saund , Dmitry Berenson

We propose a distributed algorithm for controlling traffic signals. Our algorithm is adapted from backpressure routing, which has been mainly applied to communication and power networks. We formally prove that our algorithm ensures global…

Systems and Control · Computer Science 2015-03-20 Tichakorn Wongpiromsarn , Tawit Uthaicharoenpong , Yu Wang , Emilio Frazzoli , Danwei Wang

This paper introduces a differentiable representation for the optimization of boustrophedon path plans in convex polygons, explores an additional parameter of these path plans that can be optimized, discusses the properties of this…

Robotics · Computer Science 2024-02-21 Thomas Manzini , Robin Murphy

Pathfinding is a very popular area in computer game development. While two-dimensional (2D) pathfinding is widely applied in most of the popular game engines, little implementation of real three-dimensional (3D) pathfinding can be found.…

Artificial Intelligence · Computer Science 2018-06-20 Diptangshu Pandit

We study a polymer model on hierarchical lattices very close to the one introduced and studied in \cite{DGr, CD}. For this model, we prove the existence of free energy and derive the necessary and sufficient condition for which very strong…

Probability · Mathematics 2009-06-08 Hubert Lacoin , Gregorio Moreno Flores

We study the direct incoherent energy transfer from an immobile excited donor molecule to acceptor molecules, which are all attached to polymer chains, randomly arranged in a viscous solvent. The decay forms are found explicitly, in terms…

Condensed Matter · Physics 2008-02-03 G. Oshanin , J. De Coninck , A. Blumen , S. F. Burlatsky , M. Moreau

We study a one dimensional directed polymer model in an inverse-gamma random environment, known as the log-gamma polymer, in three different geometries: point-to-line, point-to-half line and when the polymer is restricted to a half space…

Probability · Mathematics 2026-01-26 Elia Bisi , Nikos Zygouras

The transport of deformable particles through porous media underlies a wealth of applications ranging from filtration to oil recovery to the transport and spreading of biological agents. Using direct numerical simulations, we analyze the…

Soft Condensed Matter · Physics 2020-06-09 Brato Chakrabarti , Charles Gaillard , David Saintillan

From the spread of pollutants in the atmosphere to the transmission of nutrients across cell membranes, anomalous diffusion processes are ubiquitous in natural systems. The ability to understand and control the mechanisms guiding such…

Statistical Mechanics · Physics 2021-01-04 E G Kostadinova , J L Padgett , C D Liaw , L S Matthews , T W Hyde

We study directed polymers subject to a quenched random potential in d transversal dimensions. This system is closely related to the Kardar-Parisi-Zhang equation of nonlinear stochastic growth. By a careful analysis of the perturbation…

Condensed Matter · Physics 2009-10-28 Ralf Bundschuh , Michael Lassig

Optimal transportation distances are valuable for comparing and analyzing probability distributions, but larger-scale computational techniques for the theoretically favorable quadratic case are limited to smooth domains or regularized…

Other Computer Science · Computer Science 2016-03-23 Justin Solomon , Raif Rustamov , Leonidas Guibas , Adrian Butscher
‹ Prev 1 8 9 10 Next ›