{"id":"https://openalex.org/W2155191411","doi":"https://doi.org/10.1109/acc.2011.5991534","title":"Approximation algorithms for a heterogeneous Multiple Depot Hamiltonian Path Problem","display_name":"Approximation algorithms for a heterogeneous Multiple Depot Hamiltonian Path Problem","publication_year":2011,"publication_date":"2011-06-01","ids":{"openalex":"https://openalex.org/W2155191411","doi":"https://doi.org/10.1109/acc.2011.5991534","mag":"2155191411"},"language":"en","primary_location":{"id":"doi:10.1109/acc.2011.5991534","is_oa":false,"landing_page_url":"https://doi.org/10.1109/acc.2011.5991534","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2011 American Control Conference","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/A5049570529","display_name":"Sai Krishna Yadlapalli","orcid":null},"institutions":[{"id":"https://openalex.org/I91045830","display_name":"Texas A&M University","ror":"https://ror.org/01f5ytq51","country_code":"US","type":"education","lineage":["https://openalex.org/I91045830"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"S. Yadlapalli","raw_affiliation_strings":["Department of Mechanical Engineering, Texas A and M University, College Station, TX, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mechanical Engineering, Texas A and M University, College Station, TX, USA","institution_ids":["https://openalex.org/I91045830"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5044815306","display_name":"Jungyun Bae","orcid":"https://orcid.org/0000-0002-4673-2464"},"institutions":[{"id":"https://openalex.org/I91045830","display_name":"Texas A&M University","ror":"https://ror.org/01f5ytq51","country_code":"US","type":"education","lineage":["https://openalex.org/I91045830"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jungyun Bae","raw_affiliation_strings":["Department of Mechanical Engineering, Texas A and M University, College Station, TX, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mechanical Engineering, Texas A and M University, College Station, TX, USA","institution_ids":["https://openalex.org/I91045830"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5033570895","display_name":"Sivakumar Rathinam","orcid":"https://orcid.org/0000-0002-9223-7456"},"institutions":[{"id":"https://openalex.org/I91045830","display_name":"Texas A&M University","ror":"https://ror.org/01f5ytq51","country_code":"US","type":"education","lineage":["https://openalex.org/I91045830"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"S. Rathinam","raw_affiliation_strings":["Department of Mechanical Engineering, Texas A and M University, College Station, TX, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mechanical Engineering, Texas A and M University, College Station, TX, USA","institution_ids":["https://openalex.org/I91045830"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5108096809","display_name":"S. Darbha","orcid":null},"institutions":[{"id":"https://openalex.org/I91045830","display_name":"Texas A&M University","ror":"https://ror.org/01f5ytq51","country_code":"US","type":"education","lineage":["https://openalex.org/I91045830"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"S. Darbha","raw_affiliation_strings":["Department of Mechanical Engineering, Texas A and M University, College Station, TX, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mechanical Engineering, Texas A and M University, College Station, TX, USA","institution_ids":["https://openalex.org/I91045830"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I91045830"],"apc_list":null,"apc_paid":null,"fwci":0.4756,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.64188391,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"2789","last_page":"2794"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9966999888420105,"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.9966999888420105,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9943000078201294,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9934999942779541,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing 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/motion-planning","display_name":"Motion planning","score":0.6287899017333984},{"id":"https://openalex.org/keywords/triangle-inequality","display_name":"Triangle inequality","score":0.6154255867004395},{"id":"https://openalex.org/keywords/hamiltonian-path","display_name":"Hamiltonian path","score":0.5416858792304993},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.527185320854187},{"id":"https://openalex.org/keywords/hamiltonian","display_name":"Hamiltonian (control theory)","score":0.49230897426605225},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4738229513168335},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4657139778137207},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4457316994667053},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.44086557626724243},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.42827939987182617},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.4226214587688446},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3753757178783417},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.25668203830718994},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.18546825647354126},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.12223422527313232},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.11938837170600891}],"concepts":[{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.6287899017333984},{"id":"https://openalex.org/C182964748","wikidata":"https://www.wikidata.org/wiki/Q208216","display_name":"Triangle inequality","level":2,"score":0.6154255867004395},{"id":"https://openalex.org/C86524685","wikidata":"https://www.wikidata.org/wiki/Q273037","display_name":"Hamiltonian path","level":3,"score":0.5416858792304993},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.527185320854187},{"id":"https://openalex.org/C130787639","wikidata":"https://www.wikidata.org/wiki/Q5645293","display_name":"Hamiltonian (control theory)","level":2,"score":0.49230897426605225},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4738229513168335},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4657139778137207},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4457316994667053},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.44086557626724243},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.42827939987182617},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.4226214587688446},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3753757178783417},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.25668203830718994},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.18546825647354126},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.12223422527313232},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.11938837170600891},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/acc.2011.5991534","is_oa":false,"landing_page_url":"https://doi.org/10.1109/acc.2011.5991534","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2011 American Control Conference","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","score":0.4099999964237213,"id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1545850514","https://openalex.org/W1572663059","https://openalex.org/W1969481197","https://openalex.org/W1999117624","https://openalex.org/W2016583826","https://openalex.org/W2034470238","https://openalex.org/W2124943299","https://openalex.org/W2126366668","https://openalex.org/W2128940723","https://openalex.org/W2162750432","https://openalex.org/W2546190651","https://openalex.org/W2611804663","https://openalex.org/W4230573295","https://openalex.org/W4253862475","https://openalex.org/W6679060112"],"related_works":["https://openalex.org/W2025698306","https://openalex.org/W1481223916","https://openalex.org/W2056179869","https://openalex.org/W2149302127","https://openalex.org/W1850573590","https://openalex.org/W2051253470","https://openalex.org/W2561136735","https://openalex.org/W1950827710","https://openalex.org/W1482102823","https://openalex.org/W2886112286"],"abstract_inverted_index":{"In":[0],"this":[1,234,257],"article,":[2],"we":[3,236],"present":[4],"the":[5,18,70,73,115,122,130,138,148,161,175,222,238,245],"first":[6],"approximation":[7],"algorithm":[8],"for":[9,128,163,233],"a":[10,29,32,45,86,93,103,110,153,157,187,191,260],"routing":[11],"problem":[12,27,254],"that":[13,169,229],"is":[14,28,39,44,160,172,182,259,270],"frequently":[15],"encountered":[16],"in":[17,256],"motion":[19,145],"planning":[20],"of":[21,31,47,72,95,112,117,140,150,241,243,263],"Unmanned":[22],"Vehicles":[23],"(UVs).":[24],"The":[25,132,203,253],"considered":[26,232,255],"variant":[30],"Multiple":[33],"Depot-Terminal":[34],"Hamiltonian":[35,266],"Path":[36,267],"Problem":[37,268],"and":[38,55,101,146,215,269],"stated":[40],"as":[41,213,247],"follows:":[42],"There":[43,66],"collection":[46],"m":[48],"UVs":[49,96,113,133,204,246],"equipped":[50],"with":[51,178],"different":[52,209,227],"sensors":[53,120],"on-board":[54,99],"there":[56,225],"are":[57,67,134,216,226],"n":[58],"targets":[59,71],"to":[60,156,184,190,196,212,219,221,250],"be":[61,80,89,107,126,231,251],"visited":[62,81,90,108],"by":[63,82,92,109,174],"them":[64],"collectively.":[65],"restrictions":[68],"on":[69,118,121,143],"following":[74],"type:":[75],"(1)":[76],"A":[77,155,189],"target":[78,87,104,154,158,188,192,201],"may":[79,105,124,205],"any":[83],"UV,":[84],"(2)":[85],"must":[88],"only":[91],"subset":[94,111],"(with":[97],"appropriate":[98],"sensor)":[100],"(3)":[102],"not":[106,125,217],"(as":[114],"set":[116],"board":[119],"UV":[123],"suitable":[127],"viewing":[129],"targets).":[131],"otherwise":[135],"identical":[136],"from":[137,152,186,208],"viewpoint":[139],"dynamic":[141],"constraints":[142],"their":[144],"hence,":[147],"cost":[149,176,240],"traveling":[151],"B":[159,193],"same":[162],"all":[164,244],"vehicles.":[165],"We":[166],"will":[167],"assume":[168],"triangle":[170],"inequality":[171],"satisfied":[173],"associated":[177],"travel,":[179],"i.e.,":[180],"it":[181],"cheaper":[183],"travel":[185,242],"directly":[194],"than":[195],"go":[197],"via":[198],"an":[199,248],"intermediate":[200],"C.":[202],"possibly":[206],"start":[207],"locations":[210],"(referred":[211],"depots)":[214],"required":[218],"return":[220],"depot.":[223],"While":[224],"objectives":[228],"can":[230],"problem,":[235],"consider":[237],"total":[239],"objective":[249],"minimized.":[252],"article":[258],"generalized":[261],"version":[262],"single":[264],"depot-terminal":[265],"NP-hard.":[271]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}