{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,23]],"date-time":"2026-01-23T10:54:13Z","timestamp":1769165653643,"version":"3.49.0"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030779696","type":"print"},{"value":"9783030779702","type":"electronic"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-77970-2_13","type":"book-chapter","created":{"date-parts":[[2021,6,10]],"date-time":"2021-06-10T10:05:06Z","timestamp":1623319506000},"page":"158-172","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Pruned Simulation-Based Optimal Sailboat Path Search Using Micro HPC Systems"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3283-6032","authenticated-orcid":false,"given":"Roman","family":"D\u0119bski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4206-9052","authenticated-orcid":false,"given":"Bartlomiej","family":"Sniezynski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,6,9]]},"reference":[{"key":"13_CR1","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1090\/S0002-9904-1954-09848-8","volume":"60","author":"R Bellman","year":"1954","unstructured":"Bellman, R.: The theory of dynamic programming. Bull. Am. Math. Soc. 60, 503\u2013515 (1954)","journal-title":"Bull. Am. Math. Soc."},{"key":"13_CR2","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1090\/qam\/102435","volume":"16","author":"R Bellman","year":"1958","unstructured":"Bellman, R.: On a routing problem. Q. Appl. Math. 16, 87\u201390 (1958)","journal-title":"Q. Appl. Math."},{"key":"13_CR3","doi-asserted-by":"publisher","DOI":"10.1515\/9781400874651","volume-title":"Applied Dynamic Programming","author":"R Bellman","year":"1962","unstructured":"Bellman, R., Dreyfus, S.: Applied Dynamic Programming. Princeton University Press, Princeton (1962)"},{"key":"13_CR4","volume-title":"Dynamic Programming and Optimal Control","author":"DP Bertsekas","year":"2000","unstructured":"Bertsekas, D.P.: Dynamic Programming and Optimal Control, 2nd edn. Belmont, Mass (2000)","edition":"2"},{"issue":"9\u201310","key":"13_CR5","doi-asserted-by":"publisher","first-page":"1202","DOI":"10.1016\/j.actaastro.2010.07.001","volume":"67","author":"M Ceriotti","year":"2010","unstructured":"Ceriotti, M., Vasile, M.: MGA trajectory planning with an ACO-inspired algorithm. Acta Astronaut. 67(9\u201310), 1202\u20131217 (2010)","journal-title":"Acta Astronaut."},{"key":"13_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"722","DOI":"10.1007\/BFb0055823","volume-title":"Mathematical Foundations of Computer Science 1998","author":"A Crauser","year":"1998","unstructured":"Crauser, A., Mehlhorn, K., Meyer, U., Sanders, P.: A parallelization of Dijkstra\u2019s shortest path algorithm. In: Brim, L., Gruska, J., Zlatu\u0161ka, J. (eds.) MFCS 1998. LNCS, vol. 1450, pp. 722\u2013731. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0055823"},{"key":"13_CR7","doi-asserted-by":"publisher","first-page":"807","DOI":"10.1057\/jors.2014.40","volume":"66","author":"RC Dalang","year":"2014","unstructured":"Dalang, R.C., Dumas, F., Sardy, S., Morgenthaler, S., Vila, J.: Stochastic optimization of sailing trajectories in an upwind regatta. J. Oper. Res. Soc. 66, 807\u2013821 (2014)","journal-title":"J. Oper. Res. Soc."},{"issue":"2","key":"13_CR8","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1515\/amcs-2016-0025","volume":"26","author":"R D\u0119bski","year":"2016","unstructured":"D\u0119bski, R.: An adaptive multi-spline refinement algorithm in simulation based sailboat trajectory optimization using onboard multi-core computer systems. Int. J. Appl. Math. Comput. Sci. 26(2), 351\u2013365 (2016)","journal-title":"Int. J. Appl. Math. Comput. Sci."},{"key":"13_CR9","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"EW Dijkstra","year":"1959","unstructured":"Dijkstra, E.W.: A note on two problems in connexion with graphs. Numer. Math. 1, 269\u2013271 (1959)","journal-title":"Numer. Math."},{"issue":"3","key":"13_CR10","doi-asserted-by":"publisher","first-page":"551","DOI":"10.2478\/amcs-2014-0040","volume":"24","author":"R D\u0119bski","year":"2014","unstructured":"D\u0119bski, R.: High-performance simulation-based algorithms for alpine ski racer\u2019s trajectory optimization in heterogeneous computer systems. Int. J. Appl. Math. Comput. Sci. 24(3), 551\u2013566 (2014)","journal-title":"Int. J. Appl. Math. Comput. Sci."},{"key":"13_CR11","doi-asserted-by":"crossref","unstructured":"Harabor, D., Grastien, A.: Online graph pruning for path finding on grid maps, vol. 2 (2011)","DOI":"10.1609\/aaai.v25i1.7994"},{"key":"13_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/978-3-540-77220-0_21","volume-title":"High Performance Computing \u2013 HiPC 2007","author":"P Harish","year":"2007","unstructured":"Harish, P., Narayanan, P.J.: Accelerating large graph algorithms on the GPU using CUDA. In: Aluru, S., Parashar, M., Badrinath, R., Prasanna, V.K. (eds.) HiPC 2007. LNCS, vol. 4873, pp. 197\u2013208. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-77220-0_21"},{"key":"13_CR13","unstructured":"Jasika, N., Alispahic, N., Elma, A., Ilvana, K., Elma, L., Nosovic, N.: Dijkstra\u2019s shortest path algorithm serial and parallel execution performance analysis. In: MIPRO, 2012 Proceedings of the 35th International Convention, pp. 1811\u20131815. IEEE (2012)"},{"key":"13_CR14","doi-asserted-by":"crossref","unstructured":"Kuffner, J.J., LaValle, S.M.: Rrt-connect: an efficient approach to single-query path planning. In: Proceedings 2000 IEEE International Conference on Robotics and Automation, vol. 2, pp. 995\u20131001. IEEE (2000)","DOI":"10.1109\/ROBOT.2000.844730"},{"key":"13_CR15","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/S0377-0427(00)00423-4","volume":"124","author":"RM Lewis","year":"2000","unstructured":"Lewis, R.M., Torczon, V., Trosset, M.W.: Direct search methods: then and now. J. Comput. Appl. Math. 124, 191\u2013207 (2000)","journal-title":"J. Comput. Appl. Math."},{"key":"13_CR16","unstructured":"Marchaj, C.: Aero-hydrodynamics of Sailing. Adlard Coles Nautical (2000)"},{"key":"13_CR17","doi-asserted-by":"crossref","unstructured":"Park, C., Pan, J., Manocha, D.: Real-time optimization-based planning in dynamic environments using GPUs. In: 2013 IEEE International Conference on Robotics and Automation (ICRA), pp. 4090\u20134097. IEEE (2013)","DOI":"10.1109\/ICRA.2013.6631154"},{"key":"13_CR18","doi-asserted-by":"crossref","unstructured":"P\u00eatres, C., Romero-Ramirez, M.A., Plumet, F.: Reactive path planning for autonomous sailboat. In: 2011 15th International Conference on Advanced Robotics (ICAR), pp. 112\u2013117. IEEE (2011)","DOI":"10.1109\/ICAR.2011.6088585"},{"key":"13_CR19","unstructured":"Pontryagin, L.S., Boltyanski, V.G., Gamkrelidze, R.V., Mischenko, E.F.: The Mathematical Theory of Optimal Processes. Interscience, NY (1962)"},{"key":"13_CR20","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1162\/EVCO_a_00084","volume":"20","author":"P Po\u0161\u00edk","year":"2012","unstructured":"Po\u0161\u00edk, P., Huyer, W., P\u00e1l, L.: A comparison of global search algorithms for continuous black box optimization. Evol. Comput. 20, 509\u2013541 (2012)","journal-title":"Evol. Comput."},{"issue":"4","key":"13_CR21","doi-asserted-by":"publisher","first-page":"801","DOI":"10.2514\/1.7370","volume":"28","author":"E Rippel","year":"2005","unstructured":"Rippel, E., Bar-Gill, A., Shimkin, N.: Fast graph-search algorithms for general-aviation flight trajectory generation. J. Guid. Control. Dyn. 28(4), 801\u2013811 (2005)","journal-title":"J. Guid. Control. Dyn."},{"key":"13_CR22","unstructured":"Singla, G., Tiwari, A., Singh, D.P.: New approach for graph algorithms on GPU using CUDA. Int. J. Comput. Appl. 72(18), 38\u201342 (2013). Published by Foundation of Computer Science, New York, USA"},{"issue":"7","key":"13_CR23","doi-asserted-by":"publisher","first-page":"604","DOI":"10.1016\/j.robot.2007.10.004","volume":"56","author":"R Stelzer","year":"2008","unstructured":"Stelzer, R., Pr\u00f6ll, T.: Autonomous sailboat navigation for short course racing. Robot. Auton. Syst. 56(7), 604\u2013614 (2008)","journal-title":"Robot. Auton. Syst."},{"key":"13_CR24","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-6053-510.1007\/978-1-4419-6053-5","volume-title":"Mathematics and its History","author":"J Stillwell","year":"2010","unstructured":"Stillwell, J.: Mathematics and its History, 3rd edn. Springer, New York (2010). https:\/\/doi.org\/10.1007\/978-1-4419-6053-510.1007\/978-1-4419-6053-5","edition":"3"},{"issue":"1","key":"13_CR25","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/BF02071065","volume":"37","author":"O von Stryk","year":"1992","unstructured":"von Stryk, O., Bulirsch, R.: Direct and indirect methods for trajectory optimization. Annals Oper. Res. 37(1), 357\u2013373 (1992)","journal-title":"Annals Oper. Res."},{"issue":"3","key":"13_CR26","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1109\/37.588098","volume":"17","author":"HJ Sussmann","year":"1997","unstructured":"Sussmann, H.J., Willems, J.C.: 300 years of optimal control: from the brachystochrone to the maximum principle. IEEE Control. Syst. 17(3), 32\u201344 (1997)","journal-title":"IEEE Control. Syst."},{"key":"13_CR27","doi-asserted-by":"crossref","unstructured":"Sz\u0142apczy\u0144ski: Customized crossover in evolutionary sets of safe ship trajectories. Int. J. Appl. Math. Comput. Sci 22(4), 999\u20131009 (2012)","DOI":"10.2478\/v10006-012-0074-x"},{"issue":"4","key":"13_CR28","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1007\/s10898-008-9329-3","volume":"44","author":"M Vasile","year":"2009","unstructured":"Vasile, M., Locatelli, M.: A hybrid multiagent approach for global trajectory optimization. J. Global Optim. 44(4), 461\u2013479 (2009)","journal-title":"J. Global Optim."},{"key":"13_CR29","doi-asserted-by":"publisher","first-page":"114541","DOI":"10.1016\/j.eswa.2020.114541","volume":"170","author":"J Wang","year":"2021","unstructured":"Wang, J., Li, B., Meng, M.Q.H.: Kinematic constrained bi-directional RRT with efficient branch pruning for robot path planning. Expert Syst. Appl. 170, 114541 (2021)","journal-title":"Expert Syst. Appl."},{"key":"13_CR30","doi-asserted-by":"publisher","first-page":"1173","DOI":"10.3390\/electronics9071173","volume":"9","author":"C Zhang","year":"2020","unstructured":"Zhang, C., Zhou, L., Li, Y., Fan, Y.: A dynamic path planning method for social robots in the home environment. Electronics 9, 1173 (2020)","journal-title":"Electronics"},{"key":"13_CR31","doi-asserted-by":"crossref","unstructured":"\u017byczkowski, M.: Sailing route planning method considering various user categories. Polish Marit. Res. 27 (2020)","DOI":"10.2478\/pomr-2020-0056"}],"container-title":["Lecture Notes in Computer Science","Computational Science \u2013 ICCS 2021"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-77970-2_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,9]],"date-time":"2025-06-09T22:02:28Z","timestamp":1749506548000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-77970-2_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030779696","9783030779702"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-77970-2_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"9 June 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICCS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Krakow","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Poland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 June 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 June 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccs-computsci2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.iccs-meeting.org\/iccs2021\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"156","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"48","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"14","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"31% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.8","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.9","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"212 full and 43 short papers were selected from 479 submissions to the workshops\/ thematic tracks. The conference was held virtually.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}