Related papers: Separating Two Points with Obstacles in the Plane:…
A variety of boundary value problems in linear transport theory are expressed as a diffusion equation of the two-way, or forward-backward, type. In such problems boundary data are specified only on part of the boundary, which introduces…
In this paper we study a generalized version of the Weber problem of finding a point that minimizes the sum of its distances to a finite number of given points. In our setting these distances may be $cut$ $off$ at a given value $C > 0$, and…
We consider methods for finding a simple polygon of minimum (Min-Area) or maximum (Max-Area) possible area for a given set of points in the plane. Both problems are known to be NP-hard; at the center of the recent CG Challenge, practical…
Cutting planes are frequently used for solving integer programs. A common strategy is to derive cutting planes from building blocks or a substructure of the integer program. In this paper, we focus on knapsack constraints that arise from…
We apply a novel optimization scheme from the image processing and machine learning areas, a fast Primal-Dual method, to achieve controllable and realistic fluid simulations. While our method is generally applicable to many problems in…
A path-following collision-avoidance model predictive control (MPC) method is proposed which approximates obstacle shapes as convex polygons. Collision-avoidance is ensured by means of the signed distance function which is calculated…
Learning motion planners to move robot from one point to another within an obstacle-occupied space in a collision-free manner requires either an extensive amount of data or high-quality demonstrations. This requirement is caused by the fact…
We show that there are sets of $n$ points in the plane with $n$ arbitrarily large that contain more than $n^{1.014}$ pairs of points separated by a distance exactly $1$. This improves on very recent work of a team at OpenAI, who proved the…
We address the problem of computing bounds for the self-intersection number (the minimum number of self-intersection points) of members of a free homotopy class of curves in the doubly-punctured plane as a function of their combinatorial…
The article proposes a new method for finding the triangle-triangle intersection in 3D space, based on the use of computer graphics algorithms -- cutting off segments on the plane when moving and rotating the beginning of the coordinate…
We present a fixed-parameter tractable (FPT) algorithm to find a shortest curve that encloses a set of k required objects in the plane while paying a penalty for enclosing unwanted objects. The input is a set of interior-disjoint simple…
Solving for the minimum time bounded acceleration trajectory with prescribed position and velocity at endpoints is a highly nonlinear problem. The methods and bounds developed in this paper distinguish when there is a continuous…
In this brief, we consider the constrained optimization problem underpinning model predictive control (MPC). We show that this problem can be decomposed into an unconstrained optimization problem with the same cost function as the original…
Atmospheric powered descent guidance can be solved by successive convexification; however, its onboard application is impeded by the sharp increase in computation caused by nonlinear aerodynamic forces. The problem has to be converted into…
An algorithm which computes a solution of a set optimization problem is provided. The graph of the objective map is assumed to be given by finitely many linear inequalities. A solution is understood to be a set of points in the domain…
There are many space subdivision and space partitioning techniques used in many algorithms to speed up computations. They mostly rely on orthogonal space subdivision, resp. using hierarchical data structures, e.g. BSP trees, quadtrees,…
The focus of this paper is on a thin obstacle problem where the obstacle is defined on the intersection between a hyper-plane $\Gamma$ in $\mathbb{R}^n$ and a periodic perforation $\mathcal{T}_\varepsilon$ of $\mathbb{R}^n$, depending on a…
In this paper, the operation of totally asymmetric simple exclusion process with one or two shortcuts under open boundary conditions is discussed. Using both mathematical analysis and numerical simulations, we have found that, according to…
Given a set $P$ of $n$ points in the plane and a multiset $W$ of $k$ weights with $k\leq n$, we assign each weight in $W$ to a distinct point in $P$ to minimize the maximum weighted distance from the weighted center of $P$ to any point in…
In this paper we address the speed planning problem for a vehicle along a predefined path. A weighted average of two (conflicting) terms, energy consumption and travel time, is minimized. After deriving a non-convex mathematical model of…