We solve the minimum time rendezvous problem for Dubins' vehicles with non-identical velocity constraint in this paper. To solve this problem, the vehicle's determining region is proposed through Apollonius circles, which provides a planar partition method. According to the partition, we show that the minimum time rendezvous point (MTRP) uniquely exists and locates on the boundary of some vehicle's determining region. Moreover, the minimum time rendezvous point for any number of vehicles is determined by only either two or three vehicles among them. Based on the theory, our algorithm mainly concentrates on the search for those critical two or three vehicles avoiding global searching. The simulation results are worked out to verify the correctness of the theory and illustrate the effectiveness of the algorithm.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    Minimum time rendezvous for multi-vehicle with non-identical velocity constraints


    Beteiligte:
    Chunhe, Hu (Autor:in) / Zongji, Chen (Autor:in)


    Erscheinungsdatum :

    01.08.2014


    Format / Umfang :

    170168 byte




    Medientyp :

    Aufsatz (Konferenz)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch



    Minimum-fuel rendezvous techniques

    HEMPEL, P. R. / TSCHAUNER, J. F. A. | AIAA | 1965


    Quasi-optimum control for minimum-time rendezvous.

    Cohen, V. / Friedland, B. | NTRS | 1966


    Minimum-time orbital rendezvous between neighboring elliptic orbits

    Alfriend, K. T. / Kashiwagi, Y. | NTRS | 1969