{"id":"https://openalex.org/W2467632359","doi":"https://doi.org/10.1515/amcs-2016-0021","title":"An optimal path planning problem for heterogeneous multi-vehicle systems","display_name":"An optimal path planning problem for heterogeneous multi-vehicle systems","publication_year":2016,"publication_date":"2016-06-01","ids":{"openalex":"https://openalex.org/W2467632359","doi":"https://doi.org/10.1515/amcs-2016-0021","mag":"2467632359"},"language":"en","primary_location":{"id":"doi:10.1515/amcs-2016-0021","is_oa":true,"landing_page_url":"https://doi.org/10.1515/amcs-2016-0021","pdf_url":"https://content.sciendo.com/downloadpdf/journals/amcs/26/2/article-p297.pdf","source":{"id":"https://openalex.org/S117679522","display_name":"International Journal of Applied Mathematics and Computer Science","issn_l":"1641-876X","issn":["1641-876X","2083-8492"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310320322","host_organization_name":"De Gruyter Open","host_organization_lineage":["https://openalex.org/P4310320322","https://openalex.org/P4310313990"],"host_organization_lineage_names":["De Gruyter Open","De Gruyter"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Applied Mathematics and Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://content.sciendo.com/downloadpdf/journals/amcs/26/2/article-p297.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5009958418","display_name":"Martin Klau\u010do","orcid":"https://orcid.org/0000-0003-0098-2625"},"institutions":[{"id":"https://openalex.org/I110757952","display_name":"Slovak University of Technology in Bratislava","ror":"https://ror.org/0561ghm58","country_code":"SK","type":"education","lineage":["https://openalex.org/I110757952"]}],"countries":["SK"],"is_corresponding":false,"raw_author_name":"Martin Klau\u010do","raw_affiliation_strings":["Institute of Information Engineering, Automation and Mathematics Slovak University of Technology in Bratislava, Radlinsk\u00e9ho 9, Bratislava, Slovakia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Information Engineering, Automation and Mathematics Slovak University of Technology in Bratislava, Radlinsk\u00e9ho 9, Bratislava, Slovakia","institution_ids":["https://openalex.org/I110757952"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5079231798","display_name":"S. Blazek","orcid":null},"institutions":[{"id":"https://openalex.org/I110757952","display_name":"Slovak University of Technology in Bratislava","ror":"https://ror.org/0561ghm58","country_code":"SK","type":"education","lineage":["https://openalex.org/I110757952"]}],"countries":["SK"],"is_corresponding":false,"raw_author_name":"Slavom\u00edr Bla\u017eek","raw_affiliation_strings":["Institute of Information Engineering, Automation and Mathematics Slovak University of Technology in Bratislava, Radlinsk\u00e9ho 9, Bratislava, Slovakia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Information Engineering, Automation and Mathematics Slovak University of Technology in Bratislava, Radlinsk\u00e9ho 9, Bratislava, Slovakia","institution_ids":["https://openalex.org/I110757952"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5081458703","display_name":"Michal Kvasnica","orcid":"https://orcid.org/0000-0001-8699-551X"},"institutions":[{"id":"https://openalex.org/I110757952","display_name":"Slovak University of Technology in Bratislava","ror":"https://ror.org/0561ghm58","country_code":"SK","type":"education","lineage":["https://openalex.org/I110757952"]}],"countries":["SK"],"is_corresponding":false,"raw_author_name":"Michal Kvasnica","raw_affiliation_strings":["Institute of Information Engineering, Automation and Mathematics Slovak University of Technology in Bratislava, Radlinsk\u00e9ho 9, Bratislava, Slovakia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Information Engineering, Automation and Mathematics Slovak University of Technology in Bratislava, Radlinsk\u00e9ho 9, Bratislava, Slovakia","institution_ids":["https://openalex.org/I110757952"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":4080,"currency":"PLN","value_usd":1100},"apc_paid":{"value":4080,"currency":"PLN","value_usd":1100},"fwci":2.9731,"has_fulltext":true,"cited_by_count":10,"citation_normalized_percentile":{"value":0.91308962,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"26","issue":"2","first_page":"297","last_page":"308"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9997000098228455,"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"}},"topics":[{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9997000098228455,"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"}},{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9991000294685364,"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/T11942","display_name":"Transportation and Mobility Innovations","score":0.996999979019165,"subfield":{"id":"https://openalex.org/subfields/2203","display_name":"Automotive 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/path","display_name":"Path (computing)","score":0.7814775705337524},{"id":"https://openalex.org/keywords/a-priori-and-a-posteriori","display_name":"A priori and a posteriori","score":0.7751676440238953},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.699497401714325},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.6955212354660034},{"id":"https://openalex.org/keywords/range","display_name":"Range (aeronautics)","score":0.5792702436447144},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.5746488571166992},{"id":"https://openalex.org/keywords/any-angle-path-planning","display_name":"Any-angle path planning","score":0.4817952513694763},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4803232252597809},{"id":"https://openalex.org/keywords/path-length","display_name":"Path length","score":0.46468308568000793},{"id":"https://openalex.org/keywords/order","display_name":"Order (exchange)","score":0.43455129861831665},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4330886900424957},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.11507126688957214},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.09186622500419617},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.08073905110359192}],"concepts":[{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.7814775705337524},{"id":"https://openalex.org/C75553542","wikidata":"https://www.wikidata.org/wiki/Q178161","display_name":"A priori and a posteriori","level":2,"score":0.7751676440238953},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.699497401714325},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.6955212354660034},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.5792702436447144},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.5746488571166992},{"id":"https://openalex.org/C158485040","wikidata":"https://www.wikidata.org/wiki/Q4778119","display_name":"Any-angle path planning","level":4,"score":0.4817952513694763},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4803232252597809},{"id":"https://openalex.org/C129045301","wikidata":"https://www.wikidata.org/wiki/Q7144654","display_name":"Path length","level":2,"score":0.46468308568000793},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.43455129861831665},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4330886900424957},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.11507126688957214},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.09186622500419617},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.08073905110359192},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"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/C146978453","wikidata":"https://www.wikidata.org/wiki/Q3798668","display_name":"Aerospace engineering","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"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/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1515/amcs-2016-0021","is_oa":true,"landing_page_url":"https://doi.org/10.1515/amcs-2016-0021","pdf_url":"https://content.sciendo.com/downloadpdf/journals/amcs/26/2/article-p297.pdf","source":{"id":"https://openalex.org/S117679522","display_name":"International Journal of Applied Mathematics and Computer Science","issn_l":"1641-876X","issn":["1641-876X","2083-8492"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310320322","host_organization_name":"De Gruyter Open","host_organization_lineage":["https://openalex.org/P4310320322","https://openalex.org/P4310313990"],"host_organization_lineage_names":["De Gruyter Open","De Gruyter"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Applied Mathematics and Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:16ea70de6efd4dfca3d0e1f52883789c","is_oa":true,"landing_page_url":"https://doaj.org/article/16ea70de6efd4dfca3d0e1f52883789c","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"International Journal of Applied Mathematics and Computer Science, Vol 26, Iss 2, Pp 297-308 (2016)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.1515/amcs-2016-0021","is_oa":true,"landing_page_url":"https://doi.org/10.1515/amcs-2016-0021","pdf_url":"https://content.sciendo.com/downloadpdf/journals/amcs/26/2/article-p297.pdf","source":{"id":"https://openalex.org/S117679522","display_name":"International Journal of Applied Mathematics and Computer Science","issn_l":"1641-876X","issn":["1641-876X","2083-8492"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310320322","host_organization_name":"De Gruyter Open","host_organization_lineage":["https://openalex.org/P4310320322","https://openalex.org/P4310313990"],"host_organization_lineage_names":["De Gruyter Open","De Gruyter"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Applied Mathematics and Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities","score":0.7099999785423279}],"awards":[{"id":"https://openalex.org/G1767742301","display_name":null,"funder_award_id":"APVV-15-","funder_id":"https://openalex.org/F4320323251","funder_display_name":"Agent\u00fara na Podporu V\u00fdskumu a V\u00fdvoja"},{"id":"https://openalex.org/G4423914108","display_name":null,"funder_award_id":"APVV-15-0007","funder_id":"https://openalex.org/F4320323251","funder_display_name":"Agent\u00fara na Podporu V\u00fdskumu a V\u00fdvoja"},{"id":"https://openalex.org/G6331675900","display_name":null,"funder_award_id":"15-0007","funder_id":"https://openalex.org/F4320323251","funder_display_name":"Agent\u00fara na Podporu V\u00fdskumu a V\u00fdvoja"},{"id":"https://openalex.org/G7161355502","display_name":null,"funder_award_id":"1/0403/15","funder_id":"https://openalex.org/F4320323641","funder_display_name":"Vedeck\u00e1 Grantov\u00e1 Agent\u00fara M\u0160VVa\u0160 SR a SAV"}],"funders":[{"id":"https://openalex.org/F4320323251","display_name":"Agent\u00fara na Podporu V\u00fdskumu a V\u00fdvoja","ror":"https://ror.org/037nx0e70"},{"id":"https://openalex.org/F4320323641","display_name":"Vedeck\u00e1 Grantov\u00e1 Agent\u00fara M\u0160VVa\u0160 SR a SAV","ror":"https://ror.org/044gwpv05"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2467632359.pdf","grobid_xml":"https://content.openalex.org/works/W2467632359.grobid-xml"},"referenced_works_count":14,"referenced_works":["https://openalex.org/W16274536","https://openalex.org/W626292722","https://openalex.org/W1572804421","https://openalex.org/W2034187621","https://openalex.org/W2049287714","https://openalex.org/W2059949797","https://openalex.org/W2063520056","https://openalex.org/W2110316735","https://openalex.org/W2110330194","https://openalex.org/W2142658946","https://openalex.org/W2295274131","https://openalex.org/W2412422379","https://openalex.org/W4233282113","https://openalex.org/W4298112682"],"related_works":["https://openalex.org/W2368795992","https://openalex.org/W4308080200","https://openalex.org/W2908094156","https://openalex.org/W2586992284","https://openalex.org/W2389896347","https://openalex.org/W2904203243","https://openalex.org/W3139139461","https://openalex.org/W2056737145","https://openalex.org/W1660309994","https://openalex.org/W4297094037"],"abstract_inverted_index":{"Abstract":[0],"A":[1],"path":[2,54,107],"planning":[3],"problem":[4,80,154],"for":[5],"a":[6,12,30,40,96,100,113,134],"heterogeneous":[7,68],"vehicle":[8,13],"is":[9,34,49,94,131],"considered.":[10,82],"Such":[11],"consists":[14],"of":[15,27,55,66,78,146],"two":[16],"parts":[17],"which":[18,89,126],"have":[19],"the":[20,44,59,67,79,86,90,105,123,127,144,147],"ability":[21],"to":[22,37,43,50,142,151,161],"move":[23],"individually,":[24],"but":[25,136],"one":[26,64],"them":[28],"has":[29],"shorter":[31],"range":[32],"and":[33,157],"therefore":[35],"required":[36],"keep":[38],"in":[39,88,125],"close":[41],"distance":[42],"main":[45],"vehicle.":[46],"The":[47,118],"objective":[48],"devise":[51],"an":[52],"optimal":[53,106],"minimal":[56],"length":[57,145],"under":[58],"condition":[60],"that":[61,85,104,122],"at":[62],"least":[63],"part":[65],"system":[69],"visits":[70],"all":[71],"desired":[72],"waypoints":[73,91,128],"exactly":[74],"once.":[75],"Two":[76,149],"versions":[77],"are":[81,92,129,155],"One":[83],"assumes":[84,121],"order":[87,124],"visited":[93,130],"known":[95,133],"priori.":[97],"In":[98],"such":[99],"case":[101],"we":[102],"show":[103],"can":[108,137],"be":[109,138],"found":[110],"by":[111],"solving":[112],"mixed-integer":[114],"second-order":[115],"cone":[116],"problem.":[117],"second":[119],"version":[120],"not":[132],"priori,":[135],"optimized":[139],"so":[140],"as":[141],"shorten":[143],"path.":[148],"approaches":[150],"solve":[152],"this":[153],"presented":[156],"evaluated":[158],"with":[159],"respect":[160],"computational":[162],"complexity.":[163]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}