{"id":"https://openalex.org/W2964918357","doi":"https://doi.org/10.1109/romoco.2019.8787357","title":"Planning TS Trajectory Using MLAT in $\\mathrm{o}(\\mathrm{n}\\log \\mathrm{n})$","display_name":"Planning TS Trajectory Using MLAT in $\\mathrm{o}(\\mathrm{n}\\log \\mathrm{n})$","publication_year":2019,"publication_date":"2019-07-01","ids":{"openalex":"https://openalex.org/W2964918357","doi":"https://doi.org/10.1109/romoco.2019.8787357","mag":"2964918357"},"language":"en","primary_location":{"id":"doi:10.1109/romoco.2019.8787357","is_oa":false,"landing_page_url":"https://doi.org/10.1109/romoco.2019.8787357","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 12th International Workshop on Robot Motion and Control (RoMoCo)","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/A5068237941","display_name":"Dan Ophir","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Dan Ophir","raw_affiliation_strings":["Computer Science Department"],"affiliations":[{"raw_affiliation_string":"Computer Science Department","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5076953072","display_name":"Ahiya Davidovitch","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ahiya Davidovitch","raw_affiliation_strings":["Mathematics Department"],"affiliations":[{"raw_affiliation_string":"Mathematics Department","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5068237941"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.0687496,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"40","issue":null,"first_page":"223","last_page":"230"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9987999796867371,"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.9987999796867371,"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/T12288","display_name":"Optimization and Search Problems","score":0.9973999857902527,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9970999956130981,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/traverse","display_name":"Traverse","score":0.6943301558494568},{"id":"https://openalex.org/keywords/grid","display_name":"Grid","score":0.673319399356842},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6156871318817139},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5737705230712891},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5202288031578064},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.4555280804634094},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4129272699356079},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.33997270464897156},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.33743780851364136},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.32076460123062134},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.24707069993019104},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2201937437057495}],"concepts":[{"id":"https://openalex.org/C176809094","wikidata":"https://www.wikidata.org/wiki/Q15401496","display_name":"Traverse","level":2,"score":0.6943301558494568},{"id":"https://openalex.org/C187691185","wikidata":"https://www.wikidata.org/wiki/Q2020720","display_name":"Grid","level":2,"score":0.673319399356842},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6156871318817139},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5737705230712891},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5202288031578064},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.4555280804634094},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4129272699356079},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33997270464897156},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.33743780851364136},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.32076460123062134},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.24707069993019104},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2201937437057495},{"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/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/romoco.2019.8787357","is_oa":false,"landing_page_url":"https://doi.org/10.1109/romoco.2019.8787357","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 12th International Workshop on Robot Motion and Control (RoMoCo)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W187767610","https://openalex.org/W1899100928","https://openalex.org/W1994624692","https://openalex.org/W2009803313","https://openalex.org/W2014068360","https://openalex.org/W2017393964","https://openalex.org/W2020993691","https://openalex.org/W2024060531","https://openalex.org/W2029242918","https://openalex.org/W2032938251","https://openalex.org/W2042986967","https://openalex.org/W2058748455","https://openalex.org/W2059506221","https://openalex.org/W2084340826","https://openalex.org/W2092292680","https://openalex.org/W2106378689","https://openalex.org/W2122103820","https://openalex.org/W2123241324","https://openalex.org/W2148673189","https://openalex.org/W2151317657","https://openalex.org/W2151977393","https://openalex.org/W2154061444","https://openalex.org/W2963958826","https://openalex.org/W4250530934","https://openalex.org/W6607571859","https://openalex.org/W6677910640","https://openalex.org/W7061609391"],"related_works":["https://openalex.org/W2377402383","https://openalex.org/W2380835401","https://openalex.org/W2381912691","https://openalex.org/W2350381577","https://openalex.org/W2353618196","https://openalex.org/W2348074676","https://openalex.org/W2385033175","https://openalex.org/W2374043190","https://openalex.org/W2363298784","https://openalex.org/W2367402697"],"abstract_inverted_index":{"The":[0,99,115,164,223,252,335],"Multi-Level":[1],"Adaptive":[2],"Technique":[3],"(MLAT)":[4],"is":[5,137,180,202,212,217,220,226,235,262,267,283,297,325,346],"a":[6,30,56,207,215,255,259,289,293,303,318,328,340],"technique":[7],"used":[8],"for":[9,35,169],"solving":[10,43],"problems":[11],"approximately":[12],"and":[13,20,74,83,129,161,276],"iteratively":[14],"at":[15,26,95,144],"levels":[16],"with":[17,32,60],"various":[18],"resolutions,":[19],"then":[21,75],"injecting":[22],"the":[23,36,49,71,90,93,140,145,170,175,178,186,193,197,229,238,243,249,271,274,280,309,315,322],"corresponding":[24],"solution":[25,234,245],"each":[27,200],"level":[28,133,147],"into":[29,120,125,131,188,206,237],"problem":[31,103,225],"close":[33,97],"resolution":[34],"next":[37],"iteration.":[38],"MLAT":[39,111,183,336],"was":[40,67],"originally":[41],"applied":[42,284],"successfully":[44],"partial":[45],"differential":[46],"equations":[47],"using":[48,55,70,112,228,331],"so":[50],"called":[51],"Multi":[52],"Grid":[53],"method,":[54],"set":[57],"of":[58,142,273,317],"grids":[59,94],"gradually":[61],"varying":[62],"mesh":[63],"sizes.":[64],"Each":[65],"grid":[66],"treated":[68],"separately":[69],"so-called":[72,332],"relaxation,":[73,247,265],"traversing":[76,173],"(injection":[77],"from":[78,85,254,288],"fine":[79,88,260],"to":[80,87,157,241,258,292,313,343],"coarse":[81,86,256],"grid,":[82],"interpolation":[84],"grid)":[89],"data":[91],"between":[92],"two":[96],"levels.":[98],"Traveling":[100],"Salesman":[101],"(TS)":[102],"-":[104],"popular":[105],"in":[106,155,177,196,301,327],"Motion":[107],"Planning,":[108],"solved":[109,227],"by":[110,182,184,191,246,264],"Graph":[113],"Theory.":[114],"vertices":[116,176,195,305],"are":[117,123,306],"specially":[118],"partitioned":[119],"groups,":[121,128],"which":[122,219,266,302,345],"moved":[124],"more":[126,319],"general":[127],"again":[130,205],"higher":[132],"groups.":[134],"This":[135,210,233],"grouping":[136],"repeated":[138,213,268],"until":[139,214],"number":[141],"elements":[143,154],"highest":[146],"collected,":[148],"does":[149],"not":[150],"have":[151],"too":[152],"many":[153],"order":[156,312],"enable":[158,339],"their":[159],"easy":[160],"fast":[162],"manipulation.":[163],"TS":[165,224],"problem,":[166],"namely,":[167],"searching":[168],"shortest":[171],"path":[172],"all":[174,270],"graph,":[179],"approximated":[181],"partitioning":[185],"graph":[187,257,261,275,291],"small":[189,221],"subgraphs":[190],"selecting":[192],"odd":[194],"original":[198],"graph;":[199],"subgraph":[201,216,231,240],"similarly":[203],"divided":[204],"smaller":[208],"subgraph.":[209,251,278],"procedure":[211],"obtained,":[218],"enough.":[222],"coarsest":[230],"obtained.":[232],"injected":[236],"finer":[239,290],"improve":[242],"approximate":[244],"on":[248,269],"current":[250],"injection":[253],"followed":[263],"pairs":[272],"its":[277],"Then":[279],"opposite":[281],"direction":[282,324],"injection:":[285],"bottom":[286],"up,":[287],"coarser":[294],"graph.":[295],"Relaxation":[296],"an":[298,347],"iterative":[299],"process":[300],"graph's":[304],"traversed,":[307],"improving":[308],"solution.":[310],"In":[311],"increase":[314],"chances":[316],"accurate":[320],"solution,":[321],"algorithm's":[323],"determined":[326],"nondeterministic":[329],"way":[330],"Simulated":[333],"Annealing.":[334],"implementation":[337],"may":[338],"Multi-Processing":[341],"leading":[342],"Parallel-Processing,":[344],"additional":[348],"advantage.":[349]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}