Optimization of interception plan for rectilinearly moving targets

DOI10.1134/S000511792310003XOpenAlexW4392142886MaRDI QIDQ6200426FDOQ6200426

Authors: A. A. Galyaev, V. P. Yakhno, P. V. Lysenko, L. M. Berlin, M. E. Buzikov 

Publication date: 29 February 2024

Published in: Automation and Remote Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s000511792310003x

Recommendations

• On vehicle placement to intercept moving targets
• Searching for a sub-optimal solution of the dynamic traveling salesman problem using the Monte Carlo method
• On an interception problem
• Computing the minimum-time interception of a moving target
• Time-optimal interception of a moving target by a Dubins car

zbMATH Keywords

combinatorial optimizationmoving targets traveling salesman problemsimple motion model

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Cites Work

• Title not available (Why is that?)
• The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling
• The moving-target traveling salesman problem
• On the Dubins Traveling Salesman Problem
• Minimum-time lateral interception of a moving target by a Dubins car
• Motion planning algorithms for the Dubins Travelling Salesperson Problem

Cited In (1)

• Searching for a sub-optimal solution of the dynamic traveling salesman problem using the Monte Carlo method

This page was built for publication: Optimization of interception plan for rectilinearly moving targets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6200426)