{"id":"https://openalex.org/W4200090642","doi":"https://doi.org/10.1080/00207543.2021.2015806","title":"Efficient path planning for automated guided vehicles using A* (Astar) algorithm incorporating turning costs in search heuristic","display_name":"Efficient path planning for automated guided vehicles using A* (Astar) algorithm incorporating turning costs in search heuristic","publication_year":2021,"publication_date":"2021-12-29","ids":{"openalex":"https://openalex.org/W4200090642","doi":"https://doi.org/10.1080/00207543.2021.2015806"},"language":"en","primary_location":{"id":"doi:10.1080/00207543.2021.2015806","is_oa":true,"landing_page_url":"https://doi.org/10.1080/00207543.2021.2015806","pdf_url":"https://www.tandfonline.com/doi/pdf/10.1080/00207543.2021.2015806?needAccess=true","source":{"id":"https://openalex.org/S65690446","display_name":"International Journal of Production Research","issn_l":"0020-7543","issn":["0020-7543","1366-588X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Production Research","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://www.tandfonline.com/doi/pdf/10.1080/00207543.2021.2015806?needAccess=true","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5022659076","display_name":"K.J.C. Fransen","orcid":null},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Karlijn Fransen","raw_affiliation_strings":["Department of Mechanical Engineering, Control Systems Technology, Eindhoven University of Technology, Eindhoven, The Netherlands","Vanderlande Industries B.V., Veghel, The Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mechanical Engineering, Control Systems Technology, Eindhoven University of Technology, Eindhoven, The Netherlands","institution_ids":["https://openalex.org/I83019370"]},{"raw_affiliation_string":"Vanderlande Industries B.V., Veghel, The Netherlands","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5053093010","display_name":"Joost van Eekelen","orcid":null},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Joost van Eekelen","raw_affiliation_strings":["Department of Mechanical Engineering, Control Systems Technology, Eindhoven University of Technology, Eindhoven, The Netherlands","Vanderlande Industries B.V., Veghel, The Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mechanical Engineering, Control Systems Technology, Eindhoven University of Technology, Eindhoven, The Netherlands","institution_ids":["https://openalex.org/I83019370"]},{"raw_affiliation_string":"Vanderlande Industries B.V., Veghel, The Netherlands","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5022659076"],"corresponding_institution_ids":["https://openalex.org/I83019370"],"apc_list":null,"apc_paid":null,"fwci":4.8993,"has_fulltext":true,"cited_by_count":99,"citation_normalized_percentile":{"value":0.96403726,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":98,"max":100},"biblio":{"volume":"61","issue":"3","first_page":"707","last_page":"725"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9997000098228455,"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.9997000098228455,"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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9976999759674072,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9939000010490417,"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/heuristics","display_name":"Heuristics","score":0.7911552786827087},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.6858066320419312},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6634328365325928},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.6287347078323364},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5318241715431213},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.5170248746871948},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.48993223905563354},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4579012393951416},{"id":"https://openalex.org/keywords/consistent-heuristic","display_name":"Consistent heuristic","score":0.451255202293396},{"id":"https://openalex.org/keywords/any-angle-path-planning","display_name":"Any-angle path planning","score":0.4401552677154541},{"id":"https://openalex.org/keywords/incremental-heuristic-search","display_name":"Incremental heuristic search","score":0.4157385528087616},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.37085670232772827},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.33794355392456055},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.18122145533561707},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.16424870491027832},{"id":"https://openalex.org/keywords/beam-search","display_name":"Beam search","score":0.13043156266212463}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.7911552786827087},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6858066320419312},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6634328365325928},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6287347078323364},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5318241715431213},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.5170248746871948},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.48993223905563354},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4579012393951416},{"id":"https://openalex.org/C200246849","wikidata":"https://www.wikidata.org/wiki/Q5163226","display_name":"Consistent heuristic","level":5,"score":0.451255202293396},{"id":"https://openalex.org/C158485040","wikidata":"https://www.wikidata.org/wiki/Q4778119","display_name":"Any-angle path planning","level":4,"score":0.4401552677154541},{"id":"https://openalex.org/C139979381","wikidata":"https://www.wikidata.org/wiki/Q17056021","display_name":"Incremental heuristic search","level":4,"score":0.4157385528087616},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.37085670232772827},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.33794355392456055},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.18122145533561707},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.16424870491027832},{"id":"https://openalex.org/C19889080","wikidata":"https://www.wikidata.org/wiki/Q2835852","display_name":"Beam search","level":3,"score":0.13043156266212463},{"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/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1080/00207543.2021.2015806","is_oa":true,"landing_page_url":"https://doi.org/10.1080/00207543.2021.2015806","pdf_url":"https://www.tandfonline.com/doi/pdf/10.1080/00207543.2021.2015806?needAccess=true","source":{"id":"https://openalex.org/S65690446","display_name":"International Journal of Production Research","issn_l":"0020-7543","issn":["0020-7543","1366-588X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Production Research","raw_type":"journal-article"},{"id":"pmh:oai:pure.tue.nl:openaire/72f885f6-e3fa-411a-8ba7-98703b7dde72","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/72f885f6-e3fa-411a-8ba7-98703b7dde72","pdf_url":"https://pure.tue.nl/ws/files/286016907/Efficient_path_planning_for_automated_guided_vehicles_using_A_Astar_algorithm_incorporating_turning_costs_in_search_heuristic.pdf","source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","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","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Fransen, K J C & van Eekelen, J 2023, 'Efficient path planning for automated guided vehicles using A* (Astar) algorithm incorporating turning costs in search heuristic', International Journal of Production Research, vol. 61, no. 3, pp. 707-725. https://doi.org/10.1080/00207543.2021.2015806","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:RePEc:taf:tprsxx:v:61:y:2023:i:3:p:707-725","is_oa":false,"landing_page_url":"http://hdl.handle.net/10.1080/00207543.2021.2015806","pdf_url":null,"source":{"id":"https://openalex.org/S4306401271","display_name":"RePEc: Research Papers in Economics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I77793887","host_organization_name":"Federal Reserve Bank of St. Louis","host_organization_lineage":["https://openalex.org/I77793887"],"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":"article"},{"id":"pmh:oai:pure.tue.nl:publications/72f885f6-e3fa-411a-8ba7-98703b7dde72","is_oa":true,"landing_page_url":"http://www.scopus.com/inward/record.url?scp=85122070577&partnerID=8YFLogxK","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","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","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Fransen, K J C & van Eekelen, J 2023, 'Efficient path planning for automated guided vehicles using A* (Astar) algorithm incorporating turning costs in search heuristic', International Journal of Production Research, vol. 61, no. 3, pp. 707-725. https://doi.org/10.1080/00207543.2021.2015806","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:tue:oai:pure.tue.nl:publications/72f885f6-e3fa-411a-8ba7-98703b7dde72","is_oa":true,"landing_page_url":"https://research.tue.nl/nl/publications/72f885f6-e3fa-411a-8ba7-98703b7dde72","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"International Journal of Production Research, 61(3), 707 - 725. Taylor and Francis Ltd.","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"doi:10.1080/00207543.2021.2015806","is_oa":true,"landing_page_url":"https://doi.org/10.1080/00207543.2021.2015806","pdf_url":"https://www.tandfonline.com/doi/pdf/10.1080/00207543.2021.2015806?needAccess=true","source":{"id":"https://openalex.org/S65690446","display_name":"International Journal of Production Research","issn_l":"0020-7543","issn":["0020-7543","1366-588X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Production Research","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4200090642.pdf"},"referenced_works_count":42,"referenced_works":["https://openalex.org/W1533630040","https://openalex.org/W1576883264","https://openalex.org/W1578493987","https://openalex.org/W1646403467","https://openalex.org/W1969483458","https://openalex.org/W2005247788","https://openalex.org/W2007572995","https://openalex.org/W2012218926","https://openalex.org/W2077383738","https://openalex.org/W2123387707","https://openalex.org/W2138761185","https://openalex.org/W2144931885","https://openalex.org/W2145493798","https://openalex.org/W2155336942","https://openalex.org/W2169528473","https://openalex.org/W2515498963","https://openalex.org/W2535122289","https://openalex.org/W2567289819","https://openalex.org/W2583186934","https://openalex.org/W2735145284","https://openalex.org/W2760335618","https://openalex.org/W2775551125","https://openalex.org/W2807850358","https://openalex.org/W2895842981","https://openalex.org/W2900247898","https://openalex.org/W2902065475","https://openalex.org/W2915129403","https://openalex.org/W2931655483","https://openalex.org/W2957307042","https://openalex.org/W2963695420","https://openalex.org/W2970324170","https://openalex.org/W2970488181","https://openalex.org/W2981026145","https://openalex.org/W2998671458","https://openalex.org/W3005383506","https://openalex.org/W3014514378","https://openalex.org/W3017223648","https://openalex.org/W3017355237","https://openalex.org/W3027209966","https://openalex.org/W3039303163","https://openalex.org/W3125055412","https://openalex.org/W3155489801"],"related_works":["https://openalex.org/W2081821176","https://openalex.org/W4302010637","https://openalex.org/W1622225657","https://openalex.org/W2376959332","https://openalex.org/W2735447218","https://openalex.org/W2885402535","https://openalex.org/W2347472569","https://openalex.org/W2402589461","https://openalex.org/W2224555876","https://openalex.org/W2747118187"],"abstract_inverted_index":{"The":[0,24],"path":[1,18,73,142,183],"planned":[2],"for":[3,9,121,130,168],"an":[4,89,127,196],"automated":[5],"guided":[6],"vehicle":[7],"in,":[8],"example,":[10],"a":[11,20,31,75,144,163],"production":[12],"facility":[13],"is":[14,55,152],"often":[15],"the":[16,27,61,71,84,95,99,112,115,131,140,169,178,181],"lowest-cost":[17,72,96,141,182],"in":[19,26,60,74,111,143,177],"(weighted)":[21],"geometric":[22,76,145],"graph.":[23,77],"weights":[25],"graph":[28,123,146],"may":[29],"represent":[30],"distance":[32],"or":[33,114],"travel":[34],"time.":[35],"Sometimes":[36],"turning":[37,104,148],"costs":[38,105,171],"are":[39,106],"taken":[40,108],"into":[41,109],"account;":[42],"turns":[43,59],"(and":[44],"decelerations":[45],"before":[46],"and":[47,157],"accelerations":[48],"after":[49],"turning)":[50],"take":[51],"time,":[52],"so":[53],"it":[54],"desirable":[56],"to":[57,69,93,138,154,173,184],"minimise":[58],"path.":[62,97],"Several":[63],"well-known":[64],"algorithms":[65],"can":[66,117,135],"be":[67,119,136,155,185],"used":[68,120,137],"find":[70,94,139],"In":[78,98],"this":[79,194],"paper,":[80],"we":[81],"focus":[82],"on":[83],"A\u2217":[85,132],"algorithm,":[86],"which":[87],"uses":[88],"(internal)":[90],"search":[91],"heuristic":[92,113,116,129,151,161],"current":[100],"literature,":[101,179],"generally,":[102],"either":[103],"not":[107],"account":[110],"only":[118],"specific":[122],"structures.":[124],"We":[125,192],"propose":[126],"improved":[128],"algorithm":[133],"that":[134],"with":[147,189],"costs.":[149],"Our":[150],"proven":[153],"monotone":[156],"admissible.":[158],"Moreover,":[159],"our":[160],"provides":[162],"higher":[164],"lower":[165],"bound":[166],"estimate":[167],"actual":[170],"compared":[172],"other":[174],"heuristics":[175],"found":[176,186],"causing":[180],"faster":[187],"(i.e.":[188],"less":[190],"iterations).":[191],"validate":[193],"through":[195],"extensive":[197],"comparative":[198],"study.":[199]},"counts_by_year":[{"year":2026,"cited_by_count":14},{"year":2025,"cited_by_count":33},{"year":2024,"cited_by_count":29},{"year":2023,"cited_by_count":16},{"year":2022,"cited_by_count":7}],"updated_date":"2026-05-22T06:13:13.366637","created_date":"2025-10-10T00:00:00"}