{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T07:30:37Z","timestamp":1758267037110,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031229893"},{"type":"electronic","value":"9783031229909"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-22990-9_11","type":"book-chapter","created":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T01:22:43Z","timestamp":1672536163000},"page":"153-167","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Synthesis of\u00a0Trajectory Planning Algorithms Using Evolutionary Optimization Algorithms"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6059-9102","authenticated-orcid":false,"given":"Dmitry","family":"Malyshev","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6733-3817","authenticated-orcid":false,"given":"Vladislav","family":"Cherkasov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8856-7823","authenticated-orcid":false,"given":"Larisa","family":"Rybak","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2057-9016","authenticated-orcid":false,"given":"Askhat","family":"Diveev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,1,1]]},"reference":[{"issue":"4","key":"11_CR1","first-page":"118","volume":"4","author":"M El Khaili","year":"2014","unstructured":"El Khaili, M.: Visibility graph for path planning in the presence of moving obstacles. IRACST - Eng. Sci. Technol. Int. J. (ESTIJ) 4(4), 118\u2013123 (2014)","journal-title":"IRACST - Eng. Sci. Technol. Int. J. (ESTIJ)"},{"key":"11_CR2","volume-title":"Principles of Robot Motion-Theory, Algorithms, and Implementation","author":"H Choset","year":"2005","unstructured":"Choset, H., et al.: Principles of Robot Motion-Theory, Algorithms, and Implementation. MIT Press, Cambridge (2005)"},{"issue":"2","key":"11_CR3","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/0925-2312(95)90020-9","volume":"9","author":"SJ Russell","year":"1995","unstructured":"Russell, S.J., Norvig, P.: Artificial intelligence: a modern approach. Neurocomputing 9(2), 215\u2013218 (1995)","journal-title":"Neurocomputing"},{"issue":"4","key":"11_CR4","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1080\/13658810801949850","volume":"23","author":"W Zeng","year":"2009","unstructured":"Zeng, W., Church, R.L.: Finding shortest paths on real road networks: the case for A*. Int. J. Geogr. Inf. Sci. 23(4), 531\u2013543 (2009)","journal-title":"Int. J. Geogr. Inf. Sci."},{"issue":"1","key":"11_CR5","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/0004-3702(85)90084-0","volume":"27","author":"RE Korf","year":"1985","unstructured":"Korf, R.E.: Depth-first iterative-deepening. An optimal admissible tree search. Artif. Intell. 27(1), 97\u2013109 (1985)","journal-title":"Artif. Intell."},{"issue":"1","key":"11_CR6","doi-asserted-by":"publisher","first-page":"24","DOI":"10.4103\/2228-7477.83518","volume":"1","author":"H Bolandi","year":"2011","unstructured":"Bolandi, H., Ehyaei, A.F.: A novel method for trajectory planning of cooperative mobile manipulators. J. Med. Signals Sens. 1(1), 24\u201335 (2011)","journal-title":"J. Med. Signals Sens."},{"key":"11_CR7","doi-asserted-by":"crossref","unstructured":"V\u00f6lz, A., Graichen, K.: An optimization-based approach to dual-arm motion planning with closed kinematics. In: Proceedings of the 2018 IEEE\/RSJ International Conference on Intelligent Robots and Systems, IROS, pp. 8346\u20138351. IEEE (2018)","DOI":"10.1109\/IROS.2018.8593927"},{"key":"11_CR8","doi-asserted-by":"crossref","unstructured":"McMahon, T., Sandstrom, R., Thomas, S., Amato, N.M.: Manipulation planning with directed reachable volumes. In: IEEE International Conference on Intelligent Robots and Systems 2017, pp. 4026\u20134033 (2017)","DOI":"10.1109\/IROS.2017.8206257"},{"key":"11_CR9","unstructured":"Clavel, R.: Conception d\u2019un robot parall\u00e8le rapide \u00e0 4 degr\u00e9s de libert\u00e9. Ph.D. Thesis, EPFL, Lausanne, Switzerland (1991)"},{"key":"11_CR10","unstructured":"Williams II, R.L.: The delta parallel robot: kinematics solutions. www.ohio.edu\/people\/williar4\/html\/pdf\/DeltaKin.pdf. Accessed 9 Oct 2022"},{"key":"11_CR11","doi-asserted-by":"crossref","unstructured":"Khalapyan, S., Rybak, L., Malyshev, D., Kuzmina, V.: Synthesis of parallel robots optimal motion trajectory planning algorithms. In: IX International Conference on Optimization and Applications (OPTIMA 2018), pp. 311\u2013324 (2018)","DOI":"10.12783\/dtcse\/optim2018\/27942"},{"key":"11_CR12","first-page":"27","volume":"1340","author":"L Rybak","year":"2020","unstructured":"Rybak, L., Malyshev, D., Gaponenko, E.: Optimization algorithm for approximating the solutions set of nonlinear inequalities systems in the problem of determining the robot workspace. Commun. Comput. Inf. Sci. 1340, 27\u201337 (2020)","journal-title":"Commun. Comput. Inf. Sci."},{"key":"11_CR13","unstructured":"Rogers, D.: Procedural Elements for Computer Graphics. McGraw-Hill (1985)"},{"key":"11_CR14","unstructured":"line3D - 3D Bresenham\u2019s (a 3D line drawing algorithm). https:\/\/ftp.isc.org\/pub\/usenet\/comp.sources.unix\/volume26\/line3d. Accessed 9 Oct 2022"},{"key":"11_CR15","volume-title":"Adaptation in Natural and Artificial Systems","author":"JH Holland","year":"1975","unstructured":"Holland, J.H.: Adaptation in Natural and Artificial Systems. MIT Press, Cambridge (1975)"},{"key":"11_CR16","doi-asserted-by":"crossref","unstructured":"Diveev, A.: Cartesian genetic programming for synthesis of control system for group of robots. In: 28th Mediterranean Conference on Control and Automation, MED 2020, pp. 972\u2013977 (2020)","DOI":"10.1109\/MED48518.2020.9183180"},{"key":"11_CR17","doi-asserted-by":"publisher","first-page":"707","DOI":"10.1007\/s41315-022-00240-4","volume":"9","author":"AM Zanchettin","year":"2022","unstructured":"Zanchettin, A.M., Messeri, C., Cristantielli, D., Rocco, P.: Trajectory optimisation in collaborative robotics based on simulations and genetic algorithms. Int. J. Intell. Robot. Appl. 9, 707\u2013723 (2022)","journal-title":"Int. J. Intell. Robot. Appl."},{"issue":"2","key":"11_CR18","first-page":"254","volume":"18","author":"AI Diveev","year":"2017","unstructured":"Diveev, A.I., Konstantinov, S.V.: Evolutionary algorithms for the problem of optimal control. RUDN J. Eng. Res. 18(2), 254\u2013265 (2017)","journal-title":"RUDN J. Eng. Res."},{"key":"11_CR19","doi-asserted-by":"crossref","unstructured":"Kennedy, J.; Eberhart, R.: Particle swarm optimization. In: Proceedings of IEEE International Conference on Neural Networks, vol. IV, pp. 1942\u20131948 (1995)","DOI":"10.1109\/ICNN.1995.488968"},{"key":"11_CR20","unstructured":"Shi, Y.; Eberhart, R.C.: A modified particle swarm optimizer. In: Proceedings of IEEE International Conference on Evolutionary Computation, pp. 69\u201373 (1998)"},{"key":"11_CR21","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1016\/j.advengsoft.2013.12.007","volume":"69","author":"S Mirjalili","year":"2014","unstructured":"Mirjalili, S., Mirjalili, S.M., Lewis, A.: Grey wolf optimizer. Adv. Eng. Softw. 69, 46\u201361 (2014)","journal-title":"Adv. Eng. Softw."},{"issue":"3","key":"11_CR22","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1017\/S0263574720000442","volume":"39","author":"C Choubey","year":"2021","unstructured":"Choubey, C., Ohri, J.: Optimal trajectory generation for a 6-DOF parallel manipulator using grey wolf optimization algorithm. Robotica 39(3), 411\u2013427 (2021)","journal-title":"Robotica"},{"issue":"2","key":"11_CR23","first-page":"674","volume":"32","author":"MA Sen","year":"2019","unstructured":"Sen, M.A., Kalyoncu, M.: Grey wolf optimizer based tuning of a hybrid LQR-PID controller for foot trajectory control of a quadruped robot. Gazi Univ. J. Sci. 32(2), 674\u2013684 (2019)","journal-title":"Gazi Univ. J. Sci."},{"issue":"8","key":"11_CR24","doi-asserted-by":"publisher","first-page":"8087","DOI":"10.1007\/s13369-021-05487-w","volume":"46","author":"MN Zafar","year":"2021","unstructured":"Zafar, M.N., Mohanta, J.C., Keshari, A.: GWO-potential field method for mobile robot path planning and navigation control. Arab. J. Sci. Eng. 46(8), 8087\u20138104 (2021). https:\/\/doi.org\/10.1007\/s13369-021-05487-w","journal-title":"Arab. J. Sci. Eng."},{"issue":"1","key":"11_CR25","first-page":"67","volume":"19","author":"AI Diveev","year":"2018","unstructured":"Diveev, A.I., Konstantinov, S.V.: Optimal control problem and its solution by grey wolf optimizer algorithm. RUDN J. Eng. Res. 19(1), 67\u201379 (2018)","journal-title":"RUDN J. Eng. Res."},{"issue":"4","key":"11_CR26","doi-asserted-by":"publisher","first-page":"2070","DOI":"10.3390\/app12042070","volume":"12","author":"D Malyshev","year":"2022","unstructured":"Malyshev, D., Rybak, L., Carbone, G., Semenenko, T., Nozdracheva, A.: Optimal design of a parallel manipulator for aliquoting of biomaterials considering workspace and singularity zones. Appl. Sci. 12(4), 2070 (2022)","journal-title":"Appl. Sci."}],"container-title":["Communications in Computer and Information Science","Advances in Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-22990-9_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,11]],"date-time":"2024-10-11T09:33:38Z","timestamp":1728639218000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-22990-9_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031229893","9783031229909"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-22990-9_11","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"1 January 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"OPTIMA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Optimization and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Petrovac","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Montenegro","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"optima2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/agora.guru.ru\/display.php?conf=OPTIMA-2022","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":"43","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":"17","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":"0","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":"40% - 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":"3.1","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":"2.2","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)"}}]}}