Joshua Betz | Searcharxiv

arXiv2026

Multi-Criteria Integer Programming Model for Route Planning in an Off-Road Combat Environment

Route planning for military vehicles is a complex decision-making problem due to the simultaneous influence of environmental trafficability and tactical risks. This paper presents an optimization model that integrates soil trafficability and risk of enemy engagement into a decision-support model for planning activities in open terrain. Although a military application is the focus of this paper, other use cases include wildfire response, agricultural operations, and off-road vehicle recreation. The routing problem is formulated as a minimum cost mixed-integer linear program over a discretized representation of the operational environment. Each node represents a location and is connected by arcs to adjacent nodes whose traversal incurs a cost derived from a composite risk function that accounts for soil strength and the proximity to known enemy activity and prior convoy routes. Environmental inputs required for evaluating soil strength are obtained by integrating external models, which estimate spatial variations in the rating cone index (RCI) across the terrain. The model is evaluated through a case study conducted at a location in northern Colorado using fine-resolution environmental data and simulated tactical conditions. Scenario analyses demonstrate how variations in risk weighting, vehicle mobility characteristics, and operational conditions influence route geometry and mission risk. The objective function values achieved varied by five orders of magnitude based on the coefficients assigned to the terms in the cost function and the vehicle properties of the scenario. The results illustrate the capability of the proposed framework to quantify trade-offs between environmental mobility constraints and tactical considerations.

eess.SY↗

arXiv2022

Combining Covariate Adjustment with Group Sequential, Information Adaptive Designs to Improve Randomized Trial Efficiency

In clinical trials, there is potential to improve precision and reduce the required sample size by appropriately adjusting for baseline variables in the statistical analysis. This is called covariate adjustment. Despite recommendations by regulatory agencies in favor of covariate adjustment, it remains underutilized leading to inefficient trials. We address two obstacles that make it challenging to use covariate adjustment. A first obstacle is the incompatibility of many covariate adjusted estimators with commonly used boundaries in group sequential designs (GSDs). A second obstacle is the uncertainty at the design stage about how much precision gain will result from covariate adjustment. We propose a method that modifies the original estimator so that it becomes compatible with GSDs, while increasing or leaving unchanged the estimator's precision. Our approach allows the use of any asymptotically linear estimator, which covers many estimators used in randomized trials. Building on this, we propose using an information adaptive design, that is, continuing the trial until the required information level is achieved. Such a design adapts to the amount of precision gain and can lead to faster, more efficient trials, without sacrificing validity or power. We evaluate estimator performance in simulations that mimic features of a completed stroke trial.

stat.ME↗