{"id":"https://openalex.org/W3008120012","doi":"https://doi.org/10.1109/ssci44817.2019.9002747","title":"Robot Path Planning Based on Freeman Direction Chain Code","display_name":"Robot Path Planning Based on Freeman Direction Chain Code","publication_year":2019,"publication_date":"2019-12-01","ids":{"openalex":"https://openalex.org/W3008120012","doi":"https://doi.org/10.1109/ssci44817.2019.9002747","mag":"3008120012"},"language":"en","primary_location":{"id":"doi:10.1109/ssci44817.2019.9002747","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ssci44817.2019.9002747","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 IEEE Symposium Series on Computational Intelligence (SSCI)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5103196715","display_name":"Meng Zhao","orcid":"https://orcid.org/0000-0002-9725-6525"},"institutions":[{"id":"https://openalex.org/I82880672","display_name":"Beihang University","ror":"https://ror.org/00wk2mp56","country_code":"CN","type":"education","lineage":["https://openalex.org/I82880672"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Meng Zhao","raw_affiliation_strings":["School of Electronic and Information Engineering, Beihang University, Beijing, P. R. China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Electronic and Information Engineering, Beihang University, Beijing, P. R. China","institution_ids":["https://openalex.org/I82880672"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5047518945","display_name":"Hui Lu","orcid":"https://orcid.org/0000-0001-9455-4597"},"institutions":[{"id":"https://openalex.org/I82880672","display_name":"Beihang University","ror":"https://ror.org/00wk2mp56","country_code":"CN","type":"education","lineage":["https://openalex.org/I82880672"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Hui Lu","raw_affiliation_strings":["School of Electronic and Information Engineering, Beihang University, Beijing, P. R. China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Electronic and Information Engineering, Beihang University, Beijing, P. R. China","institution_ids":["https://openalex.org/I82880672"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I82880672"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.20796111,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"24","issue":null,"first_page":"1967","last_page":"1973"},"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.9919999837875366,"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.9919999837875366,"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.8191282153129578},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.6816765069961548},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6601203680038452},{"id":"https://openalex.org/keywords/any-angle-path-planning","display_name":"Any-angle path planning","score":0.6135067939758301},{"id":"https://openalex.org/keywords/obstacle","display_name":"Obstacle","score":0.5900495052337646},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5776515007019043},{"id":"https://openalex.org/keywords/grid-reference","display_name":"Grid reference","score":0.48325806856155396},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.47015905380249023},{"id":"https://openalex.org/keywords/redundancy","display_name":"Redundancy (engineering)","score":0.46583643555641174},{"id":"https://openalex.org/keywords/grid","display_name":"Grid","score":0.4271542429924011},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.42059215903282166},{"id":"https://openalex.org/keywords/mobile-robot","display_name":"Mobile robot","score":0.3896143436431885},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3685459494590759},{"id":"https://openalex.org/keywords/real-time-computing","display_name":"Real-time computing","score":0.3323838412761688},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.3251088261604309},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1160113513469696}],"concepts":[{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.8191282153129578},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.6816765069961548},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6601203680038452},{"id":"https://openalex.org/C158485040","wikidata":"https://www.wikidata.org/wiki/Q4778119","display_name":"Any-angle path planning","level":4,"score":0.6135067939758301},{"id":"https://openalex.org/C2776650193","wikidata":"https://www.wikidata.org/wiki/Q264661","display_name":"Obstacle","level":2,"score":0.5900495052337646},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5776515007019043},{"id":"https://openalex.org/C156172958","wikidata":"https://www.wikidata.org/wiki/Q3438407","display_name":"Grid reference","level":4,"score":0.48325806856155396},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.47015905380249023},{"id":"https://openalex.org/C152124472","wikidata":"https://www.wikidata.org/wiki/Q1204361","display_name":"Redundancy (engineering)","level":2,"score":0.46583643555641174},{"id":"https://openalex.org/C187691185","wikidata":"https://www.wikidata.org/wiki/Q2020720","display_name":"Grid","level":2,"score":0.4271542429924011},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.42059215903282166},{"id":"https://openalex.org/C19966478","wikidata":"https://www.wikidata.org/wiki/Q4810574","display_name":"Mobile robot","level":3,"score":0.3896143436431885},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3685459494590759},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.3323838412761688},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3251088261604309},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1160113513469696},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.0},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"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/ssci44817.2019.9002747","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ssci44817.2019.9002747","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 IEEE Symposium Series on Computational Intelligence (SSCI)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","score":0.7300000190734863,"id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W1969483458","https://openalex.org/W2007572995","https://openalex.org/W2014007173","https://openalex.org/W2085492522","https://openalex.org/W2145089737","https://openalex.org/W2145602088","https://openalex.org/W2169528473","https://openalex.org/W2553594015","https://openalex.org/W2887439418","https://openalex.org/W4253920039"],"related_works":["https://openalex.org/W2368795992","https://openalex.org/W2394276631","https://openalex.org/W2007857089","https://openalex.org/W2125569607","https://openalex.org/W2084091668","https://openalex.org/W3117322459","https://openalex.org/W2953072111","https://openalex.org/W4383333717","https://openalex.org/W4313270149","https://openalex.org/W2786330942"],"abstract_inverted_index":{"Path":[0],"planning":[1,43,171,184],"is":[2,15,61,71,95],"one":[3],"of":[4,55,81,90,155,177],"the":[5,29,66,77,82,85,91,102,115,121,131,139,153,162,169,175,178],"key":[6],"technologies":[7],"for":[8,46],"robots":[9,140],"to":[10,17,27,73,114,135],"achieve":[11],"autonomous":[12],"movement,":[13],"which":[14,65,98,180],"critical":[16],"realize":[18],"intelligent":[19],"operation.":[20],"When":[21],"facing":[22],"complex":[23,187],"environment,":[24],"in":[25,64,84,105,125,165,186],"order":[26],"plan":[28],"path":[30,42,96,127,170,183],"as":[31,33],"soon":[32],"possible,":[34],"we":[35,129],"propose":[36],"a":[37,110],"Freeman":[38,67,116,156],"direction":[39,68,80,117,157],"chain":[40,69,118,158],"code":[41,70,119,159],"(FDCC-PP)":[44],"algorithm":[45,53,94],"single":[47],"and":[48,79,108,167],"multi-robot":[49,126],"systems.":[50],"The":[51,58,87,146],"FDCC-PP":[52],"consists":[54],"two":[56],"processes.":[57],"first":[59],"process":[60,89],"map":[62],"processing,":[63],"adopted":[72],"extract":[74],"information":[75],"about":[76],"position":[78],"obstacles":[83],"map.":[86],"second":[88],"FDCC-":[92],"PP":[93],"planning,":[97,128],"includes":[99],"moving":[100],"toward":[101],"target":[103],"point":[104],"free":[106],"space":[107,166],"making":[109],"fast":[111,182],"detour":[112],"according":[113],"near":[120],"obstacle.":[122],"In":[123],"addition,":[124],"introduce":[130],"grid-":[132],"dominant":[133],"principle":[134],"handle":[136],"collisions":[137],"when":[138],"move":[141],"along":[142],"their":[143],"planned":[144],"paths.":[145],"comparison":[147],"with":[148],"other":[149],"algorithms":[150],"shows":[151],"that":[152],"introduction":[154],"can":[160],"reduce":[161],"search":[163],"redundancy":[164],"shorten":[168],"time":[172],"without":[173],"sacrificing":[174],"safety":[176],"robot,":[179],"makes":[181],"possible":[185],"environment.":[188]},"counts_by_year":[],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}