Devising the planar routes of minimal length that are required to pass through predefined neighborhoods of target points plays an important role in reducing the mission’s operating cost. Two versions of the problem are considered. The first one assumes that the ordering of the targets is fixed a priori. In such a case, the optimal route is devised by solving a convex optimization problem formulated either as a second-order cone program or as a sum-of-squares optimization problem. Additional route properties, such as continuity and minimal curvature, are considered as well. The second version allows the ordering of the targets to be optimized to further reduce the route length. We show that such a problem can be solved by introducing additional binary variables, which allows the route to be designed using off-the-shelf mixed-integer solvers. A case study that shows that the proposed strategy is computationally tractable is presented.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Computationally Tractable Formulations for Optimal Path Planning with Interception of Targets’ Neighborhoods


    Contributors:

    Published in:

    Publication date :

    2017-02-27


    Size :

    10 pages




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English





    Time-Optimal Guidance for Lateral Interception of Moving Targets

    Gopalan, Akhil / Ratnoo, Ashwini / Ghose, Debasish | AIAA | 2015




    Optimal Guidance and Nonlinear Estimation for Interception of Accelerating Targets

    Hough, M. E. / American Astronautical Society| American Institute of Aeronautics and Astronautics | British Library Conference Proceedings | 1996