{"id":"https://openalex.org/W2053882594","doi":"https://doi.org/10.1109/cec.2012.6256142","title":"smartPATH: A hybrid ACO-GA algorithm for robot path planning","display_name":"smartPATH: A hybrid ACO-GA algorithm for robot path planning","publication_year":2012,"publication_date":"2012-06-01","ids":{"openalex":"https://openalex.org/W2053882594","doi":"https://doi.org/10.1109/cec.2012.6256142","mag":"2053882594"},"language":"en","primary_location":{"id":"doi:10.1109/cec.2012.6256142","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2012.6256142","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 IEEE Congress on Evolutionary Computation","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://zenodo.org/record/1266071","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5006849766","display_name":"I. Ch\u00e2ari","orcid":"https://orcid.org/0000-0002-8933-0166"},"institutions":[{"id":"https://openalex.org/I142899784","display_name":"University of Sfax","ror":"https://ror.org/04d4sd432","country_code":"TN","type":"education","lineage":["https://openalex.org/I142899784"]}],"countries":["TN"],"is_corresponding":false,"raw_author_name":"Imen Chaari","raw_affiliation_strings":["CES Research Unit, National School of Engineers of Sfax, University of Sfax, Tunisia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"CES Research Unit, National School of Engineers of Sfax, University of Sfax, Tunisia","institution_ids":["https://openalex.org/I142899784"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5024626195","display_name":"Anis Koub\u00e2a","orcid":"https://orcid.org/0000-0003-3787-7423"},"institutions":[{"id":"https://openalex.org/I240666556","display_name":"Imam Mohammad ibn Saud Islamic University","ror":"https://ror.org/05gxjyb39","country_code":"SA","type":"education","lineage":["https://openalex.org/I240666556"]},{"id":"https://openalex.org/I83863532","display_name":"Polytechnic Institute of Porto","ror":"https://ror.org/04988re48","country_code":"PT","type":"education","lineage":["https://openalex.org/I83863532"]}],"countries":["PT","SA"],"is_corresponding":false,"raw_author_name":"Anis Koubaa","raw_affiliation_strings":["CIS TER Research Unit, Polytechnic Institute of Porto (ISEP/IPP), Portugal","COINS Research Group, Al-Imam Muhammad ibn Saud Islamic University, Saudi Arabia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"CIS TER Research Unit, Polytechnic Institute of Porto (ISEP/IPP), Portugal","institution_ids":["https://openalex.org/I83863532"]},{"raw_affiliation_string":"COINS Research Group, Al-Imam Muhammad ibn Saud Islamic University, Saudi Arabia","institution_ids":["https://openalex.org/I240666556"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5032043599","display_name":"Hach\u00e9mi Bennaceur","orcid":null},"institutions":[{"id":"https://openalex.org/I240666556","display_name":"Imam Mohammad ibn Saud Islamic University","ror":"https://ror.org/05gxjyb39","country_code":"SA","type":"education","lineage":["https://openalex.org/I240666556"]}],"countries":["SA"],"is_corresponding":false,"raw_author_name":"Hachemi Bennaceur","raw_affiliation_strings":["Research Unit of Sciences and Technology, Al-Imam Muhammad ibn Saud Islamic University, Saudi Arabia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Research Unit of Sciences and Technology, Al-Imam Muhammad ibn Saud Islamic University, Saudi Arabia","institution_ids":["https://openalex.org/I240666556"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5006203581","display_name":"Sahar Trigui","orcid":null},"institutions":[{"id":"https://openalex.org/I142899784","display_name":"University of Sfax","ror":"https://ror.org/04d4sd432","country_code":"TN","type":"education","lineage":["https://openalex.org/I142899784"]}],"countries":["TN"],"is_corresponding":false,"raw_author_name":"Sahar Trigui","raw_affiliation_strings":["CES Research Unit, National School of Engineers of Sfax, University of Sfax, Tunisia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"CES Research Unit, National School of Engineers of Sfax, University of Sfax, Tunisia","institution_ids":["https://openalex.org/I142899784"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5020948205","display_name":"Khaled Al-Shalfan","orcid":null},"institutions":[{"id":"https://openalex.org/I240666556","display_name":"Imam Mohammad ibn Saud Islamic University","ror":"https://ror.org/05gxjyb39","country_code":"SA","type":"education","lineage":["https://openalex.org/I240666556"]}],"countries":["SA"],"is_corresponding":false,"raw_author_name":"Khaled Al-Shalfan","raw_affiliation_strings":["Research Unit of Sciences and Technology, Al-Imam Muhammad ibn Saud Islamic University, Saudi Arabia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Research Unit of Sciences and Technology, Al-Imam Muhammad ibn Saud Islamic University, Saudi Arabia","institution_ids":["https://openalex.org/I240666556"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.835,"has_fulltext":false,"cited_by_count":63,"citation_normalized_percentile":{"value":0.9544311,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":null,"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.9998999834060669,"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.9998999834060669,"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.9944999814033508,"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/T10191","display_name":"Robotics and Sensor-Based Localization","score":0.9901999831199646,"subfield":{"id":"https://openalex.org/subfields/2202","display_name":"Aerospace 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/motion-planning","display_name":"Motion planning","score":0.7779192924499512},{"id":"https://openalex.org/keywords/ant-colony-optimization-algorithms","display_name":"Ant colony optimization algorithms","score":0.7015699148178101},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.6768439412117004},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6688235998153687},{"id":"https://openalex.org/keywords/crossover","display_name":"Crossover","score":0.6188856959342957},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.575297474861145},{"id":"https://openalex.org/keywords/mobile-robot","display_name":"Mobile robot","score":0.5469222664833069},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5420140027999878},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.5378057360649109},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5232516527175903},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5207048058509827},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4447081983089447},{"id":"https://openalex.org/keywords/wireless-sensor-network","display_name":"Wireless sensor network","score":0.4290618598461151},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.29729121923446655},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.17069178819656372},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.12414279580116272},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.12015771865844727},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.10928723216056824}],"concepts":[{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.7779192924499512},{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.7015699148178101},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.6768439412117004},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6688235998153687},{"id":"https://openalex.org/C122507166","wikidata":"https://www.wikidata.org/wiki/Q628906","display_name":"Crossover","level":2,"score":0.6188856959342957},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.575297474861145},{"id":"https://openalex.org/C19966478","wikidata":"https://www.wikidata.org/wiki/Q4810574","display_name":"Mobile robot","level":3,"score":0.5469222664833069},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5420140027999878},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.5378057360649109},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5232516527175903},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5207048058509827},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4447081983089447},{"id":"https://openalex.org/C24590314","wikidata":"https://www.wikidata.org/wiki/Q336038","display_name":"Wireless sensor network","level":2,"score":0.4290618598461151},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.29729121923446655},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.17069178819656372},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.12414279580116272},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.12015771865844727},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.10928723216056824},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/cec.2012.6256142","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2012.6256142","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 IEEE Congress on Evolutionary Computation","raw_type":"proceedings-article"},{"id":"pmh:oai:zenodo.org:1266071","is_oa":true,"landing_page_url":"https://zenodo.org/record/1266071","pdf_url":null,"source":{"id":"https://openalex.org/S4306400562","display_name":"Zenodo (CERN European Organization for Nuclear Research)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I67311998","host_organization_name":"European Organization for Nuclear Research","host_organization_lineage":["https://openalex.org/I67311998"],"host_organization_lineage_names":[],"type":"repository"},"license":"public-domain","license_id":"https://openalex.org/licenses/public-domain","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/conferencePaper"}],"best_oa_location":{"id":"pmh:oai:zenodo.org:1266071","is_oa":true,"landing_page_url":"https://zenodo.org/record/1266071","pdf_url":null,"source":{"id":"https://openalex.org/S4306400562","display_name":"Zenodo (CERN European Organization for Nuclear Research)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I67311998","host_organization_name":"European Organization for Nuclear Research","host_organization_lineage":["https://openalex.org/I67311998"],"host_organization_lineage_names":[],"type":"repository"},"license":"public-domain","license_id":"https://openalex.org/licenses/public-domain","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/conferencePaper"},"sustainable_development_goals":[{"display_name":"Industry, innovation and infrastructure","score":0.6499999761581421,"id":"https://metadata.un.org/sdg/9"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W1638373997","https://openalex.org/W1964475319","https://openalex.org/W1985574982","https://openalex.org/W2009463128","https://openalex.org/W2034927223","https://openalex.org/W2040509134","https://openalex.org/W2063037959","https://openalex.org/W2097965677","https://openalex.org/W2099425078","https://openalex.org/W2116772004","https://openalex.org/W2116966230","https://openalex.org/W2145053972","https://openalex.org/W2145113795","https://openalex.org/W2148287521","https://openalex.org/W2169542477","https://openalex.org/W2340542859","https://openalex.org/W2545588213","https://openalex.org/W4238436963","https://openalex.org/W4285719527","https://openalex.org/W4292408555","https://openalex.org/W6666321116","https://openalex.org/W6704109102"],"related_works":["https://openalex.org/W2347477706","https://openalex.org/W4299389082","https://openalex.org/W1943663474","https://openalex.org/W2306830238","https://openalex.org/W2110294633","https://openalex.org/W1978349322","https://openalex.org/W2353880500","https://openalex.org/W2553274123","https://openalex.org/W4283826969","https://openalex.org/W2377010080"],"abstract_inverted_index":{"Path":[0],"planning":[1,68,157],"is":[2],"a":[3,12,51,57,74,89,97,104],"critical":[4],"combinatorial":[5],"problem":[6,158],"essential":[7],"for":[8,82,93,153],"the":[9,37,64,112,125,132,149,155,171,185],"navigation":[10],"of":[11,73,76],"mobile":[13,126],"robot.":[14],"Several":[15],"research":[16],"initiatives,":[17],"aiming":[18],"at":[19],"providing":[20],"optimized":[21],"solutions":[22],"to":[23,62,110,175,189],"this":[24],"problem,":[25],"have":[26,44],"emerged.":[27],"Ant":[28],"Colony":[29],"Optimization":[30],"(ACO)":[31],"and":[32,84,88,128,143,160,183],"Genetic":[33],"Algorithms":[34],"(GA)":[35],"are":[36,118],"two":[38],"most":[39],"widely":[40],"used":[41,119],"heuristics":[42],"that":[43,122,168],"shown":[45],"their":[46],"effectiveness":[47],"in":[48,148,177,191],"solving":[49,154],"such":[50],"problem.":[52,69],"This":[53],"paper":[54],"presents,":[55],"smartPATH,":[56],"new":[58],"hybrid":[59],"ACO-GA":[60],"algorithm":[61,71,80],"solve":[63],"global":[65],"robot":[66,113],"path":[67,86,156,163],"The":[70],"consists":[72],"combination":[75],"an":[77],"improved":[78],"ACO":[79,141],"(IACO)":[81],"efficient":[83],"fast":[85],"selection,":[87],"modified":[90],"crossover":[91],"operator":[92],"avoiding":[94],"falling":[95],"into":[96],"local":[98],"minimum.":[99],"Our":[100],"system":[101],"model":[102],"incorporates":[103],"Wireless":[105],"Sensor":[106],"Network":[107],"(WSN)":[108],"infrastructure":[109],"support":[111],"navigation,":[114],"where":[115],"sensor":[116],"nodes":[117],"as":[120],"signposts":[121],"help":[123],"locating":[124],"robot,":[127],"guide":[129],"it":[130],"towards":[131],"target":[133],"location.":[134],"We":[135,165],"found":[136],"out":[137],"smartPATH":[138,169],"outperforms":[139],"classical":[140],"(CACO)":[142],"GA":[144],"algorithms":[145],"(as":[146],"defined":[147],"literature":[150],"without":[151],"modification)":[152],"both":[159],"Bellman-Ford":[161,180],"shortest":[162],"method.":[164],"demonstrate":[166],"also":[167],"reduces":[170],"execution":[172],"time":[173],"up":[174,188],"64.9%":[176],"comparison":[178,192],"with":[179,193],"exact":[181],"method":[182],"improves":[184],"solution":[186],"quality":[187],"48.3%":[190],"CACO.":[194]},"counts_by_year":[{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":6},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":11},{"year":2017,"cited_by_count":5},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":6},{"year":2014,"cited_by_count":8},{"year":2013,"cited_by_count":3}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}