[Babb, J. and Currie, J. (2008). The brachistochrone problem: Mathematics for a broad audience via a large context problem, The Montana Mathematics Enthusiast 5(2-3): 169-183.10.54870/1551-3440.1099]Search in Google Scholar
[Bellman, R. (1954). The theory of dynamic programming, Bulletin of the American Mathematical Society 60: 503-515.10.1090/S0002-9904-1954-09848-8]Search in Google Scholar
[Bellman, R. (1958). On a routing problem, Quarterly of Applied Mathematics 16: 87-90.10.1090/qam/102435]Search in Google Scholar
[Betts, J.T. (1998). Survey of numerical methods for trajectory optimization, Journal of Guidance Control and Dynamics 21(2): 193-207.10.2514/2.4231]Search in Google Scholar
[Brodie, M. (2009). Development of Fusion Motion Capture for Optimisation of Performance in Alpine Ski Racing, Ph.D. thesis, Massey University, Wellington.]Search in Google Scholar
[Byrski, A., D˛ebski, R. and Kisiel-Dorohinicki, M. (2012). Agent-based computing in an augmented cloud environment, Computer Systems Science and Engineering 27(1): 7-18.]Search in Google Scholar
[Ceriotti, M. and Vasile, M. (2010). MGA trajectory planning with an ACO-inspired algorithm, Acta Astronautica 67(9-10): 1202-1217.10.1016/j.actaastro.2010.07.001]Search in Google Scholar
[Crauser, A., Mehlhorn, K., Meyer, U. and Sanders, P. (1998). A parallelization of Dijkstra’s shortest path algorithm, in L. Brim, J. Gruska and J. Zlatuška (Eds.), Mathematical Foundations of Computer Science, Springer, London, pp. 722-731.10.1007/BFb0055823]Search in Google Scholar
[Debski, R., Byrski, A. and Kisiel-Dorohinicki, M. (2012).]Search in Google Scholar
[Towards an agent-based augmented cloud, Journal of Telecommunications and Information Technology (1): 16-22.]Search in Google Scholar
[Debski, R., Krupa, T. and Majewski, P. (2013). ComcuteJS: A web browser based platform for large-scale computations, Computer Science 14(1): 143-152.10.7494/csci.2013.14.1.143]Search in Google Scholar
[Dijkstra, E.W. (1959). A note on two problems in connexion with graphs, Numerische Mathematik 1(1): 269-271.10.1007/BF01386390]Search in Google Scholar
[Dramski, M. (2012). A comparison between Dijkstra algorithm and simplified ant colony optimization in navigation, Zeszyty Naukowe, Maritime University of Szczecinie 29(101): 25-29.]Search in Google Scholar
[Gaster, B.R., Howes, L.W., Kaeli, D.R.,Mistry, P. and Schaa, D. (2013). Heterogeneous Computing with OpenCL-Revised OpenCL 1.2 Edition, Morgan Kaufmann, Waltham, MA.]Search in Google Scholar
[Harish, P. and Narayanan, P. (2007). Accelerating large graph algorithms on the GPU using CUDA, in S. Aluru, M. Parashar, R. Badrinath and V. Prasanna (Eds.), High Performance Computing-HiPC 2007, Springer, Berlin, pp. 197-208.10.1007/978-3-540-77220-0_21]Search in Google Scholar
[Hirano, Y. (2006). Quickest descent line during alpine ski racing, Sports Engineering 9(4): 221-228.10.1007/BF02866060]Search in Google Scholar
[Jasika, N., Alispahic, N., Elma, A., Ilvana, K., Elma, L. and Nosovic, N. (2012). Dijkstra’s shortest path algorithm serial and parallel execution performance analysis, Proceedings of the 35th International Convention, MIPRO 2012, Opatija, Croatia, pp. 1811-1815.]Search in Google Scholar
[Kaps, P., Nachbauer,W. and Mossner, M. (1996). Determination of kinetic friction and drag area in alpine skiing, in C. Mote, R. Johnson and W. Hauser (Eds.), Ski Trauma and Skiing Safety, Vol. 10, American Society for Testing and Materials, Philadelphia, PA, pp. 165-177.10.1520/STP37926S]Search in Google Scholar
[Lewis, R.M., Torczon, V. and Trosset, M.W. (2000). Direct search methods: Then and now, Journal of Computational and Applied Mathematics 124(1-2): 191-207.10.1016/S0377-0427(00)00423-4]Search in Google Scholar
[Pontryagin, L.S., Boltyanski, V.G., Gamkrelidze, R.V. and Mischenko, E.F. (1962). TheMathematical Theory of Optimal Processes, Interscience, New York, NY.]Search in Google Scholar
[Pošík, P. and Huyer, W. (2012). Restarted local search algorithms for continuous black box optimization, Evolutionary Computation 20(4): 575-607.10.1162/EVCO_a_0008722779407]Search in Google Scholar
[Pošík, P., Huyer, W. and Pál, L. (2012). A comparison of global search algorithms for continuous black box optimization, Evolutionary Computation 20(4): 509-541.10.1162/EVCO_a_0008422708992]Search in Google Scholar
[Rippel, E., Bar-Gill, A. and Shimkin, N. (2005). Fast graph-search algorithms for general-aviation flight trajectory generation, Journal of Guidance, Control, and Dynamics 28(4): 801-811.10.2514/1.7370]Search in Google Scholar
[Singla, G., Tiwari, A. and Singh, D.P. (2013). New approach for graph algorithms on GPU using CUDA, International Journal of Computer Applications 72(18): 38-42.]Search in Google Scholar
[Stechert, D.G. (1963). On the Use of the Calculus of Variations in Trajectory Optimization Problems, Rand Corporation, Santa Monica, CA.]Search in Google Scholar
[Stillwell, J. (2010). Mathematics and Its History, 3rd edn., Springer, New York, NY.]Search in Google Scholar
[Sussmann, H.J. and Willems, J.C. (1997). 300 years of optimal control: From the brachystochrone to the maximum principle, IEEE Control Systems 17(3): 32-44.10.1109/37.588098]Search in Google Scholar
[Sussmann, H.J. and Willems, J.C. (2002). The brachistochrone problem and modern control theory, Contemporary Trends in Nonlinear Geometric Control Theory and Its Applications, Mexico City, Mexico, pp. 113-166.]Search in Google Scholar
[Szłapczy´nski, R. and Szłapczy´nska, J.(2012). Customized crossover in evolutionary sets of safe ship trajectories, International Journal of Applied Mathematics and Computer Science 22(4): 999-1009, DOI: 10.2478/v10006-012-0074-x.10.2478/v10006-012-0074-x]Search in Google Scholar
[Szynkiewicz, W. and Błaszczyk, J. (2011). Optimization-based approach to path planning for closed chain robot systems, International Journal of Applied Mathematics and Computer Science 21(4): 659-670, DOI: 10.2478/v10006-011-0052-8.10.2478/v10006-011-0052-8]Search in Google Scholar
[Vanderbei, R.J. (2001). Case studies in trajectory optimization: Trains, planes, and other pastimes, Optimization and Engineering 2(2): 215-243.10.1023/A:1013145328012]Search in Google Scholar
[Vasile, M. and Locatelli, M. (2009). A hybrid multiagent approach for global trajectory optimization, Journal of Global Optimization 44(4): 461-479. von Stryk, O. and Bulirsch, R. (1992). Direct and indirect methods for trajectory optimization, Annals of Operations Research 37(1): 357-373.]Search in Google Scholar
[Wuerl, A., Crain, T. and Braden, E. (2003). Genetic algorithm and calculus of variations-based trajectory optimization technique, Journal of Spacecraft and Rockets 40(6): 882-888.10.2514/2.7053]Search in Google Scholar
[Yokoyama, N. (2002). Trajectory optimization of space plane using genetic algorithm combined with gradient method, 23rd International Congress of Aeronautical Sciences, Toronto, Canada, pp. 513.1-513.10. ]Search in Google Scholar