{"id":"https://openalex.org/W4401635602","doi":"https://doi.org/10.3233/jcm-247518","title":"Optimization method for collision avoidance paths of inland ships based on improved ant colony algorithm","display_name":"Optimization method for collision avoidance paths of inland ships based on improved ant colony algorithm","publication_year":2024,"publication_date":"2024-07-01","ids":{"openalex":"https://openalex.org/W4401635602","doi":"https://doi.org/10.3233/jcm-247518"},"language":"en","primary_location":{"id":"doi:10.3233/jcm-247518","is_oa":false,"landing_page_url":"https://doi.org/10.3233/jcm-247518","pdf_url":null,"source":{"id":"https://openalex.org/S2765058733","display_name":"Journal of Computational Methods in Sciences and Engineering","issn_l":"1472-7978","issn":["1472-7978","1875-8983"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318577","host_organization_name":"IOS Press","host_organization_lineage":["https://openalex.org/P4310318577"],"host_organization_lineage_names":["IOS Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Computational Methods in Sciences 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/A5038342946","display_name":"Jiaofeng Wu","orcid":null},"institutions":[{"id":"https://openalex.org/I4210120302","display_name":"Shunde Polytechnic","ror":"https://ror.org/01w9d4603","country_code":"CN","type":"education","lineage":["https://openalex.org/I4210120302"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Jiaofeng Wu","raw_affiliation_strings":["Advanced Manufacturing Academy, Guangdong Polytechnic of Environmental Protection Engineering, Foshan, China","E-mail:"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Advanced Manufacturing Academy, Guangdong Polytechnic of Environmental Protection Engineering, Foshan, China","institution_ids":["https://openalex.org/I4210120302"]},{"raw_affiliation_string":"E-mail:","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5038342946"],"corresponding_institution_ids":["https://openalex.org/I4210120302"],"apc_list":{"value":4150,"currency":"USD","value_usd":4150},"apc_paid":null,"fwci":0.2041,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.48166055,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"24","issue":"4-5","first_page":"2831","last_page":"2845"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11622","display_name":"Maritime Navigation and Safety","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/2212","display_name":"Ocean Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11622","display_name":"Maritime Navigation and Safety","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/2212","display_name":"Ocean 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/T11223","display_name":"Maritime Ports and Logistics","score":0.9621999859809875,"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9607999920845032,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/ant-colony-optimization-algorithms","display_name":"Ant colony optimization algorithms","score":0.8435139656066895},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.7160916328430176},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6488820910453796},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5849156975746155},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5842185616493225},{"id":"https://openalex.org/keywords/random-tree","display_name":"Random tree","score":0.577036440372467},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.4907887876033783},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4854948818683624},{"id":"https://openalex.org/keywords/suurballes-algorithm","display_name":"Suurballe's algorithm","score":0.4804398715496063},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4738845229148865},{"id":"https://openalex.org/keywords/ant-colony","display_name":"Ant colony","score":0.4656658172607422},{"id":"https://openalex.org/keywords/yens-algorithm","display_name":"Yen's algorithm","score":0.44463565945625305},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.3205300569534302},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2893432676792145},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.16184863448143005},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.12015897035598755}],"concepts":[{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.8435139656066895},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.7160916328430176},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6488820910453796},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5849156975746155},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5842185616493225},{"id":"https://openalex.org/C2776839635","wikidata":"https://www.wikidata.org/wiki/Q14942679","display_name":"Random tree","level":4,"score":0.577036440372467},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.4907887876033783},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4854948818683624},{"id":"https://openalex.org/C98779529","wikidata":"https://www.wikidata.org/wiki/Q7650417","display_name":"Suurballe's algorithm","level":5,"score":0.4804398715496063},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4738845229148865},{"id":"https://openalex.org/C60891933","wikidata":"https://www.wikidata.org/wiki/Q796575","display_name":"Ant colony","level":3,"score":0.4656658172607422},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.44463565945625305},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3205300569534302},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2893432676792145},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.16184863448143005},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.12015897035598755},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","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":[{"id":"doi:10.3233/jcm-247518","is_oa":false,"landing_page_url":"https://doi.org/10.3233/jcm-247518","pdf_url":null,"source":{"id":"https://openalex.org/S2765058733","display_name":"Journal of Computational Methods in Sciences and Engineering","issn_l":"1472-7978","issn":["1472-7978","1875-8983"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318577","host_organization_name":"IOS Press","host_organization_lineage":["https://openalex.org/P4310318577"],"host_organization_lineage_names":["IOS Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Computational Methods in Sciences and Engineering","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W2128350432","https://openalex.org/W2952659054","https://openalex.org/W3009301040","https://openalex.org/W3011987435","https://openalex.org/W3020860072","https://openalex.org/W3080091903","https://openalex.org/W3082859582","https://openalex.org/W3090072336","https://openalex.org/W3118696800","https://openalex.org/W3127696261","https://openalex.org/W3197871554","https://openalex.org/W3198077326","https://openalex.org/W3199169708","https://openalex.org/W4200182717","https://openalex.org/W4200524277","https://openalex.org/W4205432429","https://openalex.org/W4205781101","https://openalex.org/W4205792762","https://openalex.org/W4206494026","https://openalex.org/W4285891035","https://openalex.org/W4296311830","https://openalex.org/W6800580890"],"related_works":["https://openalex.org/W2382831994","https://openalex.org/W1817053572","https://openalex.org/W2314157120","https://openalex.org/W3015233512","https://openalex.org/W3023359981","https://openalex.org/W2339073167","https://openalex.org/W4253588386","https://openalex.org/W2978166001","https://openalex.org/W2810620529","https://openalex.org/W2136320479"],"abstract_inverted_index":{"With":[0],"the":[1,15,28,56,59,64,69,72,81,87,94,110,143,153,180,190,194,204,218,224,233,245,263,267,280,288,296],"rise":[2],"of":[3,17,30,58,86,199,240,291,298],"artificial":[4,41,88],"intelligence,":[5,19],"ships":[6],"are":[7],"gradually":[8],"becoming":[9],"intelligent.":[10],"Ship":[11],"path":[12,47,99,192,201,206,242,247,264],"planning,":[13],"as":[14],"foundation":[16],"ship":[18,31],"has":[20,272],"become":[21],"a":[22,35,107,208,249],"current":[23],"research":[24],"hotspot.":[25],"To":[26],"achieve":[27,97],"planning":[29,48],"collision":[32],"avoidance":[33],"paths,":[34],"hybrid":[36,111,162,234,268],"ant":[37,73,112,163,182,235,269,282],"colony":[38,74,113,164,183,236,270,283],"algorithm":[39,75,95,127,160,165,184,271,284],"and":[40,63,117,120,132,146,161,169,187,214,221,232,255],"potential":[42,89],"field":[43,90],"for":[44,55,80,203,217,244],"optimal":[45,191,205,246,292],"safety":[46],"was":[49],"proposed.":[50],"The":[51,101,197,238,275],"model":[52],"makes":[53,78],"up":[54,79],"disadvantages":[57],"slow":[60],"convergence":[61],"rate":[62],"easy":[65],"local":[66],"optimum.":[67],"At":[68],"same":[70],"time,":[71],"in":[76,106,193,207,248],"turn":[77],"poor":[82],"global":[83],"search":[84,289],"ability":[85],"method,":[91],"so":[92],"that":[93,105,179,262,279],"can":[96,188,259,285],"accurate":[98],"planning.":[100],"test":[102],"results":[103,277],"show":[104,278],"simple":[108,209],"environment,":[109],"algorithm,":[114,119,223,231],"improved":[115,121,144,154,219,225],"tangent":[116,145,220],"Dijkstra":[118,147,222],"fast":[122,155,186,226],"extended":[123],"random":[124,157,228],"tree":[125,158,229],"*":[126,159,230],"iterated":[128],"about":[129,167],"7,":[130],"25,":[131],"40":[133,168],"times":[134,171],"respectively":[135,172],"before":[136],"starting":[137],"to":[138,173],"converge;":[139],"In":[140],"complex":[141,250],"environments,":[142],"algorithms":[148],"do":[149],"not":[150],"converge,":[151],"while":[152,294],"expanding":[156,227],"iterate":[166],"8":[170],"begin":[174],"convergence.":[175],"It":[176,258],"is":[177,211,252],"clear":[178],"mixed":[181,281],"converges":[185],"obtain":[189],"shortest":[195],"time.":[196],"number":[198,239],"unsafe":[200,241],"points":[202,243],"environment":[210,251],"6,":[212],"1,":[213],"0,":[215,256],"respectively,":[216],"algorithm;":[237],"9,":[253],"3,":[254],"respectively;":[257],"be":[260],"seen":[261],"planned":[265],"by":[266],"higher":[273],"security.":[274],"above":[276],"effectively":[286],"shorten":[287],"time":[290],"paths":[293],"improving":[295],"security":[297],"pathways.":[299]},"counts_by_year":[{"year":2024,"cited_by_count":1}],"updated_date":"2026-08-21T09:56:20.448147","created_date":"2025-10-10T00:00:00"}