乐胖代购免代理版

{"id":"https://openalex.org/W2156116395","doi":"https://doi.org/10.1109/icra.2011.5980555","title":"Multi-goal feasible path planning using ant colony optimization","display_name":"Multi-goal feasible path planning using ant colony optimization","publication_year":2011,"publication_date":"2011-05-01","ids":{"openalex":"https://openalex.org/W2156116395","doi":"https://doi.org/10.1109/icra.2011.5980555","mag":"2156116395"},"language":"en","primary_location":{"is_oa":false,"landing_page_url":"https://doi.org/10.1109/icra.2011.5980555","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":true,"oa_status":"green","oa_url":"https://dspace.mit.edu/bitstream/1721.1/78597/1/Hover_Multi-goal.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5044251670","display_name":"Brendan Englot","orcid":"https://orcid.org/0000-0002-7966-2917"},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Brendan Englot","raw_affiliation_strings":["Department of Mechanical Engineering, Massachusetts Institute of Technology, Cambridge, MA, USA"],"affiliations":[{"raw_affiliation_string":"Department of Mechanical Engineering, Massachusetts Institute of Technology, Cambridge, MA, USA","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5043237290","display_name":"Franz S. Hover","orcid":null},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Franz Hover","raw_affiliation_strings":["Department of Mechanical Engineering, Massachusetts Institute of Technology, Cambridge, MA, USA"],"affiliations":[{"raw_affiliation_string":"Department of Mechanical Engineering, Massachusetts Institute of Technology, Cambridge, MA, USA","institution_ids":["https://openalex.org/I63966007"]}]}],"institution_assertions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.952,"has_fulltext":true,"fulltext_origin":"ngrams","cited_by_count":32,"citation_normalized_percentile":{"value":0.909364,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":92,"max":93},"biblio":{"volume":null,"issue":null,"first_page":"2255","last_page":"2260"},"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9962,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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.9947,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/start-point","display_name":"Start point","score":0.42933497},{"id":"https://openalex.org/keywords/ant-colony","display_name":"Ant colony","score":0.4124807}],"concepts":[{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.8768306},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.7693831},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.72311115},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.680128},{"id":"https://openalex.org/C2776650193","wikidata":"https://www.wikidata.org/wiki/Q264661","display_name":"Obstacle","level":2,"score":0.624319},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.58140427},{"id":"https://openalex.org/C140779682","wikidata":"https://www.wikidata.org/wiki/Q210868","display_name":"Sampling (signal processing)","level":3,"score":0.49622136},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.49410036},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.46043956},{"id":"https://openalex.org/C2779859299","wikidata":"https://www.wikidata.org/wiki/Q7602527","display_name":"Start point","level":3,"score":0.42933497},{"id":"https://openalex.org/C60891933","wikidata":"https://www.wikidata.org/wiki/Q796575","display_name":"Ant colony","level":3,"score":0.4124807},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.27382615},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.22497416},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.20844379},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.17690662},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.13850981},{"id":"https://openalex.org/C2987804222","wikidata":"https://www.wikidata.org/wiki/Q5376582","display_name":"End point","level":2,"score":0.082172036},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C106131492","wikidata":"https://www.wikidata.org/wiki/Q3072260","display_name":"Filter (signal processing)","level":2,"score":0.0},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0},{"id":"https://openalex.org/C31972630","wikidata":"https://www.wikidata.org/wiki/Q844240","display_name":"Computer vision","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":2,"locations":[{"is_oa":false,"landing_page_url":"https://doi.org/10.1109/icra.2011.5980555","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false},{"is_oa":true,"landing_page_url":"http://hdl.handle.net/1721.1/78597","pdf_url":"https://dspace.mit.edu/bitstream/1721.1/78597/1/Hover_Multi-goal.pdf","source":{"id":"https://openalex.org/S4306400425","display_name":"DSpace@MIT (Massachusetts Institute of Technology)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I63966007","host_organization_name":"Massachusetts Institute of Technology","host_organization_lineage":["https://openalex.org/I63966007"],"host_organization_lineage_names":["Massachusetts Institute of Technology"],"type":"repository"},"license":"cc-by-nc-sa","license_id":"https://openalex.org/licenses/cc-by-nc-sa","version":"submittedVersion","is_accepted":false,"is_published":false}],"best_oa_location":{"is_oa":true,"landing_page_url":"http://hdl.handle.net/1721.1/78597","pdf_url":"https://dspace.mit.edu/bitstream/1721.1/78597/1/Hover_Multi-goal.pdf","source":{"id":"https://openalex.org/S4306400425","display_name":"DSpace@MIT (Massachusetts Institute of Technology)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I63966007","host_organization_name":"Massachusetts Institute of Technology","host_organization_lineage":["https://openalex.org/I63966007"],"host_organization_lineage_names":["Massachusetts Institute of Technology"],"type":"repository"},"license":"cc-by-nc-sa","license_id":"https://openalex.org/licenses/cc-by-nc-sa","version":"submittedVersion","is_accepted":false,"is_published":false},"sustainable_development_goals":[{"display_name":"Life below water","score":0.59,"id":"https://metadata.un.org/sdg/14"}],"grants":[],"datasets":[],"versions":[],"referenced_works_count":24,"referenced_works":["https://openalex.org/W1429007086","https://openalex.org/W1573676079","https://openalex.org/W1598458388","https://openalex.org/W1603740384","https://openalex.org/W1976248618","https://openalex.org/W1988708442","https://openalex.org/W2008120994","https://openalex.org/W2079701338","https://openalex.org/W2086525021","https://openalex.org/W2097566786","https://openalex.org/W2107591285","https://openalex.org/W2120124147","https://openalex.org/W2120651143","https://openalex.org/W2128990851","https://openalex.org/W2133326355","https://openalex.org/W2138800545","https://openalex.org/W2145053972","https://openalex.org/W2148761022","https://openalex.org/W2154929945","https://openalex.org/W2157638946","https://openalex.org/W2748110852","https://openalex.org/W3104753760","https://openalex.org/W3147414854","https://openalex.org/W4292408555"],"related_works":["https://openalex.org/W4385871958","https://openalex.org/W4245157707","https://openalex.org/W2908391583","https://openalex.org/W2406404685","https://openalex.org/W2388326823","https://openalex.org/W2369428395","https://openalex.org/W2347951034","https://openalex.org/W2208777194","https://openalex.org/W1997193297","https://openalex.org/W1992891081"],"abstract_inverted_index":{"A":[0],"new":[1],"algorithm":[2,102],"for":[3,37,90,109],"solving":[4],"multi-goal":[5,33,62],"planning":[6,36,53,63,110],"problems":[7],"in":[8,65,111,119],"the":[9,25,43,79,82,100,107,120],"presence":[10],"of":[11,32,75,81,95],"obstacles":[12],"is":[13,47,56,85,103],"introduced.":[14],"We":[15],"extend":[16],"ant":[17,44],"colony":[18,45],"optimization":[19],"(ACO)":[20],"from":[21],"its":[22],"well-known":[23],"application,":[24],"traveling":[26],"salesman":[27],"problem":[28],"(TSP),":[29],"to":[30,105],"that":[31],"feasible":[34],"path":[35],"inspection":[38],"and":[39,78,125],"surveillance":[40],"applications.":[41],"Specifically,":[42],"framework":[46],"combined":[48],"with":[49,58],"a":[50,73,88],"sampling-based":[51,61],"point-to-point":[52],"algorithm;":[54],"this":[55],"compared":[57],"two":[59],"successful":[60],"algorithms":[64],"an":[66,116],"obstacle-filled":[67],"two-dimensional":[68],"environment.":[69],"Total":[70],"mission":[71,113],"time,":[72,114],"function":[74],"computational":[76,123],"cost":[77],"duration":[80],"planned":[83],"mission,":[84],"used":[86],"as":[87],"basis":[89],"comparison.":[91],"In":[92],"our":[93],"application":[94],"interest,":[96],"autonomous":[97],"underwater":[98],"inspections,":[99],"ACO":[101],"found":[104],"be":[106],"best-equipped":[108],"minimum":[112],"offering":[115],"interior":[117],"point":[118],"tradeoff":[121],"between":[122],"complexity":[124],"optimality.":[126]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2156116395","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":3},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":1}],"updated_date":"2024-12-13T01:21:11.619493","created_date":"2016-06-24"}