{"id":"https://openalex.org/W2057744573","doi":"https://doi.org/10.1109/tro.2008.2006237","title":"CBUG: A Quadratically Competitive Mobile Robot Navigation Algorithm","display_name":"CBUG: A Quadratically Competitive Mobile Robot Navigation Algorithm","publication_year":2008,"publication_date":"2008-12-01","ids":{"openalex":"https://openalex.org/W2057744573","doi":"https://doi.org/10.1109/tro.2008.2006237","mag":"2057744573"},"language":"en","primary_location":{"id":"doi:10.1109/tro.2008.2006237","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tro.2008.2006237","pdf_url":null,"source":{"id":"https://openalex.org/S144620930","display_name":"IEEE Transactions on Robotics","issn_l":"1552-3098","issn":["1552-3098","1941-0468"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Robotics","raw_type":"journal-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/A5014698632","display_name":"Yoav Gabriely","orcid":null},"institutions":[{"id":"https://openalex.org/I174306211","display_name":"Technion \u2013 Israel Institute of Technology","ror":"https://ror.org/03qryx823","country_code":"IL","type":"education","lineage":["https://openalex.org/I174306211"]}],"countries":["IL"],"is_corresponding":true,"raw_author_name":"Y. Gabriely","raw_affiliation_strings":["Department ofMechanical Engineering, Technion-Israel Institute of Technology, Haifa, Israel","Dept. of Mech. Eng., Technion - Israel Inst. of Technol., Haifa#TAB#"],"affiliations":[{"raw_affiliation_string":"Department ofMechanical Engineering, Technion-Israel Institute of Technology, Haifa, Israel","institution_ids":["https://openalex.org/I174306211"]},{"raw_affiliation_string":"Dept. of Mech. Eng., Technion - Israel Inst. of Technol., Haifa#TAB#","institution_ids":["https://openalex.org/I174306211"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5049467216","display_name":"Elon Rimon","orcid":"https://orcid.org/0000-0002-8270-6167"},"institutions":[{"id":"https://openalex.org/I174306211","display_name":"Technion \u2013 Israel Institute of Technology","ror":"https://ror.org/03qryx823","country_code":"IL","type":"education","lineage":["https://openalex.org/I174306211"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"E. Rimon","raw_affiliation_strings":["Department ofMechanical Engineering, Technion-Israel Institute of Technology, Haifa, Israel","Dept. of Mech. Eng., Technion - Israel Inst. of Technol., Haifa#TAB#"],"affiliations":[{"raw_affiliation_string":"Department ofMechanical Engineering, Technion-Israel Institute of Technology, Haifa, Israel","institution_ids":["https://openalex.org/I174306211"]},{"raw_affiliation_string":"Dept. of Mech. Eng., Technion - Israel Inst. of Technol., Haifa#TAB#","institution_ids":["https://openalex.org/I174306211"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5014698632"],"corresponding_institution_ids":["https://openalex.org/I174306211"],"apc_list":null,"apc_paid":null,"fwci":3.8121,"has_fulltext":false,"cited_by_count":27,"citation_normalized_percentile":{"value":0.9356213,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"24","issue":"6","first_page":"1451","last_page":"1457"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9998999834060669,"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"}},{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9983999729156494,"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/T10249","display_name":"Distributed Control Multi-Agent Systems","score":0.9886999726295471,"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/competitive-analysis","display_name":"Competitive analysis","score":0.7330756187438965},{"id":"https://openalex.org/keywords/quadratic-growth","display_name":"Quadratic growth","score":0.5996140241622925},{"id":"https://openalex.org/keywords/mobile-robot","display_name":"Mobile robot","score":0.5951072573661804},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5921551585197449},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5772496461868286},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.5434951186180115},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.5251890420913696},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.5245407223701477},{"id":"https://openalex.org/keywords/mobile-robot-navigation","display_name":"Mobile robot navigation","score":0.5120664238929749},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4983644485473633},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.490296870470047},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.4401484727859497},{"id":"https://openalex.org/keywords/stability","display_name":"Stability (learning theory)","score":0.4265567362308502},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4230560064315796},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.33168458938598633},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.3042094111442566},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.25781288743019104},{"id":"https://openalex.org/keywords/robot-control","display_name":"Robot control","score":0.23909491300582886},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.1603846549987793},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.13739553093910217}],"concepts":[{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.7330756187438965},{"id":"https://openalex.org/C195956108","wikidata":"https://www.wikidata.org/wiki/Q7268362","display_name":"Quadratic growth","level":2,"score":0.5996140241622925},{"id":"https://openalex.org/C19966478","wikidata":"https://www.wikidata.org/wiki/Q4810574","display_name":"Mobile robot","level":3,"score":0.5951072573661804},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5921551585197449},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5772496461868286},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.5434951186180115},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.5251890420913696},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.5245407223701477},{"id":"https://openalex.org/C26990112","wikidata":"https://www.wikidata.org/wiki/Q6887224","display_name":"Mobile robot navigation","level":5,"score":0.5120664238929749},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4983644485473633},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.490296870470047},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.4401484727859497},{"id":"https://openalex.org/C112972136","wikidata":"https://www.wikidata.org/wiki/Q7595718","display_name":"Stability (learning theory)","level":2,"score":0.4265567362308502},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4230560064315796},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.33168458938598633},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.3042094111442566},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.25781288743019104},{"id":"https://openalex.org/C65401140","wikidata":"https://www.wikidata.org/wiki/Q7353385","display_name":"Robot control","level":4,"score":0.23909491300582886},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.1603846549987793},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.13739553093910217},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"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/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":2,"locations":[{"id":"doi:10.1109/tro.2008.2006237","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tro.2008.2006237","pdf_url":null,"source":{"id":"https://openalex.org/S144620930","display_name":"IEEE Transactions on Robotics","issn_l":"1552-3098","issn":["1552-3098","1941-0468"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Robotics","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.105.2122","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.105.2122","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://robots.technion.ac.il/papers/Cbug.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W1490549084","https://openalex.org/W1503247905","https://openalex.org/W1573720488","https://openalex.org/W1829541011","https://openalex.org/W1861533369","https://openalex.org/W1971116024","https://openalex.org/W1983655539","https://openalex.org/W1992876208","https://openalex.org/W1998813085","https://openalex.org/W2005923729","https://openalex.org/W2006940365","https://openalex.org/W2019729116","https://openalex.org/W2041645394","https://openalex.org/W2082846783","https://openalex.org/W2093284501","https://openalex.org/W2106233787","https://openalex.org/W2116740932","https://openalex.org/W2119559506","https://openalex.org/W2125303632","https://openalex.org/W2145151038","https://openalex.org/W2153114207","https://openalex.org/W3138253756","https://openalex.org/W4285719527","https://openalex.org/W6629246556","https://openalex.org/W6643019172","https://openalex.org/W6676023185"],"related_works":["https://openalex.org/W2805032541","https://openalex.org/W3043374795","https://openalex.org/W2129037092","https://openalex.org/W2951962248","https://openalex.org/W4298037027","https://openalex.org/W1593029261","https://openalex.org/W2168528000","https://openalex.org/W2804992076","https://openalex.org/W2143662098","https://openalex.org/W2568831210"],"abstract_inverted_index":{"This":[0],"paper":[1,58],"is":[2,27,54,83,89,106,113,133,150],"concerned":[3],"with":[4,135],"online":[5,25,66,73,120],"navigation":[6,31,74,121],"of":[7,61,87,99,142,147],"a":[8,62,77],"size":[9,78],"D":[10,79],"mobile":[11],"robot":[12,80],"in":[13,56,59,96,109,145,152],"an":[14],"unknown":[15],"planar":[16],"environment.":[17],"A":[18],"formal":[19],"means":[20,49],"for":[21,24,76],"assessing":[22],"algorithms":[23],"tasks":[26],"competitiveness.":[28,130],"For":[29],"the":[30,35,41,97,100,114,140],"task,":[32],"competitiveness":[33,47,86,112,144],"measures":[34],"algorithm's":[36],"path":[37,44,148],"length":[38,98],"relative":[39,51],"to":[40,93,125],"optimal":[42,69,129],"offline":[43,70,102],"length.":[45],"While":[46],"usually":[48],"constant":[50],"performance,":[52],"it":[53,105],"measured":[55],"this":[57],"terms":[60,146],"quadratic":[63,95,111],"relationship":[64],"between":[65],"performance":[67,117],"and":[68,91,139],"solution.":[71],"An":[72],"algorithm":[75,132],"called":[81],"CBUG":[82,88,127],"described.":[84],"The":[85,131],"analyzed":[90],"shown":[92,107],"be":[94],"shortest":[101],"path.":[103],"Moreover,":[104],"that,":[108],"general,":[110],"best":[115],"achievable":[116],"over":[118],"all":[119],"algorithms.":[122],"Thus,":[123],"up":[124],"constants,":[126],"achieves":[128],"improved":[134],"some":[136],"practical":[137],"speedups,":[138],"usefulness":[141],"its":[143],"stability":[149],"illustrated":[151],"office-like":[153],"environments.":[154]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":3}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}