Formation satellite finite-time configuration containment control method
A control method and time-limited technology, applied in the field of formation satellite configuration including control, can solve problems such as poor robustness and inability to fully meet the actual application environment
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
specific Embodiment approach 1
[0048] 1. The finite-time configuration of formation satellites includes control methods,
[0049] Based on the following assumptions:
[0050] (1) The time-varying form of control input τ for all pilot stars oi =[τ oix τ oiy τ oiz ] T is unknown to all following stars, but its upper bound information can be obtained by the adjacent follower star of the pilot star, namely
[0051] (2) Generalized interference τ doi is time-varying and unknown, satisfying in is an unknown, bounded constant, defined τ ‾ do = max ( τ ‾ do 1 , . . . , τ ‾ doN ) ;
[0052] (3) There is a positive con...
specific Embodiment approach 2
[0073] Step 3 of the present embodiment provides the specific implementation process of the weighted adjacency matrix A and the Laplacian matrix in the directed graph graph theory of the satellite formation system as follows:
[0074] ν F ={1,…,N} is the set of following stars, ν L ={N+1,…,N+m} is the set of pilot stars, and the set of satellite formation system is ν=ν L ∪ν F ;
[0075] The communication topology between formation satellites is represented by a directed graph G=(ν,ε), where ν is the set of all nodes, is the set of all edges; for formation satellites i and j, edge (ν i ,ν j )∈ε means that formation satellite j can receive information from formation satellite i, but the opposite is not necessarily true; node ν i The neighbors of are defined as satisfying (ν j ,ν i ) ∈ ε relation of all formation satellites j set, denoted as N i ={ν j :(ν j ,ν i )∈ε};
[0076] The weighted adjacency matrix A of the directed graph G=[a ij ], if (v j ,v i ) ∈ ε the...
specific Embodiment approach 3
[0086] The specific implementation process of step 4 of this embodiment is as follows:
[0087] First define the following error function
[0088] e i 1 x = Σ j 1 ∈ v F a i 1 j 1 ( p i 1 - p j 1 ) + Σ j 2 ∈ v L a i ...
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com