{"id":"https://openalex.org/W2050321096","doi":"https://doi.org/10.1007/s10458-014-9259-z","title":"An iterative approach for makespan-minimized multi-agent path planning in discrete space","display_name":"An iterative approach for makespan-minimized multi-agent path planning in discrete space","publication_year":2014,"publication_date":"2014-04-03","ids":{"openalex":"https://openalex.org/W2050321096","doi":"https://doi.org/10.1007/s10458-014-9259-z","mag":"2050321096"},"language":"en","primary_location":{"id":"doi:10.1007/s10458-014-9259-z","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10458-014-9259-z","pdf_url":null,"source":{"id":"https://openalex.org/S5405189","display_name":"Autonomous Agents and Multi-Agent Systems","issn_l":"1387-2532","issn":["1387-2532","1573-7454"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Autonomous Agents and Multi-Agent Systems","raw_type":"journal-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/A5100368510","display_name":"Wenjie Wang","orcid":"https://orcid.org/0000-0001-6426-0416"},"institutions":[{"id":"https://openalex.org/I172675005","display_name":"Nanyang Technological University","ror":"https://ror.org/02e7b5302","country_code":"SG","type":"education","lineage":["https://openalex.org/I172675005"]}],"countries":["SG"],"is_corresponding":true,"raw_author_name":"Wenjie Wang","raw_affiliation_strings":["Nanyang Technological University, Singapore, Singapore","Nanyang Technological University, Singapore, SINGAPORE#TAB#"],"affiliations":[{"raw_affiliation_string":"Nanyang Technological University, Singapore, Singapore","institution_ids":["https://openalex.org/I172675005"]},{"raw_affiliation_string":"Nanyang Technological University, Singapore, SINGAPORE#TAB#","institution_ids":["https://openalex.org/I172675005"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5113688140","display_name":"Wooi Boon Goh","orcid":null},"institutions":[{"id":"https://openalex.org/I172675005","display_name":"Nanyang Technological University","ror":"https://ror.org/02e7b5302","country_code":"SG","type":"education","lineage":["https://openalex.org/I172675005"]}],"countries":["SG"],"is_corresponding":false,"raw_author_name":"Wooi Boon Goh","raw_affiliation_strings":["Nanyang Technological University, Singapore, Singapore","Nanyang Technological University, Singapore, SINGAPORE#TAB#"],"affiliations":[{"raw_affiliation_string":"Nanyang Technological University, Singapore, Singapore","institution_ids":["https://openalex.org/I172675005"]},{"raw_affiliation_string":"Nanyang Technological University, Singapore, SINGAPORE#TAB#","institution_ids":["https://openalex.org/I172675005"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5100368510"],"corresponding_institution_ids":["https://openalex.org/I172675005"],"apc_list":{"value":2390,"currency":"EUR","value_usd":2990},"apc_paid":null,"fwci":0.2468,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.59466166,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"29","issue":"3","first_page":"335","last_page":"363"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":1.0,"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":1.0,"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.9957000017166138,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9951000213623047,"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/mathematical-optimization","display_name":"Mathematical optimization","score":0.7819896340370178},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.6638611555099487},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.5520386099815369},{"id":"https://openalex.org/keywords/simplex-algorithm","display_name":"Simplex algorithm","score":0.5506852269172668},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5438599586486816},{"id":"https://openalex.org/keywords/minimax","display_name":"Minimax","score":0.5433334708213806},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5294941067695618},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.47311899065971375},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.4714337885379791},{"id":"https://openalex.org/keywords/iterative-method","display_name":"Iterative method","score":0.4212000370025635},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.3704609274864197},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.32349950075149536},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.16475018858909607}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7819896340370178},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.6638611555099487},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.5520386099815369},{"id":"https://openalex.org/C144521790","wikidata":"https://www.wikidata.org/wiki/Q134164","display_name":"Simplex algorithm","level":3,"score":0.5506852269172668},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5438599586486816},{"id":"https://openalex.org/C149728462","wikidata":"https://www.wikidata.org/wiki/Q751319","display_name":"Minimax","level":2,"score":0.5433334708213806},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5294941067695618},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.47311899065971375},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.4714337885379791},{"id":"https://openalex.org/C159694833","wikidata":"https://www.wikidata.org/wiki/Q2321565","display_name":"Iterative method","level":2,"score":0.4212000370025635},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.3704609274864197},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.32349950075149536},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.16475018858909607},{"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/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/s10458-014-9259-z","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10458-014-9259-z","pdf_url":null,"source":{"id":"https://openalex.org/S5405189","display_name":"Autonomous Agents and Multi-Agent Systems","issn_l":"1387-2532","issn":["1387-2532","1573-7454"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Autonomous Agents and Multi-Agent Systems","raw_type":"journal-article"},{"id":"pmh:oai:dr.ntu.edu.sg:10356/101773","is_oa":false,"landing_page_url":"http://hdl.handle.net/10220/19812","pdf_url":null,"source":{"id":"https://openalex.org/S4306402609","display_name":"DR-NTU (Nanyang Technological University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I172675005","host_organization_name":"Nanyang Technological University","host_organization_lineage":["https://openalex.org/I172675005"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Journal Article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","score":0.550000011920929,"id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320320709","display_name":"National Research Foundation Singapore","ror":"https://ror.org/03cpyc314"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":55,"referenced_works":["https://openalex.org/W3359552","https://openalex.org/W92902385","https://openalex.org/W93645818","https://openalex.org/W102343121","https://openalex.org/W104877095","https://openalex.org/W106387505","https://openalex.org/W119150805","https://openalex.org/W125001008","https://openalex.org/W177987302","https://openalex.org/W1551562380","https://openalex.org/W1614580925","https://openalex.org/W1659382545","https://openalex.org/W1777366632","https://openalex.org/W1892910386","https://openalex.org/W1967901732","https://openalex.org/W1973396716","https://openalex.org/W1978318798","https://openalex.org/W1989407213","https://openalex.org/W1991482882","https://openalex.org/W2003464037","https://openalex.org/W2024370928","https://openalex.org/W2029333278","https://openalex.org/W2029877964","https://openalex.org/W2034604437","https://openalex.org/W2053983905","https://openalex.org/W2072839015","https://openalex.org/W2100695938","https://openalex.org/W2103838069","https://openalex.org/W2124015815","https://openalex.org/W2137651302","https://openalex.org/W2147526018","https://openalex.org/W2148948822","https://openalex.org/W2149951504","https://openalex.org/W2158883244","https://openalex.org/W2160386431","https://openalex.org/W2167451681","https://openalex.org/W2274527110","https://openalex.org/W2296319761","https://openalex.org/W2399153727","https://openalex.org/W2404271123","https://openalex.org/W2408675864","https://openalex.org/W2408746829","https://openalex.org/W2488224092","https://openalex.org/W2775798521","https://openalex.org/W2914296650","https://openalex.org/W2964211993","https://openalex.org/W3029645440","https://openalex.org/W4213268435","https://openalex.org/W6607293951","https://openalex.org/W6636254016","https://openalex.org/W6637859625","https://openalex.org/W6659427397","https://openalex.org/W6680701603","https://openalex.org/W6746813226","https://openalex.org/W6758754608"],"related_works":["https://openalex.org/W2016058626","https://openalex.org/W2474724840","https://openalex.org/W2895916002","https://openalex.org/W1814049089","https://openalex.org/W1977348009","https://openalex.org/W2369683208","https://openalex.org/W2084836983","https://openalex.org/W1530911128","https://openalex.org/W1555347637","https://openalex.org/W2362133437"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2022,"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"}