乐胖代购免代理版

{"id":"https://openalex.org/W2240664703","doi":"https://doi.org/10.5220/0005252104110419","title":"Discrete Optimal View Path Planning","display_name":"Discrete Optimal View Path Planning","publication_year":2015,"publication_date":"2015-01-01","ids":{"openalex":"https://openalex.org/W2240664703","doi":"https://doi.org/10.5220/0005252104110419","mag":"2240664703"},"language":"en","primary_location":{"is_oa":true,"landing_page_url":"https://doi.org/10.5220/0005252104110419","pdf_url":null,"source":null,"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true},"type":"article","type_crossref":"proceedings-article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://doi.org/10.5220/0005252104110419","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5002786005","display_name":"Sebastian Haner","orcid":null},"institutions":[{"id":"https://openalex.org/I187531555","display_name":"Lund University","ror":"https://ror.org/012a77v79","country_code":"SE","type":"education","lineage":["https://openalex.org/I187531555"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Sebastian Haner","raw_affiliation_strings":["Lund University, Sweden"],"affiliations":[{"raw_affiliation_string":"Lund University, Sweden","institution_ids":["https://openalex.org/I187531555"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5069875065","display_name":"Anders Heyden","orcid":"https://orcid.org/0000-0002-3063-355X"},"institutions":[{"id":"https://openalex.org/I187531555","display_name":"Lund University","ror":"https://ror.org/012a77v79","country_code":"SE","type":"education","lineage":["https://openalex.org/I187531555"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Anders Heyden","raw_affiliation_strings":["Lund University, Sweden"],"affiliations":[{"raw_affiliation_string":"Lund University, Sweden","institution_ids":["https://openalex.org/I187531555"]}]}],"institution_assertions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.202,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.350257,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":79,"max":81},"biblio":{"volume":null,"issue":null,"first_page":"411","last_page":"419"},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9998,"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.9998,"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/T10080","display_name":"Energy Efficient Wireless Sensor Networks","score":0.9863,"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/T10191","display_name":"Robotics and Sensor-Based Localization","score":0.9848,"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/time-horizon","display_name":"Time horizon","score":0.55047166},{"id":"https://openalex.org/keywords/any-angle-path-planning","display_name":"Any-angle path planning","score":0.45611143}],"concepts":[{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.7553127},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.66127443},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.55078644},{"id":"https://openalex.org/C28761237","wikidata":"https://www.wikidata.org/wiki/Q7805321","display_name":"Time horizon","level":2,"score":0.55047166},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5328204},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.50290316},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.49751452},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.47324687},{"id":"https://openalex.org/C158485040","wikidata":"https://www.wikidata.org/wiki/Q4778119","display_name":"Any-angle path planning","level":4,"score":0.45611143},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4364651},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.4276439},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38990536},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2857759},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2009454},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.13982981},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.09104732},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.0},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0},{"id":"https://openalex.org/C77805123","wikidata":"https://www.wikidata.org/wiki/Q161272","display_name":"Social psychology","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}],"mesh":[],"locations_count":1,"locations":[{"is_oa":true,"landing_page_url":"https://doi.org/10.5220/0005252104110419","pdf_url":null,"source":null,"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true}],"best_oa_location":{"is_oa":true,"landing_page_url":"https://doi.org/10.5220/0005252104110419","pdf_url":null,"source":null,"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true},"sustainable_development_goals":[{"score":0.76,"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities"}],"grants":[],"datasets":[],"versions":[],"referenced_works_count":19,"referenced_works":["https://openalex.org/W1603644918","https://openalex.org/W1809529033","https://openalex.org/W1922100564","https://openalex.org/W1984554327","https://openalex.org/W1984654899","https://openalex.org/W1985879170","https://openalex.org/W2003966310","https://openalex.org/W2045174204","https://openalex.org/W2047796056","https://openalex.org/W2053913299","https://openalex.org/W2079701338","https://openalex.org/W2113775403","https://openalex.org/W2126828687","https://openalex.org/W2133591555","https://openalex.org/W2157005019","https://openalex.org/W2296319761","https://openalex.org/W2536620281","https://openalex.org/W2987140221","https://openalex.org/W3099664902"],"related_works":["https://openalex.org/W4395071568","https://openalex.org/W4308080200","https://openalex.org/W3139139461","https://openalex.org/W2908094156","https://openalex.org/W2904203243","https://openalex.org/W2389896347","https://openalex.org/W2368795992","https://openalex.org/W2125569607","https://openalex.org/W2106119116","https://openalex.org/W2084091668"],"abstract_inverted_index":{"This":[0,67],"paper":[1],"presents":[2],"a":[3,7,13,48,51,83,93],"discrete":[4,52],"model":[5],"of":[6,24,34,38,54,79],"sensor":[8,42],"path":[9,37],"planning":[10,15],"problem,":[11],"with":[12],"long-term":[14],"horizon.":[16],"The":[17,41],"goal":[18],"is":[19,43,70],"to":[20,45,92],"minimize":[21],"the":[22,25,32,35,39,64,77,87,99],"covariance":[23],"reconstructed":[26],"structures":[27],"while":[28],"meeting":[29],"constraints":[30,58],"on":[31,47,86,104],"length":[33],"traversed":[36],"sensor.":[40],"restricted":[44],"move":[46],"graph":[49,65],"representing":[50],"set":[53],"configurations,":[55],"and":[56,90],"additional":[57],"can":[59],"be":[60],"incorporated":[61],"by":[62],"altering":[63],"connectivity.":[66],"combinatorial":[68],"problem":[69],"formulated":[71],"as":[72],"an":[73],"integer":[74],"semi-definite":[75],"program,":[76],"relaxation":[78],"which":[80],"provides":[81],"both":[82],"lower":[84],"bound":[85],"objective":[88],"cost":[89],"input":[91],"proposed":[94],"genetic":[95],"algorithm":[96],"for":[97],"solving":[98],"original":[100],"problem.":[101],"An":[102],"evaluation":[103],"synthetic":[105],"data":[106],"indicates":[107],"good":[108],"performance.":[109]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2240664703","counts_by_year":[{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":2}],"updated_date":"2024-12-30T02:42:58.905965","created_date":"2016-06-24"}