This paper is focused on the development of one methodology to assign the corresponding goal position for a group of vehicles in a proper manner, starting from any initial configuration and one established formation shape. The assignment methodology will guarantee that the formation will be reached in a minimum period of time and without collision risk. Hungarian algorithm was used as combinatorial optimization algorithm, and this methodology requires a cost matrix. In order to show the optimal behavior of the proposed cost matrix, three approaches of cost matrix were evaluated. Simulations of quad-rotor formations were carried out to analyze approaches behavior, the formation was based on potential functions and the control law for each vehicle was based on nested saturation.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    A solution for the goal position assignment in formation problem




    Publication date :

    2013-05-01


    Size :

    430123 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Novel Goal-Based Weapon Target Assignment Doctrine

    Mekawey, Hosam I. / Abd El-Wahab, M. S. / Hashem, M. | AIAA | 2009


    The Solution for Assignment Problem of Nonsquare Matrix

    Yang, L. / Han, J. / Nie, Y. | British Library Online Contents | 2009



    Solution of Locomotive Assignment Problem by Network Flow Approach

    Takmazian, A.K. / Shabunin, A.B. / Matyukhin, V.G. | IEEE | 2018