{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,23]],"date-time":"2025-05-23T02:12:49Z","timestamp":1747966369952,"version":"3.40.3"},"publisher-location":"Cham","reference-count":32,"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_13","type":"book-chapter","created":{"date-parts":[[2023,9,4]],"date-time":"2023-09-04T11:03:01Z","timestamp":1693825381000},"page":"137-150","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Study of Path Planning Methods in Two-Dimensional Mapped Environments"],"prefix":"10.1007","author":[{"given":"Nizar","family":"Hamdan","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6248-1186","authenticated-orcid":false,"given":"Viacheslav","family":"Pshikhopov","sequence":"additional","affiliation":[]},{"given":"Mikhail","family":"Medvedev","sequence":"additional","affiliation":[]},{"given":"Dimitry","family":"Brosalin","sequence":"additional","affiliation":[]},{"given":"Maria","family":"Vasileva","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6475-8492","authenticated-orcid":false,"given":"Boris","family":"Gurenko","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,9,5]]},"reference":[{"key":"13_CR1","doi-asserted-by":"crossref","unstructured":"LaValle, S.: Planning Algorithms, pp.1\u2013842. Cambridge University Press (2006)","DOI":"10.1017\/CBO9780511546877"},{"issue":"2","key":"13_CR2","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1109\/TC.1983.1676196","volume":"32","author":"T Lozano-Perez","year":"1983","unstructured":"Lozano-Perez, T.: Spatial planning: a configuration space approach. IEEE Trans. Comput. 32(2), 108\u2013120 (1983)","journal-title":"IEEE Trans. Comput."},{"key":"13_CR3","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1109\/TSSC.1968.300136","volume":"2","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. Cybern. 2, 100\u2013107 (1968)","journal-title":"IEEE Trans. Syst. Sci. Cybern."},{"key":"13_CR4","doi-asserted-by":"crossref","unstructured":"Stentz, A.: Optimal and efficient path planning for partially known environments. In: Intelligent Unmanned Ground Vehicles, pp. 203\u2013220. Springer, Boston, MA, USA (1997)","DOI":"10.1007\/978-1-4615-6325-9_11"},{"key":"13_CR5","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":"13_CR6","unstructured":"Zhou, R., Hansen, E.A.: Memory-bounded {A*} graph search. In: The Florida AI Research Society Conference \u2013 FLAIRS, pp. 203\u2013209 (2002)"},{"key":"13_CR7","first-page":"530","volume":"1","author":"R Holte","year":"1996","unstructured":"Holte, R., Perez, M., Zimmer, R., MacDonald, A.: Hierarchical A*: searching abstraction hierarchies efficiently. Proc. Thirteenth Natl. Conf. Artif. Intell. 1, 530\u2013535 (1996)","journal-title":"Proc. Thirteenth Natl. Conf. Artif. Intell."},{"issue":"2","key":"13_CR8","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."},{"issue":"3","key":"13_CR9","first-page":"459","volume":"21","author":"V Pshikhopov","year":"2022","unstructured":"Pshikhopov, V., Medvedev, M., Kostukov, V., Houssein, F., Kadim, A.: Algorithms for trajectory planning in a two-dimensional environment with obstacles. Inf. Autom. 21(3), 459\u2013492 (2022)","journal-title":"Inf. Autom."},{"issue":"2","key":"13_CR10","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1177\/027836498600500106","volume":"5","author":"O Khatib","year":"1986","unstructured":"Khatib, O.: Real-time obstacles avoidance for manipulators and mobile robots. Int. J. Robot. Res. 5(2), 90\u201398 (1986)","journal-title":"Int. J. Robot. Res."},{"key":"13_CR11","unstructured":"Platonov, A., Karpov, I., Kirilchenko, A.: The method of potentials in the laying of the route. M.: Preprint of the Institute of Applied Mathematics of the USSR Academy of Sciences 27 (1974)"},{"key":"13_CR12","unstructured":"Pshikhopov, V.: In: Beloglazov, D., et al.: (eds.) Path Planning for Vehicles Operating in Uncertain 2D Environments, Elsevier, Butterworth-Heinemann, ISBN: 9780128123058, 312 (2017)"},{"issue":"11","key":"13_CR13","doi-asserted-by":"publisher","first-page":"677","DOI":"10.17587\/mau.20.677-685","volume":"20","author":"A Filimonov","year":"2019","unstructured":"Filimonov, A., Filimonov, N.: Issues of motion control of mobile robots by the method of potential guidance. Mekhatronika, Avtomatizatsiya, Upravlenie 20(11), 677\u2013685 (2019)","journal-title":"Mekhatronika, Avtomatizatsiya, Upravlenie"},{"key":"13_CR14","doi-asserted-by":"publisher","first-page":"39","DOI":"10.15622\/sp.60.2","volume":"60","author":"V Pshikhopov","year":"2018","unstructured":"Pshikhopov, V., Medvedev, M.: Group control of the movement of mobile robots in an uncertain environment using unstable regimes. Proc. SPIIRAN 60, 39\u201363 (2018)","journal-title":"Proc. SPIIRAN"},{"issue":"5","key":"13_CR15","doi-asserted-by":"publisher","first-page":"1124","DOI":"10.1109\/TRO.2017.2705034","volume":"33","author":"N Malone","year":"2017","unstructured":"Malone, N., Chiang, H.-T., Lesser, K., Oishi, M., Tapia, L.: Hybrid dynamic moving obstacle avoidance using a stochastic reachable set-based potential field. IEEE Trans. Rob. 33(5), 1124\u20131138 (2017)","journal-title":"IEEE Trans. Rob."},{"issue":"8","key":"13_CR16","first-page":"470","volume":"21","author":"A Gaiduk","year":"2020","unstructured":"Gaiduk, A., Martyanov, O., Medvedev, M., Pshikhopov, V., Hamdan, N., Farkhud, A.: Neural network control system for a group of robots in an unidentified two-dimensional environment. Mechatron., Autom., Control 21(8), 470\u2013479 (2020)","journal-title":"Mechatron., Autom., Control"},{"issue":"2","key":"13_CR17","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1109\/TNNLS.2015.2464314","volume":"27","author":"Y Wang","year":"2016","unstructured":"Wang, Y., Cheng, L., Hou, Z.-G., Yu, J., Tan, M.: Optimal formation of multirobot systems based on a recurrent neural network. IEEE Trans. Neural Netw. Learn. Syst. 27(2), 322\u2013333 (2016)","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"key":"13_CR18","doi-asserted-by":"crossref","unstructured":"De Berg, M., Cheong, O., Van Kreveld, M., Overmars, M.: Computational Geometry: Algorithms and Applications, 3rd edn. Springer-Verlag (2008)","DOI":"10.1007\/978-3-540-77974-2"},{"issue":"1","key":"13_CR19","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1007\/BF01758770","volume":"7","author":"LJ Guibas","year":"1992","unstructured":"Guibas, L.J., Knuth, D.E., Sharir, M.: Randomized incremental construction of delaunay and voronoi diagrams. Algorithmica 7(1), 381\u2013413 (1992)","journal-title":"Algorithmica"},{"key":"13_CR20","unstructured":"LaValle, S.M., Kuffner, J.J.: Rapidly exploring random trees: progress and prospects. In: Workshop on the Algorithmic Foundations of Robotics, pp. 293\u2013308 (2000)"},{"issue":"1","key":"13_CR21","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/BF02187779","volume":"5","author":"K Kedem","year":"1990","unstructured":"Kedem, K., Sharir, M.: An efficient motion planning algorithm for a convex rigid polygonal object in 2-dimensional polygonal space. Discrete Comput. Geom. 5(1), 43\u201375 (1990)","journal-title":"Discrete Comput. Geom."},{"key":"13_CR22","doi-asserted-by":"publisher","first-page":"102887","DOI":"10.1016\/j.apor.2021.102887","volume":"117","author":"W Lee","year":"2021","unstructured":"Lee, W., Choi, G.-H., Kim, T.-W.: Visibility graph-based path-planning algorithm with quadtree representation. Appl. Ocean Res. 117, 102887 (2021)","journal-title":"Appl. Ocean Res."},{"issue":"4","key":"13_CR23","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1109\/70.508439","volume":"12","author":"LE Kavraki","year":"1996","unstructured":"Kavraki, L.E., Svestka, P., Latombe, J.C., Overmars, M.H.: Probabilistic roadmaps for path planning in high-dimensional configuration spaces. IEEE Trans. Robot. Autom. 12(4), 566\u2013580 (1996)","journal-title":"IEEE Trans. Robot. Autom."},{"key":"13_CR24","doi-asserted-by":"crossref","unstructured":"Kamil, A.R.M., Shithil, S.M., Ismail, Z.H., Mahmud, M.S.A., Faudzi, A.A.M.: Path planning based on inflated medial axis and probabilistic roadmap for duct environment. Lecture Notes in Electrical Engineering 834 (2022)","DOI":"10.1007\/978-981-16-8484-5_42"},{"key":"13_CR25","doi-asserted-by":"publisher","first-page":"102196","DOI":"10.1016\/j.rcim.2021.102196","volume":"72","author":"G Chen","year":"2021","unstructured":"Chen, G., Luo, N., Liu, D., Zhao, Z., Liang, Ch.: Path planning for manipulators based on an improved probabilistic roadmap method. Rob. Computer-Integrated Manuf. 72, 102196 (2021)","journal-title":"Rob. Computer-Integrated Manuf."},{"key":"13_CR26","doi-asserted-by":"publisher","first-page":"1079","DOI":"10.1007\/s10514-015-9518-0","volume":"40","author":"A Qureshi","year":"2016","unstructured":"Qureshi, A., Ayaz, Y.: Potential functions-based sampling heuristic for optimal path planning. Auton. Robot 40, 1079\u20131093 (2016)","journal-title":"Auton. Robot"},{"issue":"7","key":"13_CR27","doi-asserted-by":"publisher","first-page":"846","DOI":"10.1177\/0278364911406761","volume":"30","author":"S Karaman","year":"2011","unstructured":"Karaman, S., Frazzoli, E.: Sampling-based algorithms for optimal motion planning. Int. J. Robot. Res. 30(7), 846\u2013894 (2011)","journal-title":"Int. J. Robot. Res."},{"issue":"6","key":"13_CR28","doi-asserted-by":"publisher","first-page":"2568","DOI":"10.1109\/TMECH.2018.2821767","volume":"23","author":"L Chen","year":"2018","unstructured":"Chen, L., Shan, Y., Tian, W., Li, B., Cao, D.: A fast and efficient double-tree RRT\u2217-like sampling-based planner applying on mobile robotic systems. IEEE\/ASME Trans. Mechatron. 23(6), 2568\u20132578 (2018)","journal-title":"IEEE\/ASME Trans. Mechatron."},{"issue":"4","key":"13_CR29","doi-asserted-by":"publisher","first-page":"2063","DOI":"10.1109\/TASE.2020.2987397","volume":"17","author":"J Wang","year":"2020","unstructured":"Wang, J., Meng, M.Q.-H., Khatib, O.: EB-RRT: optimal motion planning for mobile robots. IEEE Trans. Autom. Sci. Eng. 17(4), 2063\u20132073 (2020)","journal-title":"IEEE Trans. Autom. Sci. Eng."},{"key":"13_CR30","doi-asserted-by":"crossref","unstructured":"Medvedev, M., Pshikhopov, V., Gurenko, B., Hamdan, N.: Path planning method for a mobile robot with maneuver restrictions. In: Proceedings of the International Conference on Electrical, Computer, Communications and Mechatronics Engineering (ICECCME) (2021)","DOI":"10.1109\/ICECCME52200.2021.9591090"},{"issue":"3","key":"13_CR31","first-page":"690","volume":"20","author":"V Kostjukov","year":"2021","unstructured":"Kostjukov, V., Medvedev, M., Pshikhopov, V.: Method for optimizing of mobile robot trajectory in repeller sources field. Inf. Autom. 20(3), 690\u2013726 (2021)","journal-title":"Inf. Autom."},{"issue":"11","key":"13_CR32","doi-asserted-by":"publisher","first-page":"2078","DOI":"10.1134\/S0005117920110090","volume":"81","author":"V Pshikhopov","year":"2020","unstructured":"Pshikhopov, V., Medvedev, M.: Multi-loop adaptive control of mobile objects in solving trajectory tracking tasks. Autom. Remote Control 81(11), 2078\u20132093 (2020)","journal-title":"Autom. Remote Control"}],"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_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,24]],"date-time":"2023-09-24T23:05:31Z","timestamp":1695596731000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-43111-1_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031431104","9783031431111"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-43111-1_13","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)"}}]}}