Skip to main content

Solving Trajectory Optimization Problems by Influence Diagrams

  • Conference paper
  • First Online:
Symbolic and Quantitative Approaches to Reasoning with Uncertainty (ECSQARU 2017)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 10369))

  • 651 Accesses

Abstract

Influence diagrams are decision-theoretic extensions of Bayesian networks. In this paper we show how influence diagrams can be used to solve trajectory optimization problems. These problems are traditionally solved by methods of optimal control theory but influence diagrams offer an alternative that brings benefits over the traditional approaches. We describe how a trajectory optimization problem can be represented as an influence diagram. We illustrate our approach on two well-known trajectory optimization problems – the Brachistochrone Problem and the Goddard Problem. We present results of numerical experiments on these two problems, compare influence diagrams with optimal control methods, and discuss the benefits of influence diagrams.

This work was supported by the Czech Science Foundation through projects 16-12010S (V. Kratochvíl) and 17-08182S (J. Vomlel).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

Notes

  1. 1.

    This is an approximation only, but the smaller distance discretization step the smaller the approximation error.

  2. 2.

    Bocop package implements a local optimization method. The optimal control problem is approximated by a nonlinear programming (NLP) problem using a time discretization. The NLP problem is solved by Ipopt, using sparse exact derivatives computed by ADOL-C.

  3. 3.

    The initial mass of the rocket is the same for all methods but in the third plot of Fig. 4 we can see that the terminal mass slightly differs. The lowest fuel consumption is observed in case of RK method but we should conclude from that the RK method is optimal but rather that it has the largest approximation error.

  4. 4.

    A bang-bang strategy is a strategy that consists of extreme values only, e.g. it consists of the full thrust and the zero thrust phases only. Bang-bang strategies are optimal solutions of a wide class of optimal control problems.

References

  • Bellman, R.: Dynamic Programming. Princeton University Press, Princeton (1957)

    MATH  Google Scholar 

  • Bertsekas, D.P.: Dynamic Programming and Optimal Control, 2nd edn. Athena Scientific, Belmont (2000)

    Google Scholar 

  • Goddard, R.H.: A method for reaching extreme altitudes, volume 71(2). Smithsonian Miscellaneous Collections (1919)

    Google Scholar 

  • Howard, R.A., Matheson, J.E.: Influence diagrams. In: Howard, R.A., Matheson, J.E. (eds.) Readings on the Principles and Applications of Decision Analysis, vol. II, pp. 721–762. Strategic Decisions Group (1981)

    Google Scholar 

  • Jensen, F.: Bayesian Networks and Decision Graphs. Springer, New York (2001)

    Book  MATH  Google Scholar 

  • Kratochvíl, V., Vomlel, J.: Influence diagrams for speed profile optimization. Int. J. Approximate Reasoning. (2016, in press). http://dx.doi.org/10.1016/j.ijar.2016.11.018

  • Miele, A.: A survey of the problem of optimizing flight paths of aircraft and missiles. In: Bellman, R. (ed.) Mathematical Optimization Techniques, pp. 3–32. University of California Press (1963)

    Google Scholar 

  • Pearl, J.: Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufmann series in representation and reasoning. Morgan Kaufmann, Burlington (1988)

    Google Scholar 

  • Seywald, H., Cliff, E.M.: Goddard problem in presence of a dynamic pressure limit. J. Guidance Control Dyn. 16(4), 776–781 (1992)

    Article  MATH  Google Scholar 

  • Team Commands, Inria Saclay: BOCOP: an open source toolbox for optimal control (2016). http://bocop.org

  • Tsiotras, P., Kelley, H.J.: Drag-law effects in the goddard problem. Automatica 27(3), 481–490 (1991)

    Article  MathSciNet  Google Scholar 

  • Vomlel, J.: Solving the Brachistochrone Problem by an influence diagram. Technical report 1702.02032 (2017). http://arxiv.org/abs/1702.02032

  • Vomlel, J., Kratochvíl, V.: Solving the Goddard Problem by an influence diagram. Technical report 1703.06321 (2017). http://arxiv.org/abs/1703.06321

  • Zlatskiy, V.T., Kiforenko, B.N.: Computation of optimal trajectories with singular-control sections. Vychislitel’naia i Prikladnaia Matematika 49, 101–108 (1983)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Jiří Vomlel .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Vomlel, J., Kratochvíl, V. (2017). Solving Trajectory Optimization Problems by Influence Diagrams. In: Antonucci, A., Cholvy, L., Papini, O. (eds) Symbolic and Quantitative Approaches to Reasoning with Uncertainty. ECSQARU 2017. Lecture Notes in Computer Science(), vol 10369. Springer, Cham. https://doi.org/10.1007/978-3-319-61581-3_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-61581-3_14

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-61580-6

  • Online ISBN: 978-3-319-61581-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics