Abstract

The problem of developing an control algorithm for a queuing system is considered. This system has a finite number of states the dynamics of which is described by a conditional Markov chain; the system is observed using indicators whose readings are error prone. Optimal and approximately optimal solutions based on the theory of systems with random jump structure are found. By way of example, the problem of synthesis of an approximately optimal algorithm for the recognition of state and for control of aviation raids on a military facility that is alternatively damaged and restored in the course of air combat operations.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call