Vehicle Routing Algorithms for Radially Escaping Targets

DOI10.1137/141000087zbMath1330.68340OpenAlexW1661273911MaRDI QIDQ2949981

Pushkarini Agharkar, Shaunak D. Bopardikar, Bullo, Francesco

Publication date: 5 October 2015

Published in: SIAM Journal on Control and Optimization (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/308538737d7f4dbbf8b4aeb563ecb0f99739f0f3

zbMATH Keywords

vehicle routing problemsdynamic vehicle routingmoving target routing problems

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Transportation, logistics and supply chain management (90B06) Point processes (e.g., Poisson, Cox, Hawkes processes) (60G55) Artificial intelligence for robotics (68T40)

Related Items

Matching-based capture strategies for 3D heterogeneous multiplayer reach-avoid differential games

Uses Software

• VRP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Approximation results for kinetic variants of TSP
• Grasp and delivery for moving objects on broken lines
• The Vehicle Routing Problem
• A Stochastic and Dynamic Vehicle Routing Problem in the Euclidean Plane
• Approximating Capacitated Routing and Delivery Problems
• Finite Size and Dimensional Dependence in the Euclidean Traveling Salesman Problem
• The moving-target traveling salesman problem
• Dynamic Vehicle Routing for Translating Demands: Stability Analysis and Receding-Horizon Policies
• A Cooperative Receding Horizon Controller for Multivehicle Uncertain Environments
• Probabilistic and Worst Case Analyses of Classical Problems of Combinatorial Optimization in Euclidean Space

This page was built for publication: Vehicle Routing Algorithms for Radially Escaping Targets