This issuePrevious ArticleOptimal portfolios under a value-at-risk constraint with applications to inventory control in supply chainsNext ArticleA unified model for state feedback of discrete event systems I: framework and maximal permissive state feedback
Computational aspects of the optimal transit path problem
Western Australian Centre of Excellence in Industrial Optimisation, Department of Mathematics and Statistics, Curtin University of Technology, Bentley, WA, 6102
We consider a class of path design problems which arise when an
object needs to traverse between two points through a specified
region. The path must optimise a prescribed criterion such as
risk, reliability or cost and satisfy a number of constraints such
as total travel time. Problems of this type readily arise in the
defence, transport and communication industries. We specifically
look at the problem of determining an optimal (in terms of
minimizing the overall probability of detection) transit path for
a submarine moving through a field of sonar sensors, subject to a
total time constraint. A computational strategy along with results
are presented.