乐胖代购免代理版

{"id":"https://openalex.org/W2944433607","doi":"https://doi.org/10.1109/sose.2019.00060","title":"Multi-region Coverage Path Planning for Heterogeneous Unmanned Aerial Vehicles Systems","display_name":"Multi-region Coverage Path Planning for Heterogeneous Unmanned Aerial Vehicles Systems","publication_year":2019,"publication_date":"2019-04-01","ids":{"openalex":"https://openalex.org/W2944433607","doi":"https://doi.org/10.1109/sose.2019.00060","mag":"2944433607"},"language":"en","primary_location":{"is_oa":false,"landing_page_url":"https://doi.org/10.1109/sose.2019.00060","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false},"type":"article","type_crossref":"proceedings-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/A5086071901","display_name":"Jinchao Chen","orcid":"https://orcid.org/0000-0001-6234-1001"},"institutions":[{"id":"https://openalex.org/I17145004","display_name":"Northwestern Polytechnical University","ror":"https://ror.org/01y0j0j86","country_code":"CN","type":"education","lineage":["https://openalex.org/I17145004"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Jinchao Chen","raw_affiliation_strings":["Department of Computer Science, Northwestern Polytechnical University, Xi'an, China"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Northwestern Polytechnical University, Xi'an, China","institution_ids":["https://openalex.org/I17145004"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5102162840","display_name":"Chenglie Du","orcid":null},"institutions":[{"id":"https://openalex.org/I17145004","display_name":"Northwestern Polytechnical University","ror":"https://ror.org/01y0j0j86","country_code":"CN","type":"education","lineage":["https://openalex.org/I17145004"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Chenglie Du","raw_affiliation_strings":["Department of Computer Science, Northwestern Polytechnical University, Xi'an, China"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Northwestern Polytechnical University, Xi'an, China","institution_ids":["https://openalex.org/I17145004"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100777696","display_name":"Lu Xu","orcid":"https://orcid.org/0000-0002-8054-2891"},"institutions":[{"id":"https://openalex.org/I17145004","display_name":"Northwestern Polytechnical University","ror":"https://ror.org/01y0j0j86","country_code":"CN","type":"education","lineage":["https://openalex.org/I17145004"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Xu Lu","raw_affiliation_strings":["Department of Computer Science, Northwestern Polytechnical University, Xi'an, China"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Northwestern Polytechnical University, Xi'an, China","institution_ids":["https://openalex.org/I17145004"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5002572745","display_name":"Keke Chen","orcid":"https://orcid.org/0000-0002-9996-156X"},"institutions":[{"id":"https://openalex.org/I17145004","display_name":"Northwestern Polytechnical University","ror":"https://ror.org/01y0j0j86","country_code":"CN","type":"education","lineage":["https://openalex.org/I17145004"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Keke Chen","raw_affiliation_strings":["Department of Computer Science, Northwestern Polytechnical University, Xi'an, China"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Northwestern Polytechnical University, Xi'an, China","institution_ids":["https://openalex.org/I17145004"]}]}],"institution_assertions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.218,"has_fulltext":true,"fulltext_origin":"ngrams","cited_by_count":23,"citation_normalized_percentile":{"value":0.841835,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":92,"max":93},"biblio":{"volume":null,"issue":null,"first_page":"356","last_page":"3565"},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":1.0,"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":1.0,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9885,"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"}},{"id":"https://openalex.org/T11133","display_name":"UAV Applications and Optimization","score":0.9759,"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/path-planning","display_name":"Path Planning","score":0.550991},{"id":"https://openalex.org/keywords/optimal-motion-planning","display_name":"Optimal Motion Planning","score":0.54963},{"id":"https://openalex.org/keywords/real-time-planning","display_name":"Real-Time Planning","score":0.508058},{"id":"https://openalex.org/keywords/any-angle-path-planning","display_name":"Any-angle path planning","score":0.41451275}],"concepts":[{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.8015783},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.70759946},{"id":"https://openalex.org/C2780598303","wikidata":"https://www.wikidata.org/wiki/Q65921492","display_name":"Flexibility (engineering)","level":2,"score":0.7075379},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.668067},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6177791},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5309203},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.50287},{"id":"https://openalex.org/C43214815","wikidata":"https://www.wikidata.org/wiki/Q7310987","display_name":"Reliability (semiconductor)","level":3,"score":0.4438702},{"id":"https://openalex.org/C158485040","wikidata":"https://www.wikidata.org/wiki/Q4778119","display_name":"Any-angle path planning","level":4,"score":0.41451275},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.41286695},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.18441325},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.18076274},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.15218267},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1367138},{"id":"https://openalex.org/C163258240","wikidata":"https://www.wikidata.org/wiki/Q25342","display_name":"Power (physics)","level":2,"score":0.08597028},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","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},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","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":false,"landing_page_url":"https://doi.org/10.1109/sose.2019.00060","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false}],"best_oa_location":null,"sustainable_development_goals":[],"grants":[],"datasets":[],"versions":[],"referenced_works_count":20,"referenced_works":["https://openalex.org/W171569338","https://openalex.org/W2023012601","https://openalex.org/W2036552332","https://openalex.org/W2044493395","https://openalex.org/W2083013127","https://openalex.org/W2094589562","https://openalex.org/W2107285275","https://openalex.org/W2108554593","https://openalex.org/W2150330813","https://openalex.org/W2163812848","https://openalex.org/W2267012268","https://openalex.org/W2283031475","https://openalex.org/W2296397633","https://openalex.org/W2327902530","https://openalex.org/W2328015724","https://openalex.org/W2388889658","https://openalex.org/W2391010461","https://openalex.org/W2609308222","https://openalex.org/W2790930275","https://openalex.org/W2889997676"],"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/W2359600231","https://openalex.org/W1987886368","https://openalex.org/W1660309994"],"abstract_inverted_index":{"Recently":[0],"unmanned":[1],"aerial":[2],"vehicles":[3],"(UAVs)":[4],"have":[5],"been":[6],"widely":[7],"adopted":[8],"by":[9],"military":[10],"and":[11,19,28,73,101,130,144,159],"civilian":[12],"applications":[13],"due":[14],"to":[15,76,114,141,145,155],"their":[16],"strong":[17],"autonomies":[18],"adaptabilities.":[20],"Although":[21],"UAVs":[22,90,100],"can":[23],"achieve":[24],"effective":[25],"cost":[26],"reduction":[27],"flexibility":[29],"enhancement":[30],"in":[31,43,50,91],"the":[32,83,97,125,131,157,162],"development":[33],"of":[34,66,99,161],"systems":[35],"with":[36,96],"search":[37],"or":[38],"surveillance":[39],"missions,":[40],"they":[41],"result":[42],"a":[44,60,69],"complex":[45],"path":[46,55,61,85],"planning":[47,56,86],"problem.":[48],"Especially":[49],"region":[51,93],"coverage":[52,54,84,118,147],"systems,":[53],"problem,":[57],"which":[58],"seeks":[59],"that":[62],"covers":[63],"all":[64],"regions":[65,129,143],"interest,":[67],"has":[68],"NP-Hard":[70],"computational":[71],"complexity":[72],"is":[74,112,139],"difficult":[75],"solve.":[77],"In":[78],"this":[79],"paper,":[80],"we":[81],"study":[82],"problem":[87],"for":[88,149],"heterogeneous":[89],"multiple":[92],"systems.":[94],"First,":[95],"models":[98],"regions,":[102,135],"an":[103,116,136],"exact":[104],"formulation":[105],"based":[106],"on":[107,128],"mixed":[108],"integer":[109],"linear":[110],"programming":[111],"presented":[113],"produce":[115],"optimal":[117],"path.":[119],"Then":[120],"taking":[121],"into":[122],"account":[123],"both":[124],"scanning":[126],"time":[127,133],"flight":[132],"between":[134],"efficient":[137],"heuristic":[138,164],"proposed":[140,163],"assign":[142],"obtain":[146],"orders":[148],"UAVs.":[150],"Finally,":[151],"experiments":[152],"are":[153],"conducted":[154],"show":[156],"reliability":[158],"efficiency":[160],"from":[165],"several":[166],"aspects.":[167]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2944433607","counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":7},{"year":2020,"cited_by_count":9}],"updated_date":"2024-12-05T19:09:26.286956","created_date":"2019-05-16"}