{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T16:05:09Z","timestamp":1743005109621,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031431104"},{"type":"electronic","value":"9783031431111"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-43111-1_29","type":"book-chapter","created":{"date-parts":[[2023,9,4]],"date-time":"2023-09-04T11:03:01Z","timestamp":1693825381000},"page":"322-333","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Construction of a Three-Dimensional UAV Movement Planner When the Latter Moves in Conditions of Difficult Terrain"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6116-9999","authenticated-orcid":false,"given":"Vladimir","family":"Kostyukov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Igor","family":"Evdokimov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vladislav","family":"Gissov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,9,5]]},"reference":[{"issue":"2","key":"29_CR1","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1109\/TSSC.1968.300136","volume":"4","author":"PE Hart","year":"1968","unstructured":"Hart, P.E., Nilsson, N.J., Raphael, B.A.: Formal basis for the heuristic determination of minimum cost paths. IEEE Trans. Syst. Sci. Cybernet. 4(2), 100\u2013107 (1968)","journal-title":"IEEE Trans. Syst. Sci. Cybernet."},{"key":"29_CR2","doi-asserted-by":"crossref","unstructured":"Piskorsky, D.S., Abdullin, F.H., Nikolaeva, A.R.: Optimization of the A-star path planning algorithm. Bull. SUSU. Comput. Technol. Control, Radio Electron. 20(1), 154\u2013160 (2020). (In Russ.)","DOI":"10.14529\/ctcr200115"},{"key":"29_CR3","doi-asserted-by":"crossref","unstructured":"Stentz, A.: Optimal and efficient path planning for partially known environments. In: Intelligent Unmanned Ground Vehicles. The Springer International Series in Engineering and Computer Science, vol. 388, pp. 203\u2013220 (1997)","DOI":"10.1007\/978-1-4615-6325-9_11"},{"key":"29_CR4","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/j.neucom.2020.12.040","volume":"429","author":"Q Wang","year":"2021","unstructured":"Wang, Q., Hao, Y., Chen, F.: Deepening the IDA* algorithm for knowledge graph reasoning through neural network architecture. Neurocomputing 429, 101\u2013109 (2021)","journal-title":"Neurocomputing"},{"key":"29_CR5","unstructured":"Zhou, R., Hansen, E.A.: Memory-bounded {A*} graph search. In: The Florida AI Research Society Conference (FLAIRS), pp. 203\u2013209 (2002)"},{"key":"29_CR6","unstructured":"Holte, R., Perez, M., Zimmer, R., MacDonald, A.: Hierarchical A*: searching abstraction hierarchies efficiently. In: AAAI\/IAAI, vol. 1, pp. 530\u2013535 (1996)"},{"issue":"2","key":"29_CR7","doi-asserted-by":"publisher","first-page":"1090","DOI":"10.1109\/LRA.2021.3056373","volume":"6","author":"B Liu","year":"2021","unstructured":"Liu, B., Xiao, X., Stone, P.: A lifelong learning approach to mobile robot navigation. IEEE Robot. Autom. Lett. 6(2), 1090\u20131096 (2021)","journal-title":"IEEE Robot. Autom. Lett."},{"key":"29_CR8","doi-asserted-by":"publisher","first-page":"101819","DOI":"10.1016\/j.tre.2019.11.013","volume":"133","author":"BY Chen","year":"2020","unstructured":"Chen, B.Y., Chen, X.W., Chen, H.P., Lam, W.H.: Efficient algorithm for finding k shortest paths based on re-optimization technique. Transp. Res. Part E: Logistics Transp. Rev. 133, 101819 (2020)","journal-title":"Transp. Res. Part E: Logistics Transp. Rev."},{"issue":"1","key":"29_CR9","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1177\/027836498600500106","volume":"5","author":"O Khatib","year":"1986","unstructured":"Khatib, O.: Real-time obstacle avoidance for manipulators and mobile robots. Int. J. Robot. Res. 5(1), 90\u201398 (1986)","journal-title":"Int. J. Robot. Res."},{"key":"29_CR10","unstructured":"Platonov, A.K., Karpov, I.I., Kirilchenko, A.A.: The method of potentials in the problem of laying a route. M.: Preprint of the Institute of Applied Mathematics of the USSR Academy of Sciences, p. 27 (1974). (In Russ)"},{"issue":"11","key":"29_CR11","first-page":"677","volume":"20","author":"AB Filimonov","year":"2019","unstructured":"Filimonov, A.B., Filimonov, N.B.: Issues of motion control of mobile robots based on the potential guidance method. Mechatron. Autom. Control 20(11), 677\u2013685 (2019). (In Russ.)","journal-title":"Mechatron. Autom. Control"},{"issue":"1","key":"29_CR12","first-page":"33","volume":"24","author":"VA Kostyukov","year":"2022","unstructured":"Kostyukov, V.A., Medvedev, M., Pshikhopov, V.H.: Planning the movement of ground robots in an environment with obstacles: an algorithm for constructing smoothed individual trajectories. Mechatron. Autom. Control 24(1), 33\u201345 (2022). (In Russ.)","journal-title":"Mechatron. Autom. Control"},{"key":"29_CR13","unstructured":"Pshikhopov, V.K.H., et al.: Path planning for vehicles operating in uncertain 2D environments. Elsevier, Butterworth-Heinemann, p. 312 (2017)"},{"issue":"5","key":"29_CR14","first-page":"346","volume":"17","author":"V Pshikhopov","year":"2016","unstructured":"Pshikhopov, V., Medvedev, M.: Decentralized management of a group of homogeneous moving objects in a two-dimensional environment with obstacles. Mechatron. Autom. Control 17(5), 346\u2013353 (2016). (In Russ.)","journal-title":"Mechatron. Autom. Control"},{"issue":"60","key":"29_CR15","first-page":"39","volume":"5","author":"V Pshikhopov","year":"2018","unstructured":"Pshikhopov, V., Medvedev, M.: Group control of the movement of mobile robots in an uncertain environment using unstable modes. Comput. Sci. Autom. 5(60), 39\u201363 (2018)","journal-title":"Comput. Sci. Autom."},{"issue":"8","key":"29_CR16","first-page":"470","volume":"21","author":"AR Gaiduk","year":"2020","unstructured":"Gaiduk, A.R., Martyanov, O.V., Medvedev, M., Pshikhopov, V.H., Hamdan, N., Farhud, A.: Neural network control system for a group of robots in an uncertain two-dimensional environment. Mechatron. Autom. Control 21(8), 470\u2013479 (2020). (In Russ.)","journal-title":"Mechatron. Autom. Control"},{"key":"29_CR17","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1016\/j.eswa.2018.08.008","volume":"115","author":"M Nazarahari","year":"2019","unstructured":"Nazarahari, M., Khanmirza, E., Doostie, S.: Multi-objective multi-robot path planning in continuous environment using an enhanced genetic algorithm. Expert Syst. Appl. 115, 106\u2013120 (2019)","journal-title":"Expert Syst. Appl."},{"issue":"3","key":"29_CR18","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1017\/S0263574714000289","volume":"33","author":"M Hoy","year":"2015","unstructured":"Hoy, M., Matveev, A.S., Savkin, A.V.: Algorithms for collision-free navigation of mobile robots in complex cluttered environments: a survey. Robotica 33(3), 463\u2013497 (2015)","journal-title":"Robotica"},{"issue":"1","key":"29_CR19","first-page":"22","volume":"18","author":"NE Shlyakhov","year":"2017","unstructured":"Shlyakhov, N.E., Vatamaniuk, I.V., Ronzhin, A.L.: Review of the methods and algorithms of a robot swarm aggregation. Mechatron. Autom. Control 18(1), 22\u201329 (2017)","journal-title":"Mechatron. Autom. Control"},{"key":"29_CR20","doi-asserted-by":"crossref","unstructured":"Sapronov, L., Lacaze, A.: Path planning for robotic vehicles using generalized Field D. In: Unmanned Systems Technology X, vol. 6962, pp. 447\u2013458. SPIE (2008)","DOI":"10.1117\/12.780650"},{"key":"29_CR21","doi-asserted-by":"crossref","unstructured":"Grigor\u2019ev, M.I., Malozemov, V.N., Sergeev, A.N.: Bernstein polynomials and composite B\u00e9zier curves. Comput. Math. Math. Phys. 46, 1872\u20131881 (2006)","DOI":"10.1134\/S0965542506110042"}],"container-title":["Lecture Notes in Computer Science","Interactive Collaborative Robotics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-43111-1_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,24]],"date-time":"2023-09-24T23:06:43Z","timestamp":1695596803000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-43111-1_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031431104","9783031431111"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-43111-1_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"5 September 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Interactive Collaborative Robotics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Baku","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Azerbaijan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 October 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 October 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icr2023b","order":10,"name":"conference_id","label":"Conference ID","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":"Own system","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"56","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":"33","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":"59% - 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","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","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)"}}]}}