{"id":"https://openalex.org/W2119213448","doi":"https://doi.org/10.1109/cec.2010.5586224","title":"An Ant System algorithm for automated trajectory planning","display_name":"An Ant System algorithm for automated trajectory planning","publication_year":2010,"publication_date":"2010-07-01","ids":{"openalex":"https://openalex.org/W2119213448","doi":"https://doi.org/10.1109/cec.2010.5586224","mag":"2119213448"},"language":"en","primary_location":{"id":"doi:10.1109/cec.2010.5586224","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2010.5586224","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Congress on Evolutionary Computation","raw_type":"proceedings-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/A5114374866","display_name":"Matteo Ceriotti","orcid":"https://orcid.org/0000-0001-6819-7178"},"institutions":[{"id":"https://openalex.org/I181647926","display_name":"University of Strathclyde","ror":"https://ror.org/00n3w3b69","country_code":"GB","type":"education","lineage":["https://openalex.org/I181647926"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Matteo Ceriotti","raw_affiliation_strings":["Advanced Space Concepts Laboratory, Department of Mechanical Engineering, University of Strathclyde, Glasgow, UK","Advanced Space Concepts Laboratory, Department of Mechanical Engineering, University of Strathclyde, Glasgow, G1 1XJ, UK"],"affiliations":[{"raw_affiliation_string":"Advanced Space Concepts Laboratory, Department of Mechanical Engineering, University of Strathclyde, Glasgow, UK","institution_ids":["https://openalex.org/I181647926"]},{"raw_affiliation_string":"Advanced Space Concepts Laboratory, Department of Mechanical Engineering, University of Strathclyde, Glasgow, G1 1XJ, UK","institution_ids":["https://openalex.org/I181647926"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5036136239","display_name":"Massimiliano Vasile","orcid":"https://orcid.org/0000-0001-8302-6465"},"institutions":[{"id":"https://openalex.org/I7882870","display_name":"University of Glasgow","ror":"https://ror.org/00vtgdb53","country_code":"GB","type":"education","lineage":["https://openalex.org/I7882870"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Massimiliano Vasile","raw_affiliation_strings":["Space Advanced Research Team, Department of Aerospace Engineering, University of Glasgow, Glasgow, UK","Space Advanced Research Team, Department of Aerospace Engineering, University of Glasgow, James Watt South Building, G12 8QQ, Glasgow, UK"],"affiliations":[{"raw_affiliation_string":"Space Advanced Research Team, Department of Aerospace Engineering, University of Glasgow, Glasgow, UK","institution_ids":["https://openalex.org/I7882870"]},{"raw_affiliation_string":"Space Advanced Research Team, Department of Aerospace Engineering, University of Glasgow, James Watt South Building, G12 8QQ, Glasgow, UK","institution_ids":["https://openalex.org/I7882870"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5114374866"],"corresponding_institution_ids":["https://openalex.org/I181647926"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.18468083,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"20","issue":null,"first_page":"1","last_page":"8"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9997000098228455,"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.9997000098228455,"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.9879000186920166,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9871000051498413,"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/computer-science","display_name":"Computer science","score":0.6590893268585205},{"id":"https://openalex.org/keywords/tabu-search","display_name":"Tabu search","score":0.6498533487319946},{"id":"https://openalex.org/keywords/ant-colony-optimization-algorithms","display_name":"Ant colony optimization algorithms","score":0.6162306070327759},{"id":"https://openalex.org/keywords/trajectory","display_name":"Trajectory","score":0.6043975353240967},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5694407224655151},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.5124083161354065},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.49522367119789124},{"id":"https://openalex.org/keywords/plan","display_name":"Plan (archaeology)","score":0.4535086154937744},{"id":"https://openalex.org/keywords/dependency","display_name":"Dependency (UML)","score":0.423566073179245},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.3106629252433777},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2858743667602539},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.18492916226387024}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6590893268585205},{"id":"https://openalex.org/C123370116","wikidata":"https://www.wikidata.org/wiki/Q1424540","display_name":"Tabu search","level":2,"score":0.6498533487319946},{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.6162306070327759},{"id":"https://openalex.org/C13662910","wikidata":"https://www.wikidata.org/wiki/Q193139","display_name":"Trajectory","level":2,"score":0.6043975353240967},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5694407224655151},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.5124083161354065},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.49522367119789124},{"id":"https://openalex.org/C2776505523","wikidata":"https://www.wikidata.org/wiki/Q4785468","display_name":"Plan (archaeology)","level":2,"score":0.4535086154937744},{"id":"https://openalex.org/C19768560","wikidata":"https://www.wikidata.org/wiki/Q320727","display_name":"Dependency (UML)","level":2,"score":0.423566073179245},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.3106629252433777},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2858743667602539},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.18492916226387024},{"id":"https://openalex.org/C166957645","wikidata":"https://www.wikidata.org/wiki/Q23498","display_name":"Archaeology","level":1,"score":0.0},{"id":"https://openalex.org/C95457728","wikidata":"https://www.wikidata.org/wiki/Q309","display_name":"History","level":0,"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/C1276947","wikidata":"https://www.wikidata.org/wiki/Q333","display_name":"Astronomy","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/cec.2010.5586224","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2010.5586224","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Congress on Evolutionary Computation","raw_type":"proceedings-article"},{"id":"pmh:oai:eprints.gla.ac.uk:69575","is_oa":false,"landing_page_url":"http://eprints.gla.ac.uk/69575/","pdf_url":null,"source":{"id":"https://openalex.org/S4210235606","display_name":"ENLIGHTEN (Jurnal Bimbingan dan Konseling Islam)","issn_l":"2622-8912","issn":["2622-8912","2622-8920"],"is_oa":false,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Conference Proceedings"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320320337","display_name":"University of Glasgow","ror":"https://ror.org/00vtgdb53"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W67541699","https://openalex.org/W1583428626","https://openalex.org/W1874332895","https://openalex.org/W1954404225","https://openalex.org/W2011649121","https://openalex.org/W2029319864","https://openalex.org/W2032506563","https://openalex.org/W2039066122","https://openalex.org/W2079304089","https://openalex.org/W2081226403","https://openalex.org/W2093456124","https://openalex.org/W2126105956","https://openalex.org/W2154487696","https://openalex.org/W2154929945","https://openalex.org/W2167159964","https://openalex.org/W2472106845","https://openalex.org/W3023540311","https://openalex.org/W3150522120","https://openalex.org/W4285719527","https://openalex.org/W4292408555","https://openalex.org/W6602764596","https://openalex.org/W6720318158","https://openalex.org/W7008784903"],"related_works":["https://openalex.org/W2224940485","https://openalex.org/W2168643831","https://openalex.org/W2075514833","https://openalex.org/W2381791171","https://openalex.org/W4247343174","https://openalex.org/W1987877777","https://openalex.org/W2366189044","https://openalex.org/W2365741636","https://openalex.org/W2011733276","https://openalex.org/W4243489490"],"abstract_inverted_index":{"The":[0,14,58,76,110],"paper":[1],"presents":[2],"an":[3],"Ant":[4,84],"System":[5,85],"based":[6,99],"algorithm":[7,15,60,77],"to":[8,18,83,113],"optimally":[9],"plan":[10],"multi-gravity":[11,41],"assist":[12,42],"trajectories.":[13],"is":[16,25],"designed":[17],"solve":[19],"planning":[20],"problems":[21],"in":[22,104],"which":[23],"there":[24],"a":[26,72,97,105,117,122],"strong":[27],"dependency":[28],"of":[29,40,47,55,119,121],"one":[30],"decision":[31,98],"on":[32,100,116],"all":[33,63],"the":[34,38,45,53,64,79,101],"previously-made":[35],"decisions.":[36],"In":[37],"case":[39],"trajectory":[43,124],"planning,":[44],"number":[46,54,118],"possible":[48,65],"paths":[49,66],"grows":[50],"exponentially":[51],"with":[52],"planetary":[56,92],"encounters.":[57],"proposed":[59],"avoids":[61],"scanning":[62],"and":[67,107,130],"provides":[68],"good":[69],"results":[70],"at":[71,90],"low":[73],"computational":[74],"cost.":[75],"builds":[78],"solution":[80],"incrementally":[81],"according":[82],"paradigms.":[86],"Unlike":[87],"standard":[88],"ACO,":[89],"every":[91],"encounter,":[93],"each":[94],"ant":[95],"makes":[96],"information":[102],"stored":[103],"tabu":[106],"feasible":[108],"list.":[109],"approach":[111],"demonstrated":[112],"be":[114],"competitive,":[115],"instances":[120],"real":[123],"design":[125],"problem,":[126],"against":[127],"known":[128],"GA":[129],"PSO":[131],"algorithms.":[132]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}