Related papers: Throwing a Ball as Far as Possible, Revisited
In this paper, the solvability of the Inverse Optimal Control (IOC) problem based on two existing minimum principal methods, is analysed. The aim of this work is to answer the question regarding what kinds of trajectories, that is depending…
A classic problem of the motion of a point mass (projectile) thrown at an angle to the horizon is reviewed. The air drag force is taken into account with the drag factor assumed to be constant. An analytic approach is mainly used for the…
Using the 20 questions estimation framework with query-dependent noise, we study non-adaptive search strategies for a moving target over the unit cube with unknown initial location and velocities under a piecewise constant velocity model.…
Let $C$ be a binary code of length $n$ with distances $0<d_1<\cdots<d_s\le n$. In this note we prove a general upper bound on the size of $C$ without any restriction on the distances $d_i$. The bound is asymptotically optimal.
We consider a PDE approach to numerically solving the reflector antenna problem by solving an Optimal Transport problem on the unit sphere with cost function $c(x,y) = -2\log \left\Vert x - y \right\Vert$. At each point on the sphere, we…
We give a polynomial-time constant-factor approximation algorithm for maximum independent set for (axis-aligned) rectangles in the plane. Using a polynomial-time algorithm, the best approximation factor previously known is $O(\log\log n)$.…
An optimal control problem for longitudinal motions of a thin elastic rod is considered. We suppose that a normal force, which changes piecewise constantly along the rod's length, is applied to the cross-section so that the positions of…
We study the problem of finding a triangulation T of a planar point set S such as to minimize the expected distance between two points x and y chosen uniformly at random from S. By distance we mean the length of the shortest path between x…
We present an analysis on the geometrical place formed by the set of maxima of the trajectories of a projectile launched in a media with linear drag. Such a place, the locus of apexes, is written in term of the Lambert $W$ function in polar…
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…
We consider the set of points in projective $n$-space that generate an extension of degree $e$ over given number field $k$, and deduce an asymptotic formula for the number of such points of absolute height at most $X$, as $X$ tends to…
The paper suggests a new --- to the best of the author's knowledge --- characterization of decisions which are optimal in the multi-objective optimization problem with respect to a definite proper preference cone, a Euclidean cone with a…
A singular point on a plane conic defined over $\mathbb{Q}$ is a transcendental point of the curve which admits very good rational approximations, uniformly in terms of the height. Extremal numbers and Sturmian continued fractions are…
We describe a randomized algorithm that, given a set $P$ of points in the plane, computes the best location to insert a new point $p$, such that the Delaunay triangulation of $P\cup\{p\}$ has the largest possible minimum angle. The expected…
This paper addresses the numerical computation of critical angles between two convex cones in finite-dimensional Euclidean spaces. We present a novel approach to computing these critical angles by reducing the problem to finding stationary…
Consider an oracle which takes a point $x$ and returns the minimizer of a convex function $f$ in an $\ell_2$ ball of radius $r$ around $x$. It is straightforward to show that roughly $r^{-1}\log\frac{1}{\epsilon}$ calls to the oracle…
We study the insulated conductivity problem with inclusions embedded in a bounded domain in $\mathbb R^n$, for $n \ge 3$. The gradient of solutions may blow up as $\varepsilon$, the distance between inclusions, approaches to $0$. We…
We derive the metric of an accelerating observer moving with non-constant proper acceleration in flat spacetime. With the exception of a limiting case representing a Rindler observer, there are no horizons. In our solution, observers can…
Trajectory optimization under uncertainty underpins a wide range of applications in robotics. However, existing methods are limited in terms of reasoning about sources of epistemic and aleatoric uncertainty, space and time correlations,…
What is the optimal way to approximate a high-dimensional diffusion process by one in which the coordinates are independent? This paper presents a construction, called the \emph{independent projection}, which is optimal for two natural…