{"id":"https://openalex.org/W2789476606","doi":"https://doi.org/10.1109/spac.2017.8304341","title":"An ant colony optimization algorithm for three dimensional path planning","display_name":"An ant colony optimization algorithm for three dimensional path planning","publication_year":2017,"publication_date":"2017-12-01","ids":{"openalex":"https://openalex.org/W2789476606","doi":"https://doi.org/10.1109/spac.2017.8304341","mag":"2789476606"},"language":"en","primary_location":{"id":"doi:10.1109/spac.2017.8304341","is_oa":false,"landing_page_url":"https://doi.org/10.1109/spac.2017.8304341","pdf_url":null,"source":{"id":"https://openalex.org/S4306498208","display_name":"2017 International Conference on Security, Pattern Analysis, and Cybernetics (SPAC)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 International Conference on Security, Pattern Analysis, and Cybernetics (SPAC)","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/A5067635231","display_name":"Lanfeng Zhou","orcid":"https://orcid.org/0000-0003-4819-867X"},"institutions":[{"id":"https://openalex.org/I67001856","display_name":"Shanghai Institute of Technology","ror":"https://ror.org/00fjzqj15","country_code":"CN","type":"education","lineage":["https://openalex.org/I67001856"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Lanfeng Zhou","raw_affiliation_strings":["School of Computer Science and Information Engineering, Shanghai Institute of Technology Shanghai, China"],"affiliations":[{"raw_affiliation_string":"School of Computer Science and Information Engineering, Shanghai Institute of Technology Shanghai, China","institution_ids":["https://openalex.org/I67001856"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5066937150","display_name":"Weijie Qian","orcid":null},"institutions":[{"id":"https://openalex.org/I67001856","display_name":"Shanghai Institute of Technology","ror":"https://ror.org/00fjzqj15","country_code":"CN","type":"education","lineage":["https://openalex.org/I67001856"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Weijie Qian","raw_affiliation_strings":["School of Computer Science and Information Engineering, Shanghai Institute of Technology Shanghai, China"],"affiliations":[{"raw_affiliation_string":"School of Computer Science and Information Engineering, Shanghai Institute of Technology Shanghai, China","institution_ids":["https://openalex.org/I67001856"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101102389","display_name":"Guogang Cao","orcid":null},"institutions":[{"id":"https://openalex.org/I67001856","display_name":"Shanghai Institute of Technology","ror":"https://ror.org/00fjzqj15","country_code":"CN","type":"education","lineage":["https://openalex.org/I67001856"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Guogang Cao","raw_affiliation_strings":["School of Computer Science and Information Engineering, Shanghai Institute of Technology Shanghai, China"],"affiliations":[{"raw_affiliation_string":"School of Computer Science and Information Engineering, Shanghai Institute of Technology Shanghai, China","institution_ids":["https://openalex.org/I67001856"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5067635231"],"corresponding_institution_ids":["https://openalex.org/I67001856"],"apc_list":null,"apc_paid":null,"fwci":0.2955,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.67188406,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"30","issue":null,"first_page":"564","last_page":"568"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9975000023841858,"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.9975000023841858,"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/T11106","display_name":"Data Management and Algorithms","score":0.9764999747276306,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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.9745000004768372,"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/ant-colony-optimization-algorithms","display_name":"Ant colony optimization algorithms","score":0.8260514736175537},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.6200434565544128},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5642021298408508},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5618826150894165},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5572559833526611},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.5503489375114441},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5481562614440918},{"id":"https://openalex.org/keywords/randomness","display_name":"Randomness","score":0.535955011844635},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.5087164044380188},{"id":"https://openalex.org/keywords/selection","display_name":"Selection (genetic algorithm)","score":0.5004432201385498},{"id":"https://openalex.org/keywords/mobile-robot","display_name":"Mobile robot","score":0.4529499113559723},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.42103564739227295},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3027559518814087},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2875896096229553},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.22817599773406982}],"concepts":[{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.8260514736175537},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6200434565544128},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5642021298408508},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5618826150894165},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5572559833526611},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.5503489375114441},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5481562614440918},{"id":"https://openalex.org/C125112378","wikidata":"https://www.wikidata.org/wiki/Q176640","display_name":"Randomness","level":2,"score":0.535955011844635},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5087164044380188},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.5004432201385498},{"id":"https://openalex.org/C19966478","wikidata":"https://www.wikidata.org/wiki/Q4810574","display_name":"Mobile robot","level":3,"score":0.4529499113559723},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.42103564739227295},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3027559518814087},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2875896096229553},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.22817599773406982},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/spac.2017.8304341","is_oa":false,"landing_page_url":"https://doi.org/10.1109/spac.2017.8304341","pdf_url":null,"source":{"id":"https://openalex.org/S4306498208","display_name":"2017 International Conference on Security, Pattern Analysis, and Cybernetics (SPAC)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 International Conference on Security, Pattern Analysis, and Cybernetics (SPAC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","score":0.7200000286102295,"id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W2254308695","https://openalex.org/W2298605637","https://openalex.org/W2350455978","https://openalex.org/W2392880752","https://openalex.org/W2394294774","https://openalex.org/W2523202702","https://openalex.org/W2929437231","https://openalex.org/W6697869303"],"related_works":["https://openalex.org/W1904098742","https://openalex.org/W3158921809","https://openalex.org/W2161428574","https://openalex.org/W2077416514","https://openalex.org/W2618632915","https://openalex.org/W4292862729","https://openalex.org/W2170661558","https://openalex.org/W2999143598","https://openalex.org/W2593985399","https://openalex.org/W2150982344"],"abstract_inverted_index":{"The":[0,16,51,92],"path":[1,49,55,72,108],"planning":[2],"problem":[3],"of":[4,19,28,36,46,54,68,89,95,105],"mobile":[5],"robot":[6],"in":[7,13,57,82],"three":[8],"dimension":[9],"environment":[10],"is":[11,22,41,60,97],"studied":[12],"this":[14],"paper.":[15],"initial":[17],"pheromone":[18,96],"the":[20,25,44,66,71,79,86,90,103,106,110,116],"algorithm":[21],"set.":[23],"Considering":[24],"selection":[26,73],"strategy":[27],"ant":[29],"colony":[30],"algorithm,":[31],"a":[32],"dynamic":[33],"change":[34],"relation":[35],"q":[37],"<sub":[38],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[39],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">0</sub>":[40],"established":[42],"by":[43,115],"number":[45],"iterations":[47],"and":[48,109],"distance.":[50],"influence":[52],"factor":[53],"distance":[56],"heuristic":[58],"function":[59],"introduced.":[61],"In":[62],"order":[63,83],"to":[64,84],"improve":[65,85],"randomness":[67],"route":[69],"choice,":[70],"rule":[74],"has":[75],"been":[76],"improved.":[77],"At":[78],"same":[80],"time,":[81],"convergence":[87],"speed":[88],"algorithm.":[91,118],"penalty":[93],"mechanism":[94],"adopted.":[98],"Simulation":[99],"results":[100],"show":[101],"that":[102],"length":[104],"3D":[107],"search":[111],"efficiency":[112],"are":[113],"improved":[114,117]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}