{"id":"https://openalex.org/W2537357172","doi":"https://doi.org/10.1109/fgct.2016.7605068","title":"Using ABC and RRT algorithms to improve mobile robot path planning with danger degree","display_name":"Using ABC and RRT algorithms to improve mobile robot path planning with danger degree","publication_year":2016,"publication_date":"2016-08-01","ids":{"openalex":"https://openalex.org/W2537357172","doi":"https://doi.org/10.1109/fgct.2016.7605068","mag":"2537357172"},"language":"en","primary_location":{"id":"doi:10.1109/fgct.2016.7605068","is_oa":false,"landing_page_url":"https://doi.org/10.1109/fgct.2016.7605068","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 Fifth International Conference on Future Generation Communication Technologies (FGCT)","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/A5043687428","display_name":"Yue Tusi","orcid":null},"institutions":[{"id":"https://openalex.org/I22265921","display_name":"National Central University","ror":"https://ror.org/00944ve71","country_code":"TW","type":"education","lineage":["https://openalex.org/I22265921"]}],"countries":["TW"],"is_corresponding":true,"raw_author_name":"Yue Tusi","raw_affiliation_strings":["Department of Electrical Engineering, National Central University, Taoyuan, Taiwan, R.O.C"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, National Central University, Taoyuan, Taiwan, R.O.C","institution_ids":["https://openalex.org/I22265921"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5103472838","display_name":"Hung\u2010Yuan Chung","orcid":null},"institutions":[{"id":"https://openalex.org/I22265921","display_name":"National Central University","ror":"https://ror.org/00944ve71","country_code":"TW","type":"education","lineage":["https://openalex.org/I22265921"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Hung-Yuan Chung","raw_affiliation_strings":["Department of Electrical Engineering, National Central University, Taoyuan, Taiwan, R.O.C"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, National Central University, Taoyuan, Taiwan, R.O.C","institution_ids":["https://openalex.org/I22265921"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5043687428"],"corresponding_institution_ids":["https://openalex.org/I22265921"],"apc_list":null,"apc_paid":null,"fwci":2.9993,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":{"value":0.92952963,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"8","issue":null,"first_page":"21","last_page":"26"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9970999956130981,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9970999956130981,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9957000017166138,"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/T11574","display_name":"Artificial Intelligence in Games","score":0.9761000275611877,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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.7610142230987549},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.668075680732727},{"id":"https://openalex.org/keywords/mobile-robot","display_name":"Mobile robot","score":0.6657869219779968},{"id":"https://openalex.org/keywords/random-tree","display_name":"Random tree","score":0.658221423625946},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.6100181937217712},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6047340631484985},{"id":"https://openalex.org/keywords/artificial-bee-colony-algorithm","display_name":"Artificial bee colony algorithm","score":0.6047308444976807},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5793662071228027},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.5660030841827393},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.5375468730926514},{"id":"https://openalex.org/keywords/start-point","display_name":"Start point","score":0.46890580654144287},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.44752347469329834},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.42066141963005066},{"id":"https://openalex.org/keywords/algorithm-design","display_name":"Algorithm design","score":0.4108423888683319},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.38377436995506287},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.18760865926742554},{"id":"https://openalex.org/keywords/real-time-computing","display_name":"Real-time computing","score":0.12483051419258118}],"concepts":[{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.7610142230987549},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.668075680732727},{"id":"https://openalex.org/C19966478","wikidata":"https://www.wikidata.org/wiki/Q4810574","display_name":"Mobile robot","level":3,"score":0.6657869219779968},{"id":"https://openalex.org/C2776839635","wikidata":"https://www.wikidata.org/wiki/Q14942679","display_name":"Random tree","level":4,"score":0.658221423625946},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.6100181937217712},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6047340631484985},{"id":"https://openalex.org/C97133563","wikidata":"https://www.wikidata.org/wiki/Q4801057","display_name":"Artificial bee colony algorithm","level":2,"score":0.6047308444976807},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5793662071228027},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.5660030841827393},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.5375468730926514},{"id":"https://openalex.org/C2779859299","wikidata":"https://www.wikidata.org/wiki/Q7602527","display_name":"Start point","level":3,"score":0.46890580654144287},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.44752347469329834},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.42066141963005066},{"id":"https://openalex.org/C106516650","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm design","level":2,"score":0.4108423888683319},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.38377436995506287},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.18760865926742554},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.12483051419258118},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C2987804222","wikidata":"https://www.wikidata.org/wiki/Q5376582","display_name":"End point","level":2,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"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/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/fgct.2016.7605068","is_oa":false,"landing_page_url":"https://doi.org/10.1109/fgct.2016.7605068","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 Fifth International Conference on Future Generation Communication Technologies (FGCT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","score":0.5699999928474426,"display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W1982582808","https://openalex.org/W1995589365","https://openalex.org/W2057170348","https://openalex.org/W2070468430","https://openalex.org/W2117286520","https://openalex.org/W2143506602","https://openalex.org/W2164203504"],"related_works":["https://openalex.org/W1991478428","https://openalex.org/W1987694097","https://openalex.org/W3158818664","https://openalex.org/W2797949337","https://openalex.org/W2863424594","https://openalex.org/W2372633663","https://openalex.org/W4388720133","https://openalex.org/W2564325388","https://openalex.org/W2108906364","https://openalex.org/W2914610299"],"abstract_inverted_index":{"For":[0],"mobile":[1],"robots,":[2],"being":[3],"able":[4,123],"to":[5,18,61,66,92,102,116,124],"find":[6,93],"a":[7,41,48,63],"suitable":[8],"route":[9],"through":[10],"an":[11],"environment":[12],"filled":[13],"with":[14,76,176,188],"varied":[15],"obstacles,":[16],"and":[17,40,56,118,131,180],"ensure":[19],"that":[20],"they":[21],"can":[22],"successfully":[23],"reach":[24],"their":[25],"target":[26],"point":[27,31,101],"from":[28],"the":[29,33,77,89,98,104,107,126,152,168,171,177,182],"starting":[30],"in":[32,134,139,149],"most":[34],"efficient":[35],"manner":[36],"is":[37,73,112,122,156,159],"very":[38],"important,":[39],"necessary":[42],"research":[43],"topic.":[44],"This":[45,71],"article":[46],"proposes":[47],"combination":[49],"of":[50,128,151,170,184],"Artificial":[51,108],"Bee":[52,109],"Colony":[53,110],"Algorithm":[54],"(ABC)":[55],"Rapidly-Exploring":[57],"Random":[58],"Tree":[59],"(RRT)":[60],"produce":[62],"novel":[64],"algorithm":[65,72,91,111,175],"meet":[67],"these":[68],"navigation":[69],"requirements.":[70],"then":[74],"compared":[75],"traditional":[78],"ABC":[79],"for":[80,161],"path":[81,141,186],"planning.":[82,163],"Unlike":[83],"previous":[84,140],"algorithms,":[85,179],"this":[86,165],"study":[87],"uses":[88],"RRT":[90,145,178],"several":[94],"extend":[95,100],"points,":[96],"choose":[97],"best":[99],"move":[103],"bees.":[105],"Because":[106],"simply":[113],"structured,":[114],"easy":[115,132],"operate":[117],"quickly":[119],"converges,":[120],"it":[121,158],"address":[125],"problems":[127],"slow":[129],"convergence":[130],"entrapment":[133],"local":[135],"optimal":[136],"solutions":[137],"encountered":[138],"planning":[142],"algorithms.":[143],"Although":[144],"has":[146],"excellent":[147],"characteristics":[148,169],"terms":[150],"search":[153],"area":[154],"which":[155],"unknown,":[157],"unstable":[160],"each":[162],"Thus,":[164],"thesis":[166],"combines":[167],"artificial":[172],"bee":[173],"colony":[174],"considers":[181],"problem":[183],"robot":[185],"simulation":[187],"obstacles.":[189]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}