This paper introduces an optimal algorithm for solving the discrete grid-based coverage path planning (CPP) problem. This problem consists in finding a path that covers a given region completely.

We describe the cyclic coordinate-exchange algorithm for constructing D-optimal and linear-optimal experimental designs. The algorithm uses a variant of the Gauss-Southwell cyclic coordinate-descent ...

This manuscript addresses the problem of finding optimal control for dynamic systems using the gradient descent method. A numerical algorithm is constructed to find the optimal control in problems ...

In this paper, a cross-layer optimal transmission control algorithm for low latency networks is proposed, a multilevel parameter acquisition architecture and a link quality assessment method based on ...

This paper presents the algorithm "DETMAX" whose purpose is to construct experimental designs that are "D-optimal." These are designs for which the determinant of X′X is maximum, where X is the ...

We leverage insights from machine learning to optimize the tradeoff between bias and variance when estimating economic models using pooled datasets. Specifically, we develop a simple algorithm that ...

Researchers have discovered how to extract and use information in an individual image to determine how far objects are from the focus distance, a feat only accomplished by human and animal visual ...