Abstract

We find the optimal fire distribution for the one-against-many Lanchester aimed-fired model, in which a homogeneous Blue force fights a mixed Red force with several distinct types. Each unit of Blue force kills Red type i at rate bi, while each type-i Red unit kills Blue at rate ri. We show that Blue’s optimal dynamical policy is to, at any give time, allocate all its fire to the surviving Red type for which the value of biri is highest.

Full Text
Paper version not known

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

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.