Trajectory optimisation of satellite launch vehicles using network flow-based algorithm

2020 ◽  
Vol 124 (1282) ◽  
pp. 1849-1864
Author(s):  
R. Zardashti ◽  
S. Rahimi
Keyword(s):  
Network Flow ◽  
Large Scale ◽  
Equations Of Motion ◽  
Minimum Cost ◽  
Reference Trajectory ◽  
Launch Vehicles ◽  
Optimum Trajectory ◽  
Large Scale Network ◽  
Scale Network ◽  
Trajectory Optimisation

ABSTRACTA trajectory optimisation procedure is addressed to generate a reference trajectory for Satellite Launch Vehicles (SLVs). Using a grid-based discrete scheme, a Modified Minimum Cost Network Flow (MCNF)-based algorithm over a large-scale network is proposed. By using the network grid around the Earth and the discrete dynamic equations of motion, the optimum trajectory from a launch point to the desired orbit is obtained exactly by minimisation of a cost functional subject to the nonlinear dynamics and mission constraints of the SLV. Several objectives such as the flight time and terminal conditions may be assigned to each arc in the network. Simulation results demonstrate the capability of the proposed algorithm to generate an admissible trajectory in the minimum possible time compared with previous works.

Large-Scale Network Analysis for Online Social Brand Advertising

MIS Quarterly ◽  
2016 ◽  
Vol 40 (4) ◽  
pp. 849-868 ◽  
Author(s):  
Kunpeng Zhang ◽  
◽  
Siddhartha Bhattacharyya ◽  
Sudha Ram ◽  
◽  
...  
Keyword(s):  
Network Analysis ◽  
Large Scale ◽  
Large Scale Network ◽  
Brand Advertising ◽  
Scale Network

scholarly journals Adaptation of Random Binomial Graphs for Testing Network Flow Problems Algorithms

Mathematics ◽  
2021 ◽  
Vol 9 (15) ◽  
pp. 1716
Author(s):  
Adrian Marius Deaconu ◽  
Delia Spridon
Keyword(s):  
Network Flow ◽  
Large Scale ◽  
Random Network ◽  
Minimum Cost ◽  
Maximum Flow ◽  
Network Flow Problems ◽  
Commodity Flow ◽  
Vast Number ◽  
Flow Problems ◽  
Execution Speed

Algorithms for network flow problems, such as maximum flow, minimum cost flow, and multi-commodity flow problems, are continuously developed and improved, and so, random network generators become indispensable to simulate the functionality and to test the correctness and the execution speed of these algorithms. For this purpose, in this paper, the well-known Erdős–Rényi model is adapted to generate random flow (transportation) networks. The developed algorithm is fast and based on the natural property of the flow that can be decomposed into directed elementary s-t paths and cycles. So, the proposed algorithm can be used to quickly build a vast number of networks as well as large-scale networks especially designed for s-t flows.

Attention Biases Visual Activity in Visual Short-term Memory

2014 ◽  
Vol 26 (7) ◽  
pp. 1377-1389 ◽  
Author(s):  
Bo-Cheng Kuo ◽  
Mark G. Stokes ◽  
Alexandra M. Murray ◽  
Anna Christina Nobre
Keyword(s):  
Large Scale ◽  
Short Term Memory ◽  
Control Mechanisms ◽  
Top Down ◽  
Short Term ◽  
Visual Activity ◽  
Visual Short Term Memory ◽  
Large Scale Network ◽  
Visual Areas ◽  
Scale Network

In the current study, we tested whether representations in visual STM (VSTM) can be biased via top–down attentional modulation of visual activity in retinotopically specific locations. We manipulated attention using retrospective cues presented during the retention interval of a VSTM task. Retrospective cues triggered activity in a large-scale network implicated in attentional control and led to retinotopically specific modulation of activity in early visual areas V1–V4. Importantly, shifts of attention during VSTM maintenance were associated with changes in functional connectivity between pFC and retinotopic regions within V4. Our findings provide new insights into top–down control mechanisms that modulate VSTM representations for flexible and goal-directed maintenance of the most relevant memoranda.

Sign in / Sign up

Export Citation Format

Share Document