{"id":"https://openalex.org/W3004101436","doi":"https://doi.org/10.1145/3375998.3376010","title":"Indoor Robot Path Planning Based on an Improved Probabilistic Road Map Method","display_name":"Indoor Robot Path Planning Based on an Improved Probabilistic Road Map Method","publication_year":2019,"publication_date":"2019-12-13","ids":{"openalex":"https://openalex.org/W3004101436","doi":"https://doi.org/10.1145/3375998.3376010","mag":"3004101436"},"language":"en","primary_location":{"id":"doi:10.1145/3375998.3376010","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3375998.3376010","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2019 8th International Conference on Networks, Communication and Computing","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5054739917","display_name":"Jinfeng Lv","orcid":null},"institutions":[{"id":"https://openalex.org/I167383011","display_name":"Henan University of Science and Technology","ror":"https://ror.org/05d80kz58","country_code":"CN","type":"education","lineage":["https://openalex.org/I167383011"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Lv Jinfeng","raw_affiliation_strings":["Henan University of Science and Technology, School of Information Engineering, Luoyang"],"affiliations":[{"raw_affiliation_string":"Henan University of Science and Technology, School of Information Engineering, Luoyang","institution_ids":["https://openalex.org/I167383011"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5038424649","display_name":"Jianwei Ma","orcid":"https://orcid.org/0000-0003-4069-8880"},"institutions":[{"id":"https://openalex.org/I167383011","display_name":"Henan University of Science and Technology","ror":"https://ror.org/05d80kz58","country_code":"CN","type":"education","lineage":["https://openalex.org/I167383011"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Ma Jianwei","raw_affiliation_strings":["Henan University of Science and Technology, School of Information Engineering, Luoyang"],"affiliations":[{"raw_affiliation_string":"Henan University of Science and Technology, School of Information Engineering, Luoyang","institution_ids":["https://openalex.org/I167383011"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5020895015","display_name":"Xiaojing Li","orcid":"https://orcid.org/0000-0002-2197-4678"},"institutions":[{"id":"https://openalex.org/I167383011","display_name":"Henan University of Science and Technology","ror":"https://ror.org/05d80kz58","country_code":"CN","type":"education","lineage":["https://openalex.org/I167383011"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Li Xiaojing","raw_affiliation_strings":["Henan University of Science and Technology, School of Information Engineering, Luoyang"],"affiliations":[{"raw_affiliation_string":"Henan University of Science and Technology, School of Information Engineering, Luoyang","institution_ids":["https://openalex.org/I167383011"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5054739917"],"corresponding_institution_ids":["https://openalex.org/I167383011"],"apc_list":null,"apc_paid":null,"fwci":0.1012,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.47544126,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"244","last_page":"247"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11500","display_name":"Evacuation and Crowd Dynamics","score":0.9793999791145325,"subfield":{"id":"https://openalex.org/subfields/2212","display_name":"Ocean Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10191","display_name":"Robotics and Sensor-Based Localization","score":0.9519000053405762,"subfield":{"id":"https://openalex.org/subfields/2202","display_name":"Aerospace Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.7817443609237671},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.7518428564071655},{"id":"https://openalex.org/keywords/probabilistic-roadmap","display_name":"Probabilistic roadmap","score":0.7401340007781982},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7016144394874573},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.6145731210708618},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.5713618993759155},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.5572258234024048},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.49208492040634155},{"id":"https://openalex.org/keywords/inflection-point","display_name":"Inflection point","score":0.48674750328063965},{"id":"https://openalex.org/keywords/mobile-robot","display_name":"Mobile robot","score":0.45146819949150085},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.3439958989620209},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.16550087928771973},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.09883835911750793},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.09227678179740906},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.05810394883155823}],"concepts":[{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.7817443609237671},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.7518428564071655},{"id":"https://openalex.org/C2778803389","wikidata":"https://www.wikidata.org/wiki/Q7246866","display_name":"Probabilistic roadmap","level":4,"score":0.7401340007781982},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7016144394874573},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6145731210708618},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.5713618993759155},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.5572258234024048},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.49208492040634155},{"id":"https://openalex.org/C74545648","wikidata":"https://www.wikidata.org/wiki/Q212794","display_name":"Inflection point","level":2,"score":0.48674750328063965},{"id":"https://openalex.org/C19966478","wikidata":"https://www.wikidata.org/wiki/Q4810574","display_name":"Mobile robot","level":3,"score":0.45146819949150085},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3439958989620209},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.16550087928771973},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.09883835911750793},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.09227678179740906},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.05810394883155823},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3375998.3376010","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3375998.3376010","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2019 8th International Conference on Networks, Communication and Computing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","score":0.8100000023841858,"display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W1993262167","https://openalex.org/W1995965025","https://openalex.org/W2242461718","https://openalex.org/W2559131545","https://openalex.org/W2604760770","https://openalex.org/W2612102354","https://openalex.org/W4301859936"],"related_works":["https://openalex.org/W2107702345","https://openalex.org/W2137520303","https://openalex.org/W1536392978","https://openalex.org/W2216928063","https://openalex.org/W2389713625","https://openalex.org/W4308217561","https://openalex.org/W1904098742","https://openalex.org/W2134348961","https://openalex.org/W3158921809","https://openalex.org/W2115192598"],"abstract_inverted_index":{"Aiming":[0],"at":[1],"indoor":[2],"robot":[3],"path":[4,104],"planning,":[5],"an":[6],"improved":[7,108],"probabilistic":[8,109],"road":[9,110],"map":[10,31,111],"method":[11,23,112],"is":[12,91],"proposed":[13,22],"to":[14,59],"decide":[15],"feasible":[16],"routes":[17,44,117],"for":[18],"robots.":[19],"Firstly,":[20],"the":[21,27,30,69,78,81,85,94,107],"sets":[24],"nodes":[25,66,70],"around":[26],"obstacles":[28,51],"on":[29],"randomly.":[32],"By":[33],"connecting":[34],"starting":[35,72],"point,":[36,40],"nodes,":[37],"and":[38,67,74,84,119],"ending":[39,75],"multi":[41],"alternative":[42],"practical":[43],"which":[45],"are":[46],"not":[47],"in":[48],"collision":[49],"with":[50,80,102],"can":[52,113],"be":[53],"acquired.":[54],"Secondly,":[55],"this":[56],"paper":[57],"tries":[58],"optimize":[60],"a":[61],"route":[62,79],"by":[63],"eliminating":[64],"unnecessary":[65],"repositioning":[68],"between":[71],"point":[73],"point.":[76],"Finally,":[77],"shortest":[82],"distance":[83],"minimum":[86],"number":[87],"of":[88],"inflection":[89],"points":[90],"chosen":[92],"as":[93],"best":[95],"route.":[96],"Experimental":[97],"results":[98],"show":[99],"that,":[100],"compared":[101],"other":[103],"planning":[105],"methods,":[106],"generate":[114],"high":[115],"quality":[116],"rapidly":[118],"stably.":[120]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}