{"id":"https://openalex.org/W2170141090","doi":"https://doi.org/10.1109/tase.2011.2123888","title":"Some Complexity Results for Metric View Planning Problem With Traveling Cost and Visibility Range","display_name":"Some Complexity Results for Metric View Planning Problem With Traveling Cost and Visibility Range","publication_year":2011,"publication_date":"2011-04-27","ids":{"openalex":"https://openalex.org/W2170141090","doi":"https://doi.org/10.1109/tase.2011.2123888","mag":"2170141090"},"language":"en","primary_location":{"id":"doi:10.1109/tase.2011.2123888","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tase.2011.2123888","pdf_url":null,"source":{"id":"https://openalex.org/S34881539","display_name":"IEEE Transactions on Automation Science and Engineering","issn_l":"1545-5955","issn":["1545-5955","1558-3783"],"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 Automation Science and Engineering","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/A5100724577","display_name":"Pengpeng Wang","orcid":"https://orcid.org/0000-0002-0307-8837"},"institutions":[{"id":"https://openalex.org/I18014758","display_name":"Simon Fraser University","ror":"https://ror.org/0213rcc28","country_code":"CA","type":"education","lineage":["https://openalex.org/I18014758"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Pengpeng Wang","raw_affiliation_strings":["RAMP Laboratory, School of Engineering Science, Simon Fraser University, Burnaby, BC, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"RAMP Laboratory, School of Engineering Science, Simon Fraser University, Burnaby, BC, Canada","institution_ids":["https://openalex.org/I18014758"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5067371024","display_name":"Kamal Gupta","orcid":"https://orcid.org/0000-0002-4154-0615"},"institutions":[{"id":"https://openalex.org/I18014758","display_name":"Simon Fraser University","ror":"https://ror.org/0213rcc28","country_code":"CA","type":"education","lineage":["https://openalex.org/I18014758"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"K. Gupta","raw_affiliation_strings":["RAMP Laboratory, School of Engineering Science, Simon Fraser University, Burnaby, BC, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"RAMP Laboratory, School of Engineering Science, Simon Fraser University, Burnaby, BC, Canada","institution_ids":["https://openalex.org/I18014758"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5014255932","display_name":"Ramesh Krishnamurti","orcid":"https://orcid.org/0000-0001-6327-8286"},"institutions":[{"id":"https://openalex.org/I18014758","display_name":"Simon Fraser University","ror":"https://ror.org/0213rcc28","country_code":"CA","type":"education","lineage":["https://openalex.org/I18014758"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"R. Krishnamurti","raw_affiliation_strings":["School of Computing Science, Simon Fraser University, Burnaby, BC, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computing Science, Simon Fraser University, Burnaby, BC, Canada","institution_ids":["https://openalex.org/I18014758"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I18014758"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.19454713,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"8","issue":"3","first_page":"654","last_page":"659"},"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/T12288","display_name":"Optimization and Search Problems","score":0.9994000196456909,"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.9990000128746033,"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/metric","display_name":"Metric (unit)","score":0.6867831945419312},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.6396617889404297},{"id":"https://openalex.org/keywords/range","display_name":"Range (aeronautics)","score":0.623311460018158},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.6231016516685486},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5925367474555969},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5862665772438049},{"id":"https://openalex.org/keywords/visibility","display_name":"Visibility","score":0.5260125398635864},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4800451993942261},{"id":"https://openalex.org/keywords/set-cover-problem","display_name":"Set cover problem","score":0.4477996230125427},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.43838223814964294},{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.4383390545845032},{"id":"https://openalex.org/keywords/metric-space","display_name":"Metric space","score":0.4155206084251404},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.38840168714523315},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.34406498074531555},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3271401524543762},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.2193659245967865},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.16928449273109436},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.08903998136520386}],"concepts":[{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.6867831945419312},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.6396617889404297},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.623311460018158},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.6231016516685486},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5925367474555969},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5862665772438049},{"id":"https://openalex.org/C123403432","wikidata":"https://www.wikidata.org/wiki/Q654068","display_name":"Visibility","level":2,"score":0.5260125398635864},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4800451993942261},{"id":"https://openalex.org/C100808899","wikidata":"https://www.wikidata.org/wiki/Q1192100","display_name":"Set cover problem","level":3,"score":0.4477996230125427},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.43838223814964294},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.4383390545845032},{"id":"https://openalex.org/C198043062","wikidata":"https://www.wikidata.org/wiki/Q180953","display_name":"Metric space","level":2,"score":0.4155206084251404},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.38840168714523315},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.34406498074531555},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3271401524543762},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.2193659245967865},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.16928449273109436},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.08903998136520386},{"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/C21547014","wikidata":"https://www.wikidata.org/wiki/Q1423657","display_name":"Operations management","level":1,"score":0.0},{"id":"https://openalex.org/C146978453","wikidata":"https://www.wikidata.org/wiki/Q3798668","display_name":"Aerospace engineering","level":1,"score":0.0},{"id":"https://openalex.org/C120665830","wikidata":"https://www.wikidata.org/wiki/Q14620","display_name":"Optics","level":1,"score":0.0},{"id":"https://openalex.org/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tase.2011.2123888","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tase.2011.2123888","pdf_url":null,"source":{"id":"https://openalex.org/S34881539","display_name":"IEEE Transactions on Automation Science and Engineering","issn_l":"1545-5955","issn":["1545-5955","1558-3783"],"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 Automation Science and Engineering","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","score":0.75,"id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W101508493","https://openalex.org/W1520744620","https://openalex.org/W1552828154","https://openalex.org/W2011039300","https://openalex.org/W2027263242","https://openalex.org/W2042986967","https://openalex.org/W2052861240","https://openalex.org/W2078505501","https://openalex.org/W2092705708","https://openalex.org/W2117226423","https://openalex.org/W2123264737","https://openalex.org/W2127399848","https://openalex.org/W2128990851","https://openalex.org/W2138800545","https://openalex.org/W2143996311","https://openalex.org/W2153644332","https://openalex.org/W2157638946","https://openalex.org/W2158652185","https://openalex.org/W2171554063","https://openalex.org/W2406507196","https://openalex.org/W2611804663","https://openalex.org/W2951420174","https://openalex.org/W2998757566","https://openalex.org/W4232911940","https://openalex.org/W4242811155","https://openalex.org/W4254780343","https://openalex.org/W4285719527","https://openalex.org/W6678651695"],"related_works":["https://openalex.org/W2147086810","https://openalex.org/W4376639562","https://openalex.org/W1594413663","https://openalex.org/W1496354680","https://openalex.org/W2102199239","https://openalex.org/W2952847377","https://openalex.org/W2099799577","https://openalex.org/W2019216770","https://openalex.org/W1517616038","https://openalex.org/W2782292024"],"abstract_inverted_index":{"In":[0],"this":[1,163],"paper,":[2],"we":[3,89,168],"consider":[4],"the":[5,38,45,51,56,64,86,92,109,130,147,154,183],"problem":[6,133,151],"where":[7,106],"a":[8,12,31,82,119],"point":[9],"robot":[10],"in":[11,78],"2D":[13],"or":[14,75],"3D":[15],"environment":[16],"equipped":[17],"with":[18,69],"an":[19,122,136,144,173],"omnidirectional":[20],"range":[21,25],"sensor":[22],"of":[23,33,40,47,58,111,121,127,176],"finite":[24],"D":[26],"is":[27,108],"asked":[28],"to":[29,44,55,114,134,152],"cover":[30],"set":[32],"surface":[34,112],"patches,":[35],"while":[36],"minimizing":[37],"sum":[39],"view":[41,131],"cost,":[42,53],"proportional":[43,54],"number":[46,110],"viewpoints":[48],"planned,":[49],"and":[50,72,139],"travel":[52],"length":[57],"path":[59],"traveled.":[60],"We":[61,80,116,157],"call":[62],"it":[63,171,180],"Metric":[65,76,93,148],"View":[66],"Planning":[67],"Problem":[68],"Traveling":[70],"Cost":[71],"Visibility":[73],"Range":[74],"TVPP":[77,94],"short.":[79],"present":[81,159],"complexity":[83],"result":[84],"for":[85,162],"problem,":[87],"i.e.,":[88,167],"show":[90,169],"that":[91,170],"cannot":[95],"be":[96],"approximated":[97],"within":[98],"O(log":[99,177],"m)":[100],"ratio":[101,175,186],"by":[102],"any":[103],"polynomial":[104],"algorithm,":[105,146,166],"m":[107],"patches":[113],"cover.":[115],"then":[117,140,158],"analyze":[118],"variant":[120],"existing":[123],"decoupled":[124,165],"two-level":[125,164],"algorithm":[126],"first":[128],"solving":[129],"planning":[132],"get":[135],"approximate":[137],"solution,":[138],"solving,":[141],"again":[142],"using":[143],"approximation":[145,174,185],"traveling":[149],"salesman":[150],"connect":[153],"planned":[155],"viewpoints.":[156],"performance":[160],"bounds":[161],"has":[172],"m).":[178],"Thus,":[179],"asymptotically":[181],"achieves":[182],"best":[184],"one":[187],"can":[188],"hope":[189],"for.":[190]},"counts_by_year":[{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":3},{"year":2015,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}