相关论文: Constructing Optimal Highways

We study a time minimization problem on the group of motions of a plane with admissible control in a half-disk. The considered control system describes a model of a car that can move forward on a plane and turn in place. Optimal…

This paper introduces an optimization problem (P) and a solution strategy to design variable-speed-limit controls for a highway that is subject to traffic congestion and uncertain vehicle arrival and departure. By employing a finite…

We consider the problem of choosing a subset of proposed road network upgrades to implement within a fixed budget in order to optimize the benefit in terms of vehicle hours travelled (VHT), and show how to render the solution of this…

Traffic forecasting plays a key role in Intelligent Transportation Systems, and significant strides have been made in this field. However, most existing methods can only predict up to four hours in the future, which doesn't quite meet…

Probabilistic analysis for metric optimization problems has mostly been conducted on random Euclidean instances, but little is known about metric instances drawn from distributions other than the Euclidean. This motivates our study of…

In the Euclidean TSP with neighborhoods (TSPN), we are given a collection of $n$ regions (neighborhoods) and we seek a shortest tour that visits each region. In the path variant, we seek a shortest path that visits each region. We present…

The problem Orienteering asks whether there exists a walk which visits a number of sites without exceeding some fuel budget. In the variant of the problem we consider, the cost of each edge in the walk is dependent on the time we depart one…

Automated road network extraction from remote sensing imagery remains a significant challenge despite its importance in a broad array of applications. To this end, we explore road network extraction at scale with inference of semantic…

The paper presents a movement strategy for Connected and Automated Vehicles (CAVs) in a lane-free traffic environment with vehicle nudging by use of an optimal control approach. State-dependent constraints on control inputs are considered…

The determination of time-dependent collision-free shortest paths has received a fair amount of attention. Here, we study the problem of computing a time-dependent shortest path among growing discs which has been previously studied for the…

Peak estimation of hybrid systems aims to upper bound extreme values of a state function along trajectories, where this state function could be different in each subsystem. This finite-dimensional but nonconvex problem may be lifted into an…

Precise positioning and fast traversal times are crucial in achieving high productivity and scale in machining. This paper compares two optimization-based predictive control approaches that achieve high performance. In the first approach,…

In this paper, we consider the rectilinear one-center problem on uncertain points in the plane. In this problem, we are given a set $P$ of $n$ (weighted) uncertain points in the plane and each uncertain point has $m$ possible locations each…

In the geometric transportation problem, we are given a collection of points $P$ in $d$-dimensional Euclidean space, and each point is given a supply of $\mu(p)$ units of mass, where $\mu(p)$ could be a positive or a negative integer, and…

Traveling to different destinations is a big part of our lives. We visit a variety of locations both during our daily lives and when we're on vacation. How can we find the best way to navigate from one place to another? Perhaps we can test…

For any two point sets $A,B \subset \mathbb{R}^d$ of size up to $n$, the Chamfer distance from $A$ to $B$ is defined as $\text{CH}(A,B)=\sum_{a \in A} \min_{b \in B} d_X(a,b)$, where $d_X$ is the underlying distance measure (e.g., the…

We introduce action quantum speed limits (QSLs) as a family of bounds on the minimal time to connect two states that, unlike the usual geometric approach, crucially depend on how the path is traversed, i.e. on the instantaneous speed. The…

Through the development of efficient algorithms, data structures and preprocessing techniques, real-world shortest path problems in street networks are now very fast to solve. But in reality, the exact travel times along each arc in the…

Given a rectilinear domain $\mathcal{P}$ of $h$ pairwise-disjoint rectilinear obstacles with a total of $n$ vertices in the plane, we study the problem of computing bicriteria rectilinear shortest paths between two points $s$ and $t$ in…

Computing shortest paths is one of the most researched topics in algorithm engineering. Currently available algorithms compute shortest paths in mere fractions of a second on continental sized road networks. In the presence of…