{"id":"https://openalex.org/W1968873861","doi":"https://doi.org/10.1109/aqtr.2014.6857901","title":"Optimal multi-agent planning solution for a sample gathering problem","display_name":"Optimal multi-agent planning solution for a sample gathering problem","publication_year":2014,"publication_date":"2014-05-01","ids":{"openalex":"https://openalex.org/W1968873861","doi":"https://doi.org/10.1109/aqtr.2014.6857901","mag":"1968873861"},"language":"en","primary_location":{"id":"doi:10.1109/aqtr.2014.6857901","is_oa":false,"landing_page_url":"https://doi.org/10.1109/aqtr.2014.6857901","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 IEEE International Conference on Automation, Quality and Testing, Robotics","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/A5003446848","display_name":"Adrian Burlacu","orcid":"https://orcid.org/0000-0003-3844-1808"},"institutions":[{"id":"https://openalex.org/I4210108695","display_name":"Gheorghe Asachi Technical University of Ia\u0219i","ror":"https://ror.org/014zxnz40","country_code":"RO","type":"education","lineage":["https://openalex.org/I4210108695"]}],"countries":["RO"],"is_corresponding":true,"raw_author_name":"Adrian Burlacu","raw_affiliation_strings":["Dept. of Automatic control and Applied Informatics, Gheorghe Asachi Technical University of Iasi, Romania","Dept. of Autom. control & Appl. Inf., Gheorghe Asachi Tech. Univ. of Iasi, Iasi, Romania"],"affiliations":[{"raw_affiliation_string":"Dept. of Automatic control and Applied Informatics, Gheorghe Asachi Technical University of Iasi, Romania","institution_ids":["https://openalex.org/I4210108695"]},{"raw_affiliation_string":"Dept. of Autom. control & Appl. Inf., Gheorghe Asachi Tech. Univ. of Iasi, Iasi, Romania","institution_ids":["https://openalex.org/I4210108695"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5046534630","display_name":"Marius Kloetzer","orcid":"https://orcid.org/0000-0003-4338-0421"},"institutions":[{"id":"https://openalex.org/I4210108695","display_name":"Gheorghe Asachi Technical University of Ia\u0219i","ror":"https://ror.org/014zxnz40","country_code":"RO","type":"education","lineage":["https://openalex.org/I4210108695"]}],"countries":["RO"],"is_corresponding":false,"raw_author_name":"Marius Kloetzer","raw_affiliation_strings":["Dept. of Automatic control and Applied Informatics, Gheorghe Asachi Technical University of Iasi, Romania","Dept. of Autom. control & Appl. Inf., Gheorghe Asachi Tech. Univ. of Iasi, Iasi, Romania"],"affiliations":[{"raw_affiliation_string":"Dept. of Automatic control and Applied Informatics, Gheorghe Asachi Technical University of Iasi, Romania","institution_ids":["https://openalex.org/I4210108695"]},{"raw_affiliation_string":"Dept. of Autom. control & Appl. Inf., Gheorghe Asachi Tech. Univ. of Iasi, Iasi, Romania","institution_ids":["https://openalex.org/I4210108695"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5067957630","display_name":"Florin Ostafi","orcid":null},"institutions":[{"id":"https://openalex.org/I4210108695","display_name":"Gheorghe Asachi Technical University of Ia\u0219i","ror":"https://ror.org/014zxnz40","country_code":"RO","type":"education","lineage":["https://openalex.org/I4210108695"]}],"countries":["RO"],"is_corresponding":false,"raw_author_name":"Florin Ostafi","raw_affiliation_strings":["Dept. of Automatic control and Applied Informatics, Gheorghe Asachi Technical University of Iasi, Romania","Dept. of Autom. control & Appl. Inf., Gheorghe Asachi Tech. Univ. of Iasi, Iasi, Romania"],"affiliations":[{"raw_affiliation_string":"Dept. of Automatic control and Applied Informatics, Gheorghe Asachi Technical University of Iasi, Romania","institution_ids":["https://openalex.org/I4210108695"]},{"raw_affiliation_string":"Dept. of Autom. control & Appl. Inf., Gheorghe Asachi Tech. Univ. of Iasi, Iasi, Romania","institution_ids":["https://openalex.org/I4210108695"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5003446848"],"corresponding_institution_ids":["https://openalex.org/I4210108695"],"apc_list":null,"apc_paid":null,"fwci":1.3792,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.82481752,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"5"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9994999766349792,"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"}},"topics":[{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9994999766349792,"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9958000183105469,"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/T12203","display_name":"Mobile Agent-Based Network Management","score":0.9934999942779541,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/sample","display_name":"Sample (material)","score":0.6908355355262756},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6642874479293823},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.6215900182723999},{"id":"https://openalex.org/keywords/plan","display_name":"Plan (archaeology)","score":0.6148808002471924},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5724886655807495},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.5390263199806213},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5154410600662231},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.4826846122741699},{"id":"https://openalex.org/keywords/mobile-agent","display_name":"Mobile agent","score":0.45016440749168396},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.4382779896259308},{"id":"https://openalex.org/keywords/order","display_name":"Order (exchange)","score":0.4218290448188782},{"id":"https://openalex.org/keywords/operations-research","display_name":"Operations research","score":0.3278343081474304},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.27015724778175354},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2300887107849121},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.18531516194343567},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.1711680293083191}],"concepts":[{"id":"https://openalex.org/C198531522","wikidata":"https://www.wikidata.org/wiki/Q485146","display_name":"Sample (material)","level":2,"score":0.6908355355262756},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6642874479293823},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.6215900182723999},{"id":"https://openalex.org/C2776505523","wikidata":"https://www.wikidata.org/wiki/Q4785468","display_name":"Plan (archaeology)","level":2,"score":0.6148808002471924},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5724886655807495},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.5390263199806213},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5154410600662231},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.4826846122741699},{"id":"https://openalex.org/C84875433","wikidata":"https://www.wikidata.org/wiki/Q3277848","display_name":"Mobile agent","level":2,"score":0.45016440749168396},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.4382779896259308},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.4218290448188782},{"id":"https://openalex.org/C42475967","wikidata":"https://www.wikidata.org/wiki/Q194292","display_name":"Operations research","level":1,"score":0.3278343081474304},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.27015724778175354},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2300887107849121},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.18531516194343567},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.1711680293083191},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C95457728","wikidata":"https://www.wikidata.org/wiki/Q309","display_name":"History","level":0,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C10138342","wikidata":"https://www.wikidata.org/wiki/Q43015","display_name":"Finance","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},{"id":"https://openalex.org/C43617362","wikidata":"https://www.wikidata.org/wiki/Q170050","display_name":"Chromatography","level":1,"score":0.0},{"id":"https://openalex.org/C166957645","wikidata":"https://www.wikidata.org/wiki/Q23498","display_name":"Archaeology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/aqtr.2014.6857901","is_oa":false,"landing_page_url":"https://doi.org/10.1109/aqtr.2014.6857901","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 IEEE International Conference on Automation, Quality and Testing, Robotics","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.5,"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W73629738","https://openalex.org/W2023992532","https://openalex.org/W2048922416","https://openalex.org/W2140700901","https://openalex.org/W2142544818","https://openalex.org/W2157488300","https://openalex.org/W2526264695","https://openalex.org/W2549082795","https://openalex.org/W4242361212"],"related_works":["https://openalex.org/W2047683846","https://openalex.org/W2044902158","https://openalex.org/W2109912052","https://openalex.org/W1711527768","https://openalex.org/W4285278887","https://openalex.org/W2365237642","https://openalex.org/W2995925505","https://openalex.org/W2773399470","https://openalex.org/W3116484972","https://openalex.org/W2941986668"],"abstract_inverted_index":{"This":[0,116],"research":[1],"targets":[2],"the":[3,17,65,68,71,88,108,111,121],"problem":[4,90],"of":[5,10,67,87,123,125],"automatically":[6],"planning":[7],"a":[8,36,42,58,62,85,92,101],"team":[9],"mobile":[11,27],"agents":[12],"such":[13],"that":[14,82,103],"they":[15],"collect":[16],"samples":[18,72,109,128],"scattered":[19],"throughout":[20],"an":[21],"environment":[22,52],"in":[23,79,129],"minimum":[24,130],"time.":[25,131],"Each":[26],"agent":[28,107],"can":[29,40],"carry":[30],"at":[31,35],"most":[32],"one":[33],"sample":[34],"time":[37],"and":[38,110],"it":[39],"travel":[41],"maximum":[43],"total":[44],"distance,":[45],"given":[46],"by":[47],"agent's":[48],"available":[49],"energy.":[50],"The":[51,98],"is":[53,118],"assumed":[54],"already":[55],"abstracted":[56],"to":[57,84],"finite":[59],"graph,":[60],"where":[61,70],"node":[63],"plays":[64],"role":[66],"deposit":[69],"should":[73],"be":[74],"gathered.":[75],"Our":[76],"solution":[77,99],"consists":[78],"several":[80],"steps":[81],"lead":[83],"formulation":[86],"initial":[89],"as":[91],"Mixed":[93],"Integer":[94],"Linear":[95],"Programming":[96],"one.":[97],"yields":[100],"plan":[102],"imposes":[104],"for":[105,113],"each":[106],"order":[112],"collecting":[114,126],"them.":[115],"result":[117],"optimal":[119],"from":[120],"point":[122],"view":[124],"all":[127]},"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}