{"id":"https://openalex.org/W7225329761","doi":"https://doi.org/10.21203/rs.3.rs-11449983/v1","title":"A gravity search algorithm with a distance-fitness evaluation strategy for path planning","display_name":"A gravity search algorithm with a distance-fitness evaluation strategy for path planning","publication_year":2026,"publication_date":"2026-11-05","ids":{"openalex":"https://openalex.org/W7225329761","doi":"https://doi.org/10.21203/rs.3.rs-11449983/v1"},"language":"en","primary_location":{"id":"doi:10.21203/rs.3.rs-11449983/v1","doi":"https://doi.org/10.21203/rs.3.rs-11449983/v1","is_oa":true,"landing_page_url":"https://doi.org/10.21203/rs.3.rs-11449983/v1","pdf_url":"https://www.researchsquare.com/article/rs-11449983/latest.pdf","source":{"id":"https://openalex.org/S4306525896","display_name":"Research Square","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Research Square","raw_type":"posted-content"},"volume":null,"type":"preprint","is_traditional":true,"indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://www.researchsquare.com/article/rs-11449983/latest.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5102125834","display_name":"Zhichao Feng","orcid":"https://orcid.org/0009-0008-5292-3743","observed_orcids":["https://orcid.org/0009-0008-5292-3743"]},"institutions":[{"id":"https://openalex.org/I4405254957","display_name":"Guilin Institute of Information Technology","ror":"https://ror.org/02ed17502","country_code":"CN","type":"education","lineage":["https://openalex.org/I4405254957"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Zhichao Feng","raw_affiliation_strings":["Guilin Institute of Information Technology"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Guilin Institute of Information Technology","institution_ids":["https://openalex.org/I4405254957"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5160880838","display_name":"Jian Sui","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I4405254957","display_name":"Guilin Institute of Information Technology","ror":"https://ror.org/02ed17502","country_code":"CN","type":"education","lineage":["https://openalex.org/I4405254957"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Jian Sui","raw_affiliation_strings":["Guilin Institute of Information Technology"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Guilin Institute of Information Technology","institution_ids":["https://openalex.org/I4405254957"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5048913103","display_name":"Zhenzhen Luo","orcid":"https://orcid.org/0000-0002-1137-6818","observed_orcids":["https://orcid.org/0000-0002-1137-6818"]},"institutions":[{"id":"https://openalex.org/I4405254957","display_name":"Guilin Institute of Information Technology","ror":"https://ror.org/02ed17502","country_code":"CN","type":"education","lineage":["https://openalex.org/I4405254957"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Zhenzhen Luo","raw_affiliation_strings":["Guilin Institute of Information Technology"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Guilin Institute of Information Technology","institution_ids":["https://openalex.org/I4405254957"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I4405254957"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":1.0,"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"}},"topics":[{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":1.0,"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/T11946","display_name":"Antenna Design and Optimization","score":0.0,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic 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/T12784","display_name":"Modular Robots and Swarm Intelligence","score":0.0,"subfield":{"id":"https://openalex.org/subfields/2210","display_name":"Mechanical 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/gravitational-search-algorithm","display_name":"gravitational search algorithm","score":0.9929999709129333},{"id":"https://openalex.org/keywords/swarm-intelligence","display_name":"swarm intelligence","score":0.652999997138977},{"id":"https://openalex.org/keywords/premature-convergence","display_name":"premature convergence","score":0.7509999871253967},{"id":"https://openalex.org/keywords/exploration-exploitation-trade-off","display_name":"exploration-exploitation balance","score":0.9589999914169312},{"id":"https://openalex.org/keywords/population-diversity","display_name":"population diversity","score":0.9700000286102295},{"id":"https://openalex.org/keywords/local-optima-avoidance","display_name":"local optima avoidance","score":0.8700000047683716},{"id":"https://openalex.org/keywords/uav-path-planning","display_name":"UAV path planning","score":0.875},{"id":"https://openalex.org/keywords/metaheuristic-optimization","display_name":"metaheuristic optimization","score":0.7839999794960022}],"concepts":[{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.6804999709129333},{"id":"https://openalex.org/C85617194","wikidata":"https://www.wikidata.org/wiki/Q2072794","display_name":"Particle swarm optimization","level":2,"score":0.65420001745224},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.616599977016449},{"id":"https://openalex.org/C2908647359","wikidata":"https://www.wikidata.org/wiki/Q2625603","display_name":"Population","level":2,"score":0.5633999705314636},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.5156000256538391},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5102999806404114},{"id":"https://openalex.org/C58758708","wikidata":"https://www.wikidata.org/wiki/Q7240233","display_name":"Premature convergence","level":3,"score":0.4537000060081482},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4442000091075897},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.42500001192092896},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.4088999927043915},{"id":"https://openalex.org/C119487961","wikidata":"https://www.wikidata.org/wiki/Q863960","display_name":"Swarm intelligence","level":3,"score":0.39660000801086426},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.38960000872612},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.3671000003814697},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.328000009059906},{"id":"https://openalex.org/C57869625","wikidata":"https://www.wikidata.org/wiki/Q1783502","display_name":"Rate of convergence","level":3,"score":0.3246000111103058},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.3183000087738037},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.3003999888896942},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2838999927043915},{"id":"https://openalex.org/C122357587","wikidata":"https://www.wikidata.org/wiki/Q6934508","display_name":"Multi-swarm optimization","level":3,"score":0.2791000008583069},{"id":"https://openalex.org/C2989549987","wikidata":"https://www.wikidata.org/wiki/Q350882","display_name":"Route planning","level":2,"score":0.274399995803833},{"id":"https://openalex.org/C181335050","wikidata":"https://www.wikidata.org/wiki/Q14915018","display_name":"Swarm behaviour","level":2,"score":0.27399998903274536},{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.2667999863624573},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.2522999942302704},{"id":"https://openalex.org/C2781039887","wikidata":"https://www.wikidata.org/wiki/Q1391724","display_name":"Factor (programming language)","level":2,"score":0.25099998712539673}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.21203/rs.3.rs-11449983/v1","doi":"https://doi.org/10.21203/rs.3.rs-11449983/v1","is_oa":true,"landing_page_url":"https://doi.org/10.21203/rs.3.rs-11449983/v1","pdf_url":"https://www.researchsquare.com/article/rs-11449983/latest.pdf","source":{"id":"https://openalex.org/S4306525896","display_name":"Research Square","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Research Square","raw_type":"posted-content"}],"best_oa_location":{"id":"doi:10.21203/rs.3.rs-11449983/v1","doi":"https://doi.org/10.21203/rs.3.rs-11449983/v1","is_oa":true,"landing_page_url":"https://doi.org/10.21203/rs.3.rs-11449983/v1","pdf_url":"https://www.researchsquare.com/article/rs-11449983/latest.pdf","source":{"id":"https://openalex.org/S4306525896","display_name":"Research Square","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Research Square","raw_type":"posted-content"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320327522","display_name":"Guangxi University","ror":"https://ror.org/02c9qn167"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7225329761.pdf","grobid_xml":"https://content.openalex.org/works/W7225329761.grobid-xml"},"referenced_works_count":27,"referenced_works":["https://openalex.org/W1967402817","https://openalex.org/W2064015166","https://openalex.org/W2069790524","https://openalex.org/W2072955302","https://openalex.org/W2915596699","https://openalex.org/W2922792316","https://openalex.org/W3011391989","https://openalex.org/W4321769872","https://openalex.org/W4375944979","https://openalex.org/W4402560500","https://openalex.org/W4407596605","https://openalex.org/W4411399382","https://openalex.org/W4411874606","https://openalex.org/W4415336633","https://openalex.org/W4416688067","https://openalex.org/W7116792786","https://openalex.org/W7124645784","https://openalex.org/W7133201248","https://openalex.org/W7135189715","https://openalex.org/W7135216289","https://openalex.org/W7154624650","https://openalex.org/W7160408099","https://openalex.org/W7161756215","https://openalex.org/W7162552966","https://openalex.org/W7163210351","https://openalex.org/W7164918153","https://openalex.org/W7164922881"],"related_works":["https://openalex.org/W2774396286","https://openalex.org/W4394829334","https://openalex.org/W2973209040","https://openalex.org/W3027513580","https://openalex.org/W2571662100","https://openalex.org/W2753329290","https://openalex.org/W4391424679","https://openalex.org/W3011391989","https://openalex.org/W2990846699","https://openalex.org/W2989054917"],"abstract_inverted_index":{"Abstract":[0],"gravity":[1,24,90],"Search":[2],"Algorithm":[3],"(GSA)":[4],"is":[5,141],"a":[6,66,69,74],"swarm":[7],"intelligence":[8],"optimization":[9,57,179],"algorithm":[10,116],"inspired":[11],"by":[12],"Newton's":[13],"law":[14],"of":[15,88,112,134],"universal":[16],"gravitation.":[17],"It":[18,172],"uses":[19],"particle":[20],"masses":[21],"and":[22,29,50,73,98,109,130,147,155],"interparticle":[23],"forces":[25],"to":[26,117,121],"transmit":[27],"information":[28],"evolve":[30],"candidate":[31],"solutions.":[32],"Although":[33],"the":[34,85,89,94,106,115,122,132],"traditional":[35],"GSA":[36,67,145],"has":[37],"been":[38],"successfully":[39],"applied":[40],"in":[41,137],"several":[42,144],"fields,":[43],"it":[44],"still":[45],"suffers":[46],"from":[47],"premature":[48],"convergence":[49],"limited":[51],"search":[52,120],"capability":[53],"when":[54],"solving":[55],"complex":[56],"problems.":[58,180],"To":[59],"address":[60],"these":[61],"limitations,":[62],"this":[63],"paper":[64],"proposes":[65],"with":[68],"self-adaptive":[70,81],"attenuation":[71,82],"factor":[72,83],"distance-fitness":[75,101],"evaluation":[76,102],"strategy,":[77],"termed":[78],"SDGSA.":[79],"The":[80,100,163],"regulates":[84],"decay":[86],"rate":[87],"constant,":[91],"thereby":[92],"improving":[93],"balance":[95],"between":[96],"exploration":[97],"exploitation.":[99],"strategy":[103,126],"assesses":[104],"both":[105],"spatial":[107],"distances":[108],"fitness":[110],"values":[111],"individuals,":[113],"allowing":[114],"adapt":[118],"its":[119,170],"population":[123,128],"distribution.":[124],"This":[125],"increases":[127],"diversity":[129],"reduces":[131],"likelihood":[133],"becoming":[135],"trapped":[136],"local":[138],"optima.":[139],"SDGSA":[140,168],"evaluated":[142],"against":[143],"variants":[146],"other":[148],"metaheuristic":[149],"algorithms":[150],"on":[151,177],"58":[152],"benchmark":[153,164],"functions":[154],"an":[156],"unmanned":[157],"aerial":[158],"vehicle":[159],"(UAV)":[160],"path-planning":[161],"problem.":[162],"results":[165],"show":[166],"that":[167],"outperforms":[169],"competitors.":[171],"also":[173],"achieves":[174],"high":[175],"accuracy":[176],"challenging":[178]},"counts_by_year":[],"updated_date":"2026-11-09T13:22:03.289127","created_date":"2026-11-06T00:00:00"}