{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T15:10:40Z","timestamp":1742915440007,"version":"3.40.3"},"publisher-location":"Cham","reference-count":12,"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_36","type":"book-chapter","created":{"date-parts":[[2024,2,20]],"date-time":"2024-02-20T07:02:40Z","timestamp":1708412560000},"page":"399-405","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Partition Sampling Strategy for Robot Motion Planning in Narrow Passage Under Uncertainty"],"prefix":"10.1007","author":[{"given":"Binpeng","family":"Wang","sequence":"first","affiliation":[]},{"given":"Zeqiang","family":"Li","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":"36_CR1","doi-asserted-by":"crossref","unstructured":"Hoerger, M., Kurniawati, H.: An on-line POMDP solver for continuous observation spaces. In: 2021 IEEE International Conference on Robotics and Automation (ICRA). IEEE (2021)","DOI":"10.1109\/ICRA48506.2021.9560943"},{"key":"36_CR2","doi-asserted-by":"crossref","unstructured":"Bouton, M., Tumova, J., Kochenderfer, M.J.: Point-based methods for model checking in partially observable Markov decision processes. In: Proceedings of the AAAI Conference on Artificial Intelligence (2020)","DOI":"10.1609\/aaai.v34i06.6563"},{"key":"36_CR3","doi-asserted-by":"crossref","unstructured":"Pilania, V., Gupta, K.: Mobile manipulator planning under uncertainty in unknown environments. Int. J. Robot. Res., 316\u2013339 (2018)","DOI":"10.1177\/0278364918754677"},{"key":"36_CR4","doi-asserted-by":"crossref","unstructured":"Zhou, X., et al.: Online planning for multiagent situational information gathering in the Markov environment. IEEE Syst. J. 14(2), 1798\u20131809 (2019)","DOI":"10.1109\/JSYST.2019.2927245"},{"key":"36_CR5","doi-asserted-by":"crossref","unstructured":"Winterer, L., et al.: Strategy synthesis for POMDPs in robot planning via game-based abstractions. IEEE Trans.  Autom. Control 66(3), 1040\u20131054 (2020)","DOI":"10.1109\/TAC.2020.2990140"},{"key":"36_CR6","doi-asserted-by":"crossref","unstructured":"Xie, R., et al.: Dynamic computation offloading in IoT fog systems with imperfect passage-state information: a POMDP approach. IEEE Internet Things J. 8(1), 345\u2013356 (2020)","DOI":"10.1109\/JIOT.2020.3004223"},{"key":"36_CR7","doi-asserted-by":"crossref","unstructured":"Kaelbling, L.P., Littman, M.L., Cassandra, A.R.:  Planning and acting in partially observable stochastic domains. Artif. Intell. 101(1\u20132), 99\u2013134 (1998)","DOI":"10.1016\/S0004-3702(98)00023-X"},{"key":"36_CR8","unstructured":"Phoka, T., Sudsang, A.: Proceedings of the 2010 IEEE International Conference on Robotics and Automation (2010)"},{"key":"36_CR9","unstructured":"Todorov, E., Li, W.: A generalized iterative LQG method for locally-optimal feedback control of constrained nonlinear stochastic systems. In: Proceedings of the 2005, American Control Conference. IEEE (2005)"},{"key":"36_CR10","doi-asserted-by":"crossref","unstructured":"Yuan, C., et al.: An efficient RRT cache method in dynamic environments for path planning. Robot. Auton. Syst. 131, 103\u2013595 (2020)","DOI":"10.1016\/j.robot.2020.103595"},{"key":"36_CR11","doi-asserted-by":"crossref","unstructured":"Kearns, M., Mansour, Y., Ng, A.Y.: A sparse sampling algorithm for near-optimal planning in large Markov decision processes. Mach. Learn. 49(2), 193\u2013208 (2002)","DOI":"10.1023\/A:1017932429737"},{"key":"36_CR12","doi-asserted-by":"crossref","unstructured":"Luo, Y., et al.: Importance sampling for online planning under uncertainty. Int. J. Robot. Res. 38(2\u20133), 162\u2013181 (2019)","DOI":"10.1177\/0278364918780322"}],"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_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,20]],"date-time":"2024-02-20T07:34:35Z","timestamp":1708414475000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-50580-5_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031505799","9783031505805"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-50580-5_36","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)"}}]}}