{"id":"https://openalex.org/W2995520662","doi":"https://doi.org/10.1109/ritapp.2019.8932804","title":"Optimal Path Planning of Automated Guided Vehicle using Dijkstra Algorithm under Dynamic Conditions","display_name":"Optimal Path Planning of Automated Guided Vehicle using Dijkstra Algorithm under Dynamic Conditions","publication_year":2019,"publication_date":"2019-11-01","ids":{"openalex":"https://openalex.org/W2995520662","doi":"https://doi.org/10.1109/ritapp.2019.8932804","mag":"2995520662"},"language":"en","primary_location":{"id":"doi:10.1109/ritapp.2019.8932804","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ritapp.2019.8932804","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 7th International Conference on Robot Intelligence Technology and Applications (RiTA)","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/A5045881983","display_name":"Sungkwan Kim","orcid":"https://orcid.org/0000-0002-7035-4109"},"institutions":[{"id":"https://openalex.org/I1322422313","display_name":"Korea Polytechnic University","ror":"https://ror.org/0060vt104","country_code":"KR","type":"education","lineage":["https://openalex.org/I1322422313"]}],"countries":["KR"],"is_corresponding":true,"raw_author_name":"Sungkwan Kim","raw_affiliation_strings":["Mechatronics Engineering, Korea Polytechnic University, Siheung, South Korea"],"affiliations":[{"raw_affiliation_string":"Mechatronics Engineering, Korea Polytechnic University, Siheung, South Korea","institution_ids":["https://openalex.org/I1322422313"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5001570778","display_name":"Hojun Jin","orcid":"https://orcid.org/0000-0002-3751-4983"},"institutions":[{"id":"https://openalex.org/I35886859","display_name":"Korea University of Technology and Education","ror":"https://ror.org/053nycv62","country_code":"KR","type":"education","lineage":["https://openalex.org/I35886859"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Hojun Jin","raw_affiliation_strings":["Mechanical Engineering, Korea University of Technology and Education, Cheonan, South Korea"],"affiliations":[{"raw_affiliation_string":"Mechanical Engineering, Korea University of Technology and Education, Cheonan, South Korea","institution_ids":["https://openalex.org/I35886859"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5049991540","display_name":"Minah Seo","orcid":"https://orcid.org/0000-0003-1290-9716"},"institutions":[{"id":"https://openalex.org/I191879574","display_name":"Inha University","ror":"https://ror.org/01easw929","country_code":"KR","type":"education","lineage":["https://openalex.org/I191879574"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Minah Seo","raw_affiliation_strings":["Mechanical Engineering and Logistics Administration, Inha University, Incheon, South Korea"],"affiliations":[{"raw_affiliation_string":"Mechanical Engineering and Logistics Administration, Inha University, Incheon, South Korea","institution_ids":["https://openalex.org/I191879574"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5005393869","display_name":"Dongsoo Har","orcid":"https://orcid.org/0000-0002-6949-1739"},"institutions":[{"id":"https://openalex.org/I118373667","display_name":"Seoul National University of Science and Technology","ror":"https://ror.org/00chfja07","country_code":"KR","type":"education","lineage":["https://openalex.org/I118373667"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Dongsoo Har","raw_affiliation_strings":["Electronics Engineering, Seoul National University, Seoul, South Korea"],"affiliations":[{"raw_affiliation_string":"Electronics Engineering, Seoul National University, Seoul, South Korea","institution_ids":["https://openalex.org/I118373667"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5045881983"],"corresponding_institution_ids":["https://openalex.org/I1322422313"],"apc_list":null,"apc_paid":null,"fwci":2.1257,"has_fulltext":false,"cited_by_count":48,"citation_normalized_percentile":{"value":0.90364987,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":97,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"231","last_page":"236"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9998999834060669,"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.9998999834060669,"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/T11099","display_name":"Autonomous Vehicle Technology and Safety","score":0.9939000010490417,"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"}},{"id":"https://openalex.org/T11615","display_name":"Control and Dynamics of Mobile Robots","score":0.9900000095367432,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems 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/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.8941634297370911},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6784313917160034},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.5332562327384949},{"id":"https://openalex.org/keywords/pathfinding","display_name":"Pathfinding","score":0.5314976572990417},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5169965028762817},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5038272738456726},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.3287760615348816},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.24406221508979797},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.1432974934577942},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.10003817081451416},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.07090252637863159},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.06169697642326355}],"concepts":[{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.8941634297370911},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6784313917160034},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.5332562327384949},{"id":"https://openalex.org/C25321074","wikidata":"https://www.wikidata.org/wiki/Q1969601","display_name":"Pathfinding","level":4,"score":0.5314976572990417},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5169965028762817},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5038272738456726},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.3287760615348816},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.24406221508979797},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.1432974934577942},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.10003817081451416},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.07090252637863159},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.06169697642326355}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/ritapp.2019.8932804","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ritapp.2019.8932804","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 7th International Conference on Robot Intelligence Technology and Applications (RiTA)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Affordable and clean energy","score":0.9100000262260437,"id":"https://metadata.un.org/sdg/7"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W187146046","https://openalex.org/W854839105","https://openalex.org/W1567193306","https://openalex.org/W2016087887","https://openalex.org/W2087167535","https://openalex.org/W2117168072","https://openalex.org/W2137575531","https://openalex.org/W2141392918","https://openalex.org/W2150010456","https://openalex.org/W2535562505","https://openalex.org/W2580434964","https://openalex.org/W2612665926","https://openalex.org/W2613614720","https://openalex.org/W2977275967","https://openalex.org/W4294360851","https://openalex.org/W6634211352","https://openalex.org/W6729058442","https://openalex.org/W6732747686","https://openalex.org/W6737112841","https://openalex.org/W6768530700"],"related_works":["https://openalex.org/W4285687848","https://openalex.org/W223921116","https://openalex.org/W2982088850","https://openalex.org/W3216780016","https://openalex.org/W4402599120","https://openalex.org/W78690942","https://openalex.org/W4221129498","https://openalex.org/W2887026015","https://openalex.org/W2361442013","https://openalex.org/W2886722595"],"abstract_inverted_index":{"This":[0],"paper":[1],"presents":[2],"an":[3,19,141,166],"optimal":[4,167,187],"path":[5,109,168],"planning":[6,110],"aiming":[7],"at":[8],"minimization":[9,175],"of":[10,15,18,55,66,79,81,89,94,114,131,140,176,182],"energy":[11,133,178],"consumption":[12,179],"and":[13,34,68,74,103,143,180],"decrement":[14],"operation":[16,26,183],"time":[17,184],"automated":[20],"guided":[21],"vehicle":[22],"(AGV)":[23],"under":[24],"dynamic":[25],"conditions":[27],"in":[28,50,62],"a":[29,41,51,63,87,97],"graph":[30,64,155],"containing":[31],"random":[32],"slopes":[33,73],"distances.":[35],"To":[36],"convey":[37],"one":[38],"load":[39],"to":[40,60,108,124,136,164],"desired-":[42],"destination":[43],"by":[44],"AGVs":[45],"is":[46,101,106,127,162],"considered":[47],"common":[48],"practice":[49],"logistic":[52],"center.":[53],"Loads":[54],"varying":[56],"mass":[57,138],"are":[58,83,150],"transferred":[59],"desired-destinations":[61],"composed":[65],"vertices":[67,149],"edges.":[69],"In":[70],"the":[71,95,115,122,132,137,146,154,157,159,170,186],"graph,":[72],"distances":[75],"required":[76],"for":[77,129,169],"calculation":[78,130],"weight":[80],"edges":[82],"randomly":[84],"given":[85],"between":[86,148],"pair":[88],"vertices.":[90],"Considering":[91],"tractive":[92,98],"forces":[93],"AGV,":[96],"force":[99],"model":[100,105],"developed":[102],"this":[104],"applied":[107,163],"method.":[111],"Mass":[112],"variation":[113,139],"AGV":[116,142],"that":[117],"occurs":[118],"when":[119],"it":[120],"places":[121],"loads":[123],"each":[125],"vertex":[126],"used":[128],"consumption.":[134],"According":[135],"road":[144],"conditions,":[145],"weights":[147],"determined.":[151],"Based":[152],"on":[153],"with":[156,185],"weights,":[158],"Dijkstra":[160],"algorithm":[161],"get":[165],"AGV.":[171],"Proposed":[172],"approach":[173],"demonstrates":[174],"AGV\u2019s":[177],"improvement":[181],"path.":[188]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":9},{"year":2023,"cited_by_count":12},{"year":2022,"cited_by_count":10},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":6}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}