{"id":"https://openalex.org/W4391584707","doi":"https://doi.org/10.1109/dessert61349.2023.10416444","title":"A Bresenham-based Global Path Planning Algorithm on Grid Maps","display_name":"A Bresenham-based Global Path Planning Algorithm on Grid Maps","publication_year":2023,"publication_date":"2023-10-13","ids":{"openalex":"https://openalex.org/W4391584707","doi":"https://doi.org/10.1109/dessert61349.2023.10416444"},"language":"en","primary_location":{"id":"doi:10.1109/dessert61349.2023.10416444","is_oa":false,"landing_page_url":"https://doi.org/10.1109/dessert61349.2023.10416444","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2023 13th International Conference on Dependable Systems, Services and Technologies (DESSERT)","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/A5018797402","display_name":"Artem Velikzhanin","orcid":"https://orcid.org/0000-0001-6389-9605"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Artem Velikzhanin","raw_affiliation_strings":["iSolutions Labs,Sunderland,United Kingdom","iSolutions Labs, Sunderland, United Kingdom"],"affiliations":[{"raw_affiliation_string":"iSolutions Labs,Sunderland,United Kingdom","institution_ids":[]},{"raw_affiliation_string":"iSolutions Labs, Sunderland, United Kingdom","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5068827483","display_name":"Inna Skarga-Bandurova","orcid":"https://orcid.org/0000-0003-3458-8730"},"institutions":[{"id":"https://openalex.org/I124261462","display_name":"Oxford Brookes University","ror":"https://ror.org/04v2twj65","country_code":"GB","type":"education","lineage":["https://openalex.org/I124261462"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Inna Skarga-Bandurova","raw_affiliation_strings":["Oxford Brookes University,School of Engineering, Computing and Mathematics,Oxford,United Kingdom","School of Engineering, Computing and Mathematics, Oxford Brookes University, Oxford, United Kingdom"],"affiliations":[{"raw_affiliation_string":"Oxford Brookes University,School of Engineering, Computing and Mathematics,Oxford,United Kingdom","institution_ids":["https://openalex.org/I124261462"]},{"raw_affiliation_string":"School of Engineering, Computing and Mathematics, Oxford Brookes University, Oxford, United Kingdom","institution_ids":["https://openalex.org/I124261462"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5018797402"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.4846,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.67081176,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":95,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"8"},"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/T11615","display_name":"Control and Dynamics of Mobile Robots","score":0.9829999804496765,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems 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.9807999730110168,"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/computer-science","display_name":"Computer science","score":0.7539862394332886},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.6001933813095093},{"id":"https://openalex.org/keywords/grid","display_name":"Grid","score":0.5948739647865295},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5173230171203613},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.43156546354293823},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.3528395891189575},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.31310319900512695},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.10168963670730591},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.05825322866439819}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7539862394332886},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.6001933813095093},{"id":"https://openalex.org/C187691185","wikidata":"https://www.wikidata.org/wiki/Q2020720","display_name":"Grid","level":2,"score":0.5948739647865295},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5173230171203613},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.43156546354293823},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3528395891189575},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.31310319900512695},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.10168963670730591},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.05825322866439819},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"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/dessert61349.2023.10416444","is_oa":false,"landing_page_url":"https://doi.org/10.1109/dessert61349.2023.10416444","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2023 13th International Conference on Dependable Systems, Services and Technologies (DESSERT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","score":0.49000000953674316,"display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W1997872704","https://openalex.org/W1998813085","https://openalex.org/W2001804342","https://openalex.org/W2098412395","https://openalex.org/W2101502731","https://openalex.org/W2109994478","https://openalex.org/W2154984757","https://openalex.org/W2176797328","https://openalex.org/W2179763623","https://openalex.org/W2731220090","https://openalex.org/W2889315996","https://openalex.org/W2942307437","https://openalex.org/W2969897047","https://openalex.org/W3182196489","https://openalex.org/W3216132981","https://openalex.org/W3217170181","https://openalex.org/W4294030615","https://openalex.org/W6764038658"],"related_works":["https://openalex.org/W2051487156","https://openalex.org/W2073681303","https://openalex.org/W4289260319","https://openalex.org/W2359600231","https://openalex.org/W2380019117","https://openalex.org/W2093343611","https://openalex.org/W1987886368","https://openalex.org/W1660309994","https://openalex.org/W2369187583","https://openalex.org/W3154539612"],"abstract_inverted_index":{"This":[0],"paper":[1],"presents":[2],"a":[3,39,54,63,154],"novel":[4],"global":[5,173],"path":[6,41,141,174],"planning":[7,42,127,142,175],"algorithm":[8,16,29,43,108,124,190],"adapted":[9],"to":[10,136,149,186],"grid":[11,50],"maps":[12,51],"extending":[13],"the":[14,49,76,106,122,163,170],"Bug":[15,77],"family.":[17],"During":[18],"experiments":[19],"with":[20,72,84],"Bresenham\u2019s":[21],"line":[22,111],"algorithm,":[23],"it":[24],"was":[25,44,70,98,113,134],"found":[26,135],"that":[27,46,182],"this":[28,36],"allows":[30],"natural":[31],"obstacle":[32],"avoidance.":[33],"Based":[34,115],"on":[35,48,116],"observed":[37],"property,":[38],"recursive":[40],"developed":[45],"operates":[47],"represented":[52],"by":[53,176],"masked":[55],"array":[56],"and":[57,92,179],"solves":[58],"potential":[59],"looping":[60],"problems":[61],"using":[62],"state":[64],"machine-based":[65],"loop":[66],"breaking":[67],"mechanism.":[68],"BRP":[69,123,133],"compared":[71,148],"existing":[73,150],"methods":[74],"from":[75],"family":[78],"of":[79,105,121,172],"algorithms":[80,87,151],"as":[81,83,89],"well":[82],"more":[85],"classical":[86],"such":[88],"A*,":[90],"D*,":[91],"Dijkstra.":[93],"The":[94,102,166,189],"Piano":[95],"Movers":[96],"problem":[97],"also":[99],"touched":[100],"upon.":[101],"time":[103,143],"performance":[104],"BLA":[107],"for":[109,125,144],"different":[110],"thicknesses":[112],"compared.":[114],"these":[117],"experiments,":[118,132],"future":[119],"optimisation":[120],"motion":[126],"tasks":[128],"is":[129,191],"possible.":[130],"Through":[131],"show":[137],"significant":[138],"improvement":[139],"in":[140,157],"certain":[145],"map":[146],"cases":[147],"while":[152],"acknowledging":[153],"slight":[155],"increase":[156],"route":[158],"length,":[159],"approximately":[160],"0.43%":[161],"above":[162],"optimal":[164],"path.":[165],"presented":[167],"work":[168],"improves":[169],"field":[171],"providing":[177],"efficient":[178],"adaptable":[180],"solutions":[181],"can":[183],"be":[184],"applied":[185],"specific":[187],"applications.":[188],"available":[192],"at":[193],"https://github.com/qr34t0r/BRP":[194]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":2}],"updated_date":"2026-03-24T08:02:53.985720","created_date":"2025-10-10T00:00:00"}