{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,9]],"date-time":"2025-04-09T18:26:07Z","timestamp":1744223167553,"version":"3.40.3"},"publisher-location":"Cham","reference-count":11,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031505799"},{"type":"electronic","value":"9783031505805"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-50580-5_35","type":"book-chapter","created":{"date-parts":[[2024,2,20]],"date-time":"2024-02-20T07:02:40Z","timestamp":1708412560000},"page":"392-398","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Optimization of Probabilistic Roadmap Based on Two-Dimensional Static Environment"],"prefix":"10.1007","author":[{"given":"Binpeng","family":"Wang","sequence":"first","affiliation":[]},{"given":"Houqin","family":"Huang","sequence":"additional","affiliation":[]},{"given":"Lin","family":"Sun","sequence":"additional","affiliation":[]},{"given":"Chao","family":"Feng","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,2,21]]},"reference":[{"key":"35_CR1","doi-asserted-by":"publisher","unstructured":"Nannicini, G., Delling, D., Liberti, L., Schultes, D.: Bidirectional\u00a0A*\u00a0search for time-dependent fast paths. In: McGeoch, C.C. (ed.) WEA 2008. LNCS, vol. 5038, pp. 334\u2013346. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-68552-4_25","DOI":"10.1007\/978-3-540-68552-4_25"},{"key":"35_CR2","doi-asserted-by":"crossref","unstructured":"Ma\u2019Arif, A., Rahmaniar, W., Vera, M.A.M., et al.: Artificial potential field algorithm for obstacle avoidance in UAV quadrotor for dynamic environment. In: 2021 IEEE International Conference on Communication, Networks and Satellite (COMNETSAT), pp. 184\u2013189. IEEE (2021)","DOI":"10.1109\/COMNETSAT53002.2021.9530803"},{"key":"35_CR3","doi-asserted-by":"crossref","unstructured":"Zeng, N., Zhang, H., Chen, Y., et al.: Path planning for intelligent robot based on switching local evolutionary PSO algorithm. Assem. Autom. (2016)","DOI":"10.1108\/AA-10-2015-079"},{"key":"35_CR4","doi-asserted-by":"crossref","unstructured":"Brand, M., Masuda, M., Wehner, N., et al.: Ant colony optimization algorithm for robot path planning. In: 2010 International Conference on Computer Design and Applications, vol. 3, pp. V3-436\u2013V3-440. IEEE (2010)","DOI":"10.1109\/ICCDA.2010.5541300"},{"key":"35_CR5","unstructured":"Goldberg, D.E.: Genetic algorithms in search, optimization, and machine learning. Queen\u2019s University Belfast (2010)"},{"issue":"2","key":"35_CR6","doi-asserted-by":"publisher","first-page":"571","DOI":"10.3390\/s18020571","volume":"18","author":"K Wei","year":"2018","unstructured":"Wei, K., Ren, B.: A method on dynamic path planning for robotic manipulator autonomous obstacle avoidance based on an improved RRT algorithm. Sensors 18(2), 571 (2018)","journal-title":"Sensors"},{"issue":"4","key":"35_CR7","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":"35_CR8","doi-asserted-by":"crossref","unstructured":"Mohanta, J.C., Keshari, A.: A knowledge based fuzzy-probabilistic roadmap method for mobile robot navigation. Appl. Soft Comput. 79, 391\u2013409 (2019)","DOI":"10.1016\/j.asoc.2019.03.055"},{"key":"35_CR9","doi-asserted-by":"crossref","unstructured":"Hsu, D., Latombe: On the probabilistic foundations of probabilistic roadmap planning. Int. J. Robot. Res. (2006)","DOI":"10.1007\/978-3-540-48113-3_8"},{"key":"35_CR10","doi-asserted-by":"crossref","unstructured":"Ram, P., Sinha, K.: Revisiting kd-tree for nearest neighbor search. In: Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, pp. 1378\u20131388 (2019)","DOI":"10.1145\/3292500.3330875"},{"issue":"2","key":"35_CR11","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/0010-4485(83)90171-9","volume":"15","author":"G Farin","year":"1983","unstructured":"Farin, G.: Algorithms for rational B\u00e9zier curves. Comput. Aided Des. 15(2), 73\u201377 (1983)","journal-title":"Comput. Aided Des."}],"container-title":["Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering","Multimedia Technology and Enhanced Learning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-50580-5_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,20]],"date-time":"2024-02-20T07:34:27Z","timestamp":1708414467000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-50580-5_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031505799","9783031505805"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-50580-5_35","relation":{},"ISSN":["1867-8211","1867-822X"],"issn-type":[{"type":"print","value":"1867-8211"},{"type":"electronic","value":"1867-822X"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"21 February 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICMTEL","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Multimedia Technology and Enhanced Learning","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Leicester","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","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":"28 April 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 April 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icmtel2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/icmtel.eai-conferences.org\/2023\/","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":"Confy Plus","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"285","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":"121","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":"42% - 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":"6.5","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}