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

The optimization of fuel-optimal low-thrust collision avoidance maneuvers (CAMs) in scenarios involving multiple encounters between spacecraft is addressed. The optimization's objective is the minimization of the total fuel consumption…

The airplane refueling problem is a nonlinear combinatorial optimization problem, and its equivalent problem the $n$-vehicle exploration problem is proved to be NP-complete (arXiv:2304.03965v1, The $n$-vehicle exploration problem is…

To guarantee the safety of flight operations, decision-support systems for air traffic control must be able to improve the usage of airspace capacity and handle increasing demand. In this study, we address the aircraft conflict avoidance…

In this paper, we investigate a multi-agent target guarding problem in which a single defender seeks to capture multiple attackers aiming to reach a high-value target area. In contrast to previous studies, the attackers herein are assumed…

Assume that a target is known to be present at an unknown point among a finite set of locations in the plane. We search for it using a mobile robot that has imperfect sensing capabilities. It takes time for the robot to move between…

In adversarial patrolling games, a mobile Defender strives to discover intrusions at vulnerable targets initiated by an Attacker. The Attacker's utility is traditionally defined as the probability of completing an attack, possibly weighted…

We consider a variant of the target defense problem where a single defender is tasked to capture a sequence of incoming intruders. The intruders' objective is to breach the target boundary without being captured by the defender. As soon as…

We introduce a novel 'one-shot' solution technique resolving an open problem (Karatzas et al., Finite-fuel singular control with discretionary stopping, Stochastics 71:1-2 (2000)). Unexpectedly given the convexity of the latter problem, its…

In this article, the formation mission design problem for commercial aircraft is studied. Given the departure times and the departure and arrival locations of several commercial flights, the relevant weather forecast, and the expected fuel…

In this paper, we consider multistopping problems for finite discrete time sequences $X_1,...,X_n$. $m$-stops are allowed and the aim is to maximize the expected value of the best of these $m$ stops. The random variables are neither assumed…

The problem of finding the shortest path for a vehicle visiting a given sequence of target points subject to the motion constraints of the vehicle is an important problem that arises in several monitoring and surveillance applications…

We consider a variant of the target defense problem in a planar conical environment where a single defender is tasked to capture a sequence of incoming attackers. The attackers' objective is to breach the target boundary without being…

We consider three problems of selecting optimal gun barrel direction (or those of selecting optimal semiaxis position) when firing an unguided artillery projectile on the assumption that the gun barrel semiaxis can move in a connected…

In the best choice problem with random arrivals, an unknown number $n$ of rankable items arrive at times sampled from the uniform distribution. As is well known, a real-time player can ensure stopping at the overall best item with…

With advancements in technology, commercial aircraft formation flying is becoming increasingly feasible as an efficient and environmentally friendly flight method. However, gaps remain in practical implementation, particularly in collision…

In this paper, a novel mathematical framework is introduced for modeling and analyzing the cyber-physical security of time-critical UAV applications. A general UAV security network interdiction game is formulated to model interactions…

This paper addresses the problem of restricted airspace protection from invaders using the cooperative multi-UAV system. The objective is to detect and capture the invaders cooperatively by a team of homogeneous UAVs (called evaders)before…

This paper presents an optimal control problem to analyze the efficacy of counter-terrorism tactics. We present an algorithm that efficiently combines the Minimum Principle of Pontryagin, the shooting method and the cyclic descent of…

The n-way number partitioning problem, a fundamental challenge in combinatorial optimization, has significant implications for applications such as fair division and machine scheduling. Despite these problems being NP-hard, many…

We present a model for layered security with applications to the protection of sites such as stadiums or large gathering places. We formulate the problem as one of maximizing the capture of illegal contraband. The objective function is…