Recent years have witnessed great advancements in the science and technology of
autonomy, robotics, and networking. This paper surveys recent concepts and algorithms for …

A number of important results in combinatorics, discrete geometry, and theoretical computer
science have been proved using algebraic topology. While the results are quite famous …

Abstract The Multi-Depot Vehicle Routing Problem (MDVRP) involves minimizing the total
distance traveled by vehicles originating from multiple depots so that the vehicles together …

In this paper, we present adaptive and distributed algorithms for motion coordination of a
group of m vehicles. The vehicles must service demands whose time of arrival, spatial …

In this paper, we give a short survey on discrete geometry on red and blue points in the
plane, most of whose results were obtained in the past decade. We consider balanced …

The Multi-Depot Vehicle Routing Problem (MDVRP) is a generalization of the Single-Depot
Vehicle Routing Problem (SDVRP) in which vehicle (s) start from multiple depots and return …

We consider an uncapacitated stochastic vehicle routing problem in which vehicle depot
locations are fixed, and client locations in a service region are unknown but are assumed to …

Mass partition problems describe the partitions we can induce on a family of measures or
finite sets of points in Euclidean spaces by dividing the ambient space into pieces. In this …

A k-fan is a point in the plane and k semilines emanating from it. Motivated by a neat
question of Kaneko and Kano, we study equipartitions by k-fans of two or more probability …

On-time last-mile delivery is expanding rapidly as people expect faster delivery of goods
ranging from grocery to medicines. Managing on-time delivery systems is challenging …