相关论文: The Fighter Problem: Optimal Allocation of a Discr…

Autonomous flying robots, such as multirotors, often rely on deep learning models that make predictions based on a camera image, e.g. for pose estimation. These models can predict surprising results if applied to input images outside the…

The convex feasibility problem (CFP) is to find a feasible point in the intersection of finitely many convex and closed sets. If the intersection is empty then the CFP is inconsistent and a feasible point does not exist. However,…

We address the aircraft conflict resolution problem under trajectory prediction uncertainty. We consider that aircraft velocity vectors may be perturbed due to weather effects, such as wind, or measurement errors. Such perturbations may…

Persistent monitoring missions require an up-to-date knowledge of the changing state of the underlying environment. UAVs can be gainfully employed to continually visit a set of targets representing tasks (and locations) in the environment…

We study the parameterized complexity of the optimal defense and optimal attack problems in voting. In both the problems, the input is a set of voter groups (every voter group is a set of votes) and two integers $k_a$ and $k_d$…

We discuss a duel-type game in which Player I uses his resource continuously and Player II distributes it by discrete portions. Each player knows how much resources he and his opponent have at every moment of time. The solution of the game…

Given two points in the plane, and a set of "obstacles" given as curves through the plane with assigned weights, we consider the point-separation problem, which asks for the minimum-weight subset of the obstacles separating the two points.…

High-speed trajectory planning through unknown environments requires algorithmic techniques that enable fast reaction times while maintaining safety as new information about the operating environment is obtained. The requirement of…

Diffusive search for a static target is a common problem in statistical physics with numerous applications in chemistry and biology. We look at this problem from a different perspective and investigate the statistics of encounters between…

The paper studies a dynamic blocking problem, motivated by a model of optimal fire confinement. While the fire can expand with unit speed in all directions, barriers are constructed in real time. An optimal strategy is sought, minimizing…

Deception is a common defense mechanism against adversaries with an information disadvantage. It can force such adversaries to select suboptimal policies for a defender's benefit. We consider a setting where an adversary tries to learn the…

In this work, the design and execution of an experiment with the goal of demonstrating control over the evolution of a copper jet is described. Simulations show that when using simple multi-material buffers placed between a copper target…

Trajectory planning is a key piece in the algorithmic architecture of a robot. Trajectory planners typically use iterative optimization schemes for generating smooth trajectories that avoid collisions and are optimal for tracking given the…

The specific objective of this paper is to develop a tool that calculates the optimal trajectory of the follower aircraft as it completes a formation rejoin, and then maintains the formation position, defined as a ring of points, until a…

We revisit a classical airfoil design problem: the search for shapes that maximize aerodynamic performance metrics, targeting the underexplored intermediate Reynolds-number regime between 1 and 3000, relevant to small animals and miniature…

We take a unifying approach to single selection optimal stopping problems with random arrival order and independent sampling of items. In the problem we consider, a decision maker (DM) initially gets to sample each of $N$ items…

In many covering settings, it is natural to consider the presence both of elements that we seek to include and of elements that we seek to avoid. This paper introduces a novel combinatorial problem formalizing this tradeoff: from a…

The convex body chasing problem, introduced by Friedman and Linial, is a competitive analysis problem on any normed vector space. In convex body chasing, for each timestep $t\in\mathbb N$, a convex body $K_t\subseteq \mathbb R^d$ is given…

We study a continuous time Bayesian quickest detection problem in which observation times are a scarce resource. The agent, limited to making a finite number of discrete observations, must adaptively decide his observation strategy to…

The dynamic problem of enclosing an expanding fire can be modelled by a discrete variant in a grid graph. While the fire expands to all neighbouring cells in any time step, the fire fighter is allowed to block $c$ cells in the average…