{"id":"https://openalex.org/W2099515255","doi":"https://doi.org/10.1109/cec.2008.4630897","title":"A two-step evolutionary and ACO approach for solving the multi-agent patrolling problem","display_name":"A two-step evolutionary and ACO approach for solving the multi-agent patrolling problem","publication_year":2008,"publication_date":"2008-06-01","ids":{"openalex":"https://openalex.org/W2099515255","doi":"https://doi.org/10.1109/cec.2008.4630897","mag":"2099515255"},"language":"en","primary_location":{"id":"doi:10.1109/cec.2008.4630897","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2008.4630897","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence)","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/A5082374448","display_name":"Fabrice Lauri","orcid":null},"institutions":[{"id":"https://openalex.org/I37553959","display_name":"Universit\u00e9 de technologie de belfort-montb\u00e9liard","ror":"https://ror.org/05bn3m307","country_code":"FR","type":"education","lineage":["https://openalex.org/I37553959"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Fabrice Lauri","raw_affiliation_strings":["Universit\u00e9 de technologie de belfort-montb\u00e9liard, Belfort, France"],"affiliations":[{"raw_affiliation_string":"Universit\u00e9 de technologie de belfort-montb\u00e9liard, Belfort, France","institution_ids":["https://openalex.org/I37553959"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5022466993","display_name":"Abderraf\u00ec\u00e2a Koukam","orcid":"https://orcid.org/0000-0002-7383-5143"},"institutions":[{"id":"https://openalex.org/I37553959","display_name":"Universit\u00e9 de technologie de belfort-montb\u00e9liard","ror":"https://ror.org/05bn3m307","country_code":"FR","type":"education","lineage":["https://openalex.org/I37553959"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Abderrafiaa Koukam","raw_affiliation_strings":["Universit\u00e9 de technologie de belfort-montb\u00e9liard, Belfort, France"],"affiliations":[{"raw_affiliation_string":"Universit\u00e9 de technologie de belfort-montb\u00e9liard, Belfort, France","institution_ids":["https://openalex.org/I37553959"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5082374448"],"corresponding_institution_ids":["https://openalex.org/I37553959"],"apc_list":null,"apc_paid":null,"fwci":1.0641,"has_fulltext":false,"cited_by_count":19,"citation_normalized_percentile":{"value":0.79767906,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"861","last_page":"868"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9987000226974487,"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.9987000226974487,"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.9961000084877014,"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/T11133","display_name":"UAV Applications and Optimization","score":0.9959999918937683,"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/patrolling","display_name":"Patrolling","score":0.9930406808853149},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7041174173355103},{"id":"https://openalex.org/keywords/ant-colony-optimization-algorithms","display_name":"Ant colony optimization algorithms","score":0.6880057454109192},{"id":"https://openalex.org/keywords/ant-colony","display_name":"Ant colony","score":0.5706260204315186},{"id":"https://openalex.org/keywords/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.4849136471748352},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.4697684943675995},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.4682653546333313},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4452972710132599},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.43410423398017883},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.4289686381816864},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4121583104133606},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.268505722284317},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.158506840467453},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.11188879609107971}],"concepts":[{"id":"https://openalex.org/C110698143","wikidata":"https://www.wikidata.org/wiki/Q651389","display_name":"Patrolling","level":2,"score":0.9930406808853149},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7041174173355103},{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.6880057454109192},{"id":"https://openalex.org/C60891933","wikidata":"https://www.wikidata.org/wiki/Q796575","display_name":"Ant colony","level":3,"score":0.5706260204315186},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.4849136471748352},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.4697684943675995},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.4682653546333313},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4452972710132599},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.43410423398017883},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.4289686381816864},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4121583104133606},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.268505722284317},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.158506840467453},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.11188879609107971},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"id":"https://openalex.org/C201995342","wikidata":"https://www.wikidata.org/wiki/Q682496","display_name":"Systems engineering","level":1,"score":0.0},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","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":2,"locations":[{"id":"doi:10.1109/cec.2008.4630897","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2008.4630897","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence)","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.726.5596","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.726.5596","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.multiagent.fr/extensions/ICAPManager/pdf/LauriKoukam2008.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W197844793","https://openalex.org/W1543672909","https://openalex.org/W1570691242","https://openalex.org/W1586765580","https://openalex.org/W1603050797","https://openalex.org/W1717440967","https://openalex.org/W1969483458","https://openalex.org/W1981031568","https://openalex.org/W2042704421","https://openalex.org/W2107941094","https://openalex.org/W2125298348","https://openalex.org/W2128862550","https://openalex.org/W2154929945","https://openalex.org/W2297395784","https://openalex.org/W4232693667","https://openalex.org/W4296951101","https://openalex.org/W4301173492","https://openalex.org/W6607973403","https://openalex.org/W6632495983","https://openalex.org/W6633796240","https://openalex.org/W6637497407","https://openalex.org/W6679022538","https://openalex.org/W6697634807","https://openalex.org/W6842909931"],"related_works":["https://openalex.org/W2347951034","https://openalex.org/W2388326823","https://openalex.org/W2366876790","https://openalex.org/W2071981049","https://openalex.org/W2381829748","https://openalex.org/W2244460820","https://openalex.org/W2109336245","https://openalex.org/W2061313076","https://openalex.org/W2392795382","https://openalex.org/W2379177376"],"abstract_inverted_index":{"Patrolling":[0],"an":[1,137],"environment":[2,50],"involves":[3],"a":[4,25,52,56,126,154],"team":[5],"of":[6,59,83,166,175,192,195],"agents":[7,27,91,199],"whose":[8],"goal":[9,165],"usually":[10,47],"consists":[11],"in":[12,33,104,153,221],"continuously":[13],"visiting":[14],"its":[15],"most":[16],"relevant":[17],"areas":[18],"as":[19,21,51],"frequently":[20],"possible.":[22],"For":[23],"such":[24],"task,":[26],"have":[28],"to":[29,35,69,170,181],"coordinate":[30],"their":[31],"actions":[32],"order":[34],"achieve":[36],"optimal":[37],"performance.":[38],"Current":[39],"research":[40],"that":[41,55,133,150],"tackles":[42],"this":[43,76],"complex":[44],"multi-agent":[45,85,161],"problem":[46,87],"defines":[48],"the":[49,81,84,90,95,112,159,167,172,185,193,196,203,217,222],"graph,":[53],"so":[54],"wide":[57],"range":[58],"applications":[60],"can":[61],"be":[62],"dealt":[63],"with,":[64],"from":[65,111],"computer":[66,70],"network":[67],"management":[68],"games":[71],"and":[72,118,200,209,214],"vehicle":[73],"routing.":[74],"In":[75],"paper,":[77],"we":[78],"consider":[79],"only":[80],"instances":[82,100],"patrolling":[86,162,198],"where":[88,107],"all":[89,202],"are":[92,101,151],"located":[93],"on":[94],"same":[96,113],"starting":[97],"node.":[98],"These":[99],"often":[102],"encountered":[103],"robotics":[105],"applications,":[106],"e.g.":[108],"drones":[109],"start":[110],"area,":[114],"disperse":[115,182],"over":[116,184],"it":[117],"finally":[119],"patrol":[120],"around":[121],"distant":[122,176],"locations.":[123],"We":[124],"introduce":[125],"new":[127],"ant":[128,148],"colony":[129],"optimization":[130],"(ACO)":[131],"algorithm":[132,139,145,211],"is":[134,169],"combined":[135],"with":[136,215],"evolutionary":[138],"(EA)":[140],"technique.":[141],"The":[142,164],"novel":[143],"ACO":[144,210],"uses":[146],"several":[147],"colonies":[149],"engaged":[152],"competition":[155],"for":[156,201],"finding":[157],"out":[158],"best":[160,173,218],"strategy.":[163],"EA":[168,208],"find":[171],"set":[174],"nodes":[177],"enabling":[178],"each":[179],"agent":[180],"efficiently":[183],"graph.":[186],"Experimental":[187],"results":[188],"show":[189],"that,":[190],"irrespective":[191],"number":[194],"involved":[197],"graphs":[204],"evaluated,":[205],"our":[206],"two-step":[207],"outperforms":[212],"significantly":[213],"efficiency":[216],"techniques":[219],"proposed":[220],"literature":[223],"since":[224],"now.":[225]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":6},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}