Optimization of the flight trajectory of a non-manoeuvrable aircraft to minimize fuel consumption by the dynamic programming method

Grevtsov, N.; Kumakshev, S. A.; Shmatkov, A. M.

doi:10.1016/j.jappmathmech.2018.03.004

Cited by 7 publications

(2 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Dynamic programming transforms the multistage decision-making problem into a series of single-stage decision-making subproblems according to its characteristics, and then solves the subproblems one by one to reach the optimal decision-making sequence of the whole problem (Lazarev and Werner 2009;de Matos et al 2015). It solves each subproblem only once, and if there is a common subproblem, the stored state is used directly without repeated decision making (Lazarev and Werner 2009;de Matos et al 2015;Grevtsov et al 2017). Dynamic programming has been widely applied in various sectors with significant results (Konak et al 2011;Grevtsov et al 2017;Bürgy et al 2020).…”

Section: Literature Reviewmentioning

confidence: 99%

“…It solves each subproblem only once, and if there is a common subproblem, the stored state is used directly without repeated decision making (Lazarev and Werner 2009;de Matos et al 2015;Grevtsov et al 2017). Dynamic programming has been widely applied in various sectors with significant results (Konak et al 2011;Grevtsov et al 2017;Bürgy et al 2020). Since it is seldom applied to lifting sequence optimization for luffing tower cranes, this paper addresses how to integrate such optimization problems with dynamic programming to extend its application.…”

Section: Literature Reviewmentioning

confidence: 99%

See 1 more Smart Citation

Lifting Sequence Optimization of Luffing Tower Cranes Considering Motion Paths with Dynamic Programming

Soto

2021

J. Constr. Eng. Manage.

View full text Add to dashboard Cite

The lifting sequence of luffing tower cranes is a key factor in the normal operation of construction projects. Accurate estimation of total lifting time is necessary for lifting sequence optimization. Existing formulations for lifting time estimation have two main deficiencies. One is that the relationship between the hoist motion path of the hook and the luffing motion path of the boom is often neglected. The other is that lifting delays resulting from the horizontal motion path of the boom caused by the relative locations of the crane and the lifting start and end points are rarely taken into account. To address those limitations, this paper proposes a lifting sequence optimization model (LSOM) considering motion paths with dynamic programming. The effectiveness of the proposed model is evaluated by comparing it with three conventional lifting strategies [first in-first serve (FIFS), shortest job first (SJF), and nearest neighbor first (NNF)]. The results show that LSOM achieves a shorter total lifting time and higher crane utilization when compared with FIFS, SJF, and NNF.

show abstract

Section: Literature Reviewmentioning

confidence: 99%

Section: Literature Reviewmentioning

confidence: 99%

Lifting Sequence Optimization of Luffing Tower Cranes Considering Motion Paths with Dynamic Programming

Soto

2021

J. Constr. Eng. Manage.

View full text Add to dashboard Cite

show abstract

Air traffic control with prognosticated flight trajectory

Markelov

Шукалов

Жаринов

et al. 2020

J. Phys.: Conf. Ser.

View full text Add to dashboard Cite

The satellite navigation and precision inertial system development quality leap provided a significant increase of the object position definition accuracy characteristics. This technology implementation in aviation led to possibility of flights in the given trajectory coordinates through a geodesy system without application of ground radio beacons to navigate. Of course, there is also a possibility to make a flight with a random route connecting airports of taking off and one of landing with optimal trajectory keeping in mind the limitations of air space restricted areas including sometimes the zone landscape. Logically to continue the transformation from the flights with radio beacons to navigate to the flights of so called zone navigation they need to form a given route and its sections connected to the way points with clearly defined geodesy system coordinates. So there is a possibility of accurate aircraft movement trajectory prognostication in a route and the prognostication of its navigation characteristics. There are some principles proposed of a control algorithm being applied during the aircraft movement in prognosticated navigation trajectories.

show abstract

Flight trajectory optimization without decomposition into separate stages

Kumakshev

Shmatkov

2018

IOP Conf. Ser.: Mater. Sci. Eng.

View full text Add to dashboard Cite

Optimization of the flight trajectory of a non-manoeuvrable aircraft to minimize fuel consumption by the dynamic programming method

Cited by 7 publications

References 9 publications

Lifting Sequence Optimization of Luffing Tower Cranes Considering Motion Paths with Dynamic Programming

Lifting Sequence Optimization of Luffing Tower Cranes Considering Motion Paths with Dynamic Programming

Air traffic control with prognosticated flight trajectory

Flight trajectory optimization without decomposition into separate stages

Contact Info

Product

Resources

About