{"id":"https://openalex.org/W2907877782","doi":"https://doi.org/10.1109/icsai.2018.8599478","title":"Mobile robot multi-resolution full coverage path planning algorithm","display_name":"Mobile robot multi-resolution full coverage path planning algorithm","publication_year":2018,"publication_date":"2018-11-01","ids":{"openalex":"https://openalex.org/W2907877782","doi":"https://doi.org/10.1109/icsai.2018.8599478","mag":"2907877782"},"language":"en","primary_location":{"id":"doi:10.1109/icsai.2018.8599478","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icsai.2018.8599478","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 5th International Conference on Systems and Informatics (ICSAI)","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/A5052708136","display_name":"Yunfei Ma","orcid":"https://orcid.org/0000-0002-2528-309X"},"institutions":[{"id":"https://openalex.org/I139759216","display_name":"Beijing University of Posts and Telecommunications","ror":"https://ror.org/04w9fbh59","country_code":"CN","type":"education","lineage":["https://openalex.org/I139759216"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"YunFei Ma","raw_affiliation_strings":["Department of Automation, Beijing University of Posts and Telecommunications, Beijing, China"],"affiliations":[{"raw_affiliation_string":"Department of Automation, Beijing University of Posts and Telecommunications, Beijing, China","institution_ids":["https://openalex.org/I139759216"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100705869","display_name":"Hanxu Sun","orcid":"https://orcid.org/0000-0002-8747-9418"},"institutions":[{"id":"https://openalex.org/I139759216","display_name":"Beijing University of Posts and Telecommunications","ror":"https://ror.org/04w9fbh59","country_code":"CN","type":"education","lineage":["https://openalex.org/I139759216"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Hanxu Sun","raw_affiliation_strings":["Department of Automation, Beijing University of Posts and Telecommunications, Beijing, China"],"affiliations":[{"raw_affiliation_string":"Department of Automation, Beijing University of Posts and Telecommunications, Beijing, China","institution_ids":["https://openalex.org/I139759216"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100714384","display_name":"Ping Ye","orcid":"https://orcid.org/0000-0002-6624-0627"},"institutions":[{"id":"https://openalex.org/I139759216","display_name":"Beijing University of Posts and Telecommunications","ror":"https://ror.org/04w9fbh59","country_code":"CN","type":"education","lineage":["https://openalex.org/I139759216"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Ping Ye","raw_affiliation_strings":["Department of Automation, Beijing University of Posts and Telecommunications, Beijing, China"],"affiliations":[{"raw_affiliation_string":"Department of Automation, Beijing University of Posts and Telecommunications, Beijing, China","institution_ids":["https://openalex.org/I139759216"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100429547","display_name":"Chang Li","orcid":"https://orcid.org/0000-0003-2988-798X"},"institutions":[{"id":"https://openalex.org/I139759216","display_name":"Beijing University of Posts and Telecommunications","ror":"https://ror.org/04w9fbh59","country_code":"CN","type":"education","lineage":["https://openalex.org/I139759216"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Chang Li","raw_affiliation_strings":["Department of Automation, Beijing University of Posts and Telecommunications, Beijing, China"],"affiliations":[{"raw_affiliation_string":"Department of Automation, Beijing University of Posts and Telecommunications, Beijing, China","institution_ids":["https://openalex.org/I139759216"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5052708136"],"corresponding_institution_ids":["https://openalex.org/I139759216"],"apc_list":null,"apc_paid":null,"fwci":0.5223,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.72107974,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"22","issue":null,"first_page":"120","last_page":"125"},"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/T10191","display_name":"Robotics and Sensor-Based Localization","score":0.9969000220298767,"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"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.975600004196167,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"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.7405800223350525},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6963345408439636},{"id":"https://openalex.org/keywords/mobile-robot","display_name":"Mobile robot","score":0.6897169947624207},{"id":"https://openalex.org/keywords/tree-traversal","display_name":"Tree traversal","score":0.6576060652732849},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.5769521594047546},{"id":"https://openalex.org/keywords/grid","display_name":"Grid","score":0.5455306768417358},{"id":"https://openalex.org/keywords/computer-vision","display_name":"Computer vision","score":0.5014142990112305},{"id":"https://openalex.org/keywords/real-time-computing","display_name":"Real-time computing","score":0.4843831956386566},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.4290429353713989},{"id":"https://openalex.org/keywords/raster-graphics","display_name":"Raster graphics","score":0.41564637422561646},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.4088814854621887},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.38066565990448},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.08858489990234375}],"concepts":[{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.7405800223350525},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6963345408439636},{"id":"https://openalex.org/C19966478","wikidata":"https://www.wikidata.org/wiki/Q4810574","display_name":"Mobile robot","level":3,"score":0.6897169947624207},{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.6576060652732849},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.5769521594047546},{"id":"https://openalex.org/C187691185","wikidata":"https://www.wikidata.org/wiki/Q2020720","display_name":"Grid","level":2,"score":0.5455306768417358},{"id":"https://openalex.org/C31972630","wikidata":"https://www.wikidata.org/wiki/Q844240","display_name":"Computer vision","level":1,"score":0.5014142990112305},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.4843831956386566},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.4290429353713989},{"id":"https://openalex.org/C181844469","wikidata":"https://www.wikidata.org/wiki/Q182270","display_name":"Raster graphics","level":2,"score":0.41564637422561646},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.4088814854621887},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38066565990448},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.08858489990234375},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"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.1109/icsai.2018.8599478","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icsai.2018.8599478","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 5th International Conference on Systems and Informatics (ICSAI)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":6,"referenced_works":["https://openalex.org/W2019738489","https://openalex.org/W2104683527","https://openalex.org/W2159772324","https://openalex.org/W2166177494","https://openalex.org/W2408002876","https://openalex.org/W2553326346"],"related_works":["https://openalex.org/W170547082","https://openalex.org/W2990193004","https://openalex.org/W1904098742","https://openalex.org/W3158921809","https://openalex.org/W2161428574","https://openalex.org/W2077416514","https://openalex.org/W2618632915","https://openalex.org/W4292862729","https://openalex.org/W2150982344","https://openalex.org/W2157678966"],"abstract_inverted_index":{"The":[0,231],"mobile":[1,27,70,96,174],"robot":[2,28,97,124,175],"can":[3,108,148,176,183],"independently":[4],"run":[5],"the":[6,15,35,62,75,87,131,142,155,168,172,179,185,196,223,234,237,241,246,250,256,268],"core":[7],"as":[8,134,136],"SLAM":[9],"and":[10,55,119,123,152,158,190,209,218,229],"path":[11,53,65,83,100],"planning":[12,66,84,101],"[1].":[13],"In":[14,86,195,249],"grid":[16,49,79,89,225],"method":[17],"drawing,":[18],"high-precision":[19,78],"positioning":[20],"requires":[21],"a":[22,26,30,47,56,95],"high-resolution":[23],"grid.":[24],"When":[25,128],"covers":[29],"certain":[31],"working":[32],"area,":[33],"since":[34],"coverage":[36,44,64,99,228,263],"width":[37],"is":[38,45,50,253],"constant":[39],"each":[40],"time,":[41],"when":[42],"high-efficiency":[43],"required,":[46],"low-resolution":[48,81],"required":[51],"for":[52],"planning,":[54],"multi-resolution":[57,69],"raster":[58,82],"problem":[59,67],"occurs.":[60],"For":[61],"full":[63,98],"of":[68,77,170,198,233,239,258],"robots,":[71],"this":[72,92,259],"paper":[73,93,114,214,260],"proposes":[74],"use":[76],"positioning,":[80],"coverage.":[85],"normal":[88],"traversal":[90],"process,":[91],"adopts":[94],"algorithm":[102,143,257],"based":[103],"on":[104],"bio-excitation":[105],"network,":[106],"which":[107],"be":[109,161],"autonomous":[110],"exploration":[111],"traversal.":[112],"This":[113,213],"actually":[115],"models":[116],"its":[117],"algorithm,":[118],"increases":[120],"direction":[121],"guidance":[122],"into":[125],"dead":[126,132,156],"zone.":[127],"escaping":[129],"from":[130,154],"zone":[133],"soon":[135],"possible":[137],"according":[138],"to":[139,201,221,226],"greedy":[140],"thoughts,":[141],"has":[144,191,261],"good":[145],"real-time":[146],"performance,":[147],"automatically":[149],"avoid":[150],"obstacles":[151,208],"escape":[153],"zone,":[157],"there":[159,204],"will":[160],"no":[162],"large-scale":[163],"folding":[164],"back.":[165],"Especially":[166],"in":[167],"field":[169],"cleaning,":[171],"follow-on":[173],"effectively":[177],"clean":[178],"narrow":[180],"area.":[181],"It":[182],"make":[184],"cleaning":[186,193],"car":[187],"recycle":[188],"garbage":[189],"high":[192,199],"efficiency.":[194,230],"process":[197],"resolution":[200],"low":[202],"resolution,":[203],"are":[205],"both":[206],"moving":[207],"movable":[210],"motion":[211,224],"grids.":[212],"uses":[215],"quadtree":[216],"segmentation":[217],"Hilbert":[219],"curve":[220],"traverse":[222],"improve":[227],"edge":[232],"rule":[235],"explores":[236],"purpose":[238],"reciprocating":[240,245],"entire":[242],"region":[243],"by":[244,265],"unknown":[247],"environment.":[248],"experiment,":[251],"it":[252],"proved":[254],"that":[255],"higher":[262],"efficiency":[264],"comparing":[266],"with":[267],"original":[269],"biological":[270],"excitation":[271],"network":[272],"algorithm.":[273]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}