English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

We address optimal placement of vehicles with simple motion to intercept amobile target that arrives stochastically on a line segment. The optimality ofvehicle placement is measured through a cost function associated withintercepting the target. With a single vehicle, we assume that the target moves(i) with fixed speed and in a fixed direction perpendicular to the linesegment, or (ii) to maximize the distance from the line segment, or (iii) tomaximize intercept time. In each case, we show that the cost function isstrictly convex, its gradient is smooth, and the optimal vehicle placement isobtained by a standard gradient-based optimization technique. With multiplevehicles, we assume that the target moves with fixed speed and in a fixeddirection perpendicular to the line segment. We present a discrete timepartitioning and gradient-based algorithm, and characterize conditions underwhich the algorithm asymptotically leads the vehicles to a set of criticalconfigurations of the cost function.

On Vehicle Placement to Intercept Moving Targets