{"id":"https://openalex.org/W4414515715","doi":"https://doi.org/10.32604/cmc.2025.067424","title":"Real-Time Dynamic Multiobjective Path Planning: A Case Study","display_name":"Real-Time Dynamic Multiobjective Path Planning: A Case Study","publication_year":2025,"publication_date":"2025-01-01","ids":{"openalex":"https://openalex.org/W4414515715","doi":"https://doi.org/10.32604/cmc.2025.067424"},"language":"en","primary_location":{"id":"doi:10.32604/cmc.2025.067424","is_oa":true,"landing_page_url":"https://doi.org/10.32604/cmc.2025.067424","pdf_url":null,"source":{"id":"https://openalex.org/S4210191605","display_name":"Computers, materials & continua/Computers, materials & continua (Print)","issn_l":"1546-2218","issn":["1546-2218","1546-2226"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computers, Materials &amp; Continua","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://doi.org/10.32604/cmc.2025.067424","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5104171770","display_name":"Hongle Li","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Hongle Li","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5005406818","display_name":"SeongKi Kim","orcid":"https://orcid.org/0000-0002-2664-3632"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"SeongKi Kim","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5104171770"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.245,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.84161244,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":96,"max":99},"biblio":{"volume":"85","issue":"3","first_page":"5571","last_page":"5594"},"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/T11615","display_name":"Control and Dynamics of Mobile Robots","score":0.9503999948501587,"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/motion-planning","display_name":"Motion planning","score":0.6912000179290771},{"id":"https://openalex.org/keywords/adaptability","display_name":"Adaptability","score":0.6304000020027161},{"id":"https://openalex.org/keywords/simulated-annealing","display_name":"Simulated annealing","score":0.49459999799728394},{"id":"https://openalex.org/keywords/robotics","display_name":"Robotics","score":0.49129998683929443},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.47269999980926514},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.45559999346733093},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.44209998846054077}],"concepts":[{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.6912000179290771},{"id":"https://openalex.org/C177606310","wikidata":"https://www.wikidata.org/wiki/Q5674297","display_name":"Adaptability","level":2,"score":0.6304000020027161},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6129999756813049},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5059999823570251},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.4984999895095825},{"id":"https://openalex.org/C126980161","wikidata":"https://www.wikidata.org/wiki/Q863783","display_name":"Simulated annealing","level":2,"score":0.49459999799728394},{"id":"https://openalex.org/C34413123","wikidata":"https://www.wikidata.org/wiki/Q170978","display_name":"Robotics","level":3,"score":0.49129998683929443},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.47269999980926514},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.45559999346733093},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.44209998846054077},{"id":"https://openalex.org/C168167062","wikidata":"https://www.wikidata.org/wiki/Q1117970","display_name":"Component (thermodynamics)","level":2,"score":0.41440001130104065},{"id":"https://openalex.org/C194969405","wikidata":"https://www.wikidata.org/wiki/Q170519","display_name":"Virtual reality","level":2,"score":0.3702999949455261},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.36910000443458557},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.3529999852180481},{"id":"https://openalex.org/C68781425","wikidata":"https://www.wikidata.org/wiki/Q2052203","display_name":"Multi-objective optimization","level":2,"score":0.3102000057697296},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3003999888896942},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.288100004196167},{"id":"https://openalex.org/C155911833","wikidata":"https://www.wikidata.org/wiki/Q3817354","display_name":"Spatial intelligence","level":2,"score":0.26339998841285706},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.26179999113082886},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.25679999589920044}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.32604/cmc.2025.067424","is_oa":true,"landing_page_url":"https://doi.org/10.32604/cmc.2025.067424","pdf_url":null,"source":{"id":"https://openalex.org/S4210191605","display_name":"Computers, materials & continua/Computers, materials & continua (Print)","issn_l":"1546-2218","issn":["1546-2218","1546-2226"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computers, Materials &amp; Continua","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.32604/cmc.2025.067424","is_oa":true,"landing_page_url":"https://doi.org/10.32604/cmc.2025.067424","pdf_url":null,"source":{"id":"https://openalex.org/S4210191605","display_name":"Computers, materials & continua/Computers, materials & continua (Print)","issn_l":"1546-2218","issn":["1546-2218","1546-2226"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computers, Materials &amp; Continua","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W1520111182","https://openalex.org/W1524728167","https://openalex.org/W2022281029","https://openalex.org/W2083211305","https://openalex.org/W2137398591","https://openalex.org/W2140481494","https://openalex.org/W2423456227","https://openalex.org/W2771485560","https://openalex.org/W2804046613","https://openalex.org/W2888156488","https://openalex.org/W2899959996","https://openalex.org/W2979290707","https://openalex.org/W3035005728","https://openalex.org/W3180243400","https://openalex.org/W4229336276","https://openalex.org/W4299335686","https://openalex.org/W4322506064","https://openalex.org/W4327956071","https://openalex.org/W4367839715","https://openalex.org/W4385611410","https://openalex.org/W4387423602","https://openalex.org/W4387880053","https://openalex.org/W4394990042","https://openalex.org/W4404917949","https://openalex.org/W4409380891","https://openalex.org/W4409590370","https://openalex.org/W4410819626","https://openalex.org/W4411448959"],"related_works":[],"abstract_inverted_index":{"Path":[0],"planning":[1,201],"is":[2,131,152],"a":[3,56,74,180,193,209],"fundamental":[4],"component":[5],"in":[6,93,171,202,213,220,223],"robotics":[7,205],"and":[8,20,29,43,77,86,105,116,133,142,156,174,195,204,207,217],"game":[9,84],"artificial":[10],"intelligence":[11],"that":[12,123,138,188],"considerably":[13],"influences":[14],"the":[15,27,124,128,140,147,161,189,224],"motion":[16],"efficiency":[17],"of":[18,31,127,139],"robots":[19],"unmanned":[21],"aerial":[22],"vehicles,":[23],"as":[24,26],"well":[25],"realism":[28],"immersion":[30],"virtual":[32],"environments.":[33,49],"However,":[34],"traditional":[35],"algorithms":[36,114],"are":[37,98],"often":[38],"limited":[39],"to":[40,47,81,168],"single-objective":[41],"optimization":[42],"lack":[44],"real-time":[45,58,177],"adaptability":[46],"dynamic":[48,59,169],"This":[50],"study":[51],"addresses":[52],"these":[53],"limitations":[54],"through":[55],"proposed":[57,71],"multiobjective":[60,199],"(RDMO)":[61],"path-planning":[62],"algorithm":[63,72,130,163,191],"based":[64,111],"on":[65,112],"an":[66],"enhanced":[67],"A*":[68],"framework.":[69],"The":[70,120,184],"employs":[73],"queue-based":[75],"structure":[76],"composite":[78],"multiheuristic":[79],"functions":[80],"dynamically":[82],"manage":[83],"tasks":[85],"compute":[87],"optimal":[88],"paths":[89],"under":[90],"changing-map-connectivity":[91],"conditions":[92],"real":[94],"time.":[95],"Simulation":[96],"experiments":[97],"conducted":[99],"using":[100],"real-world":[101],"road":[102],"network":[103],"data":[104],"benchmarked":[106],"against":[107],"mainstream":[108],"hybrid":[109],"approaches":[110],"genetic":[113],"(GAs)":[115],"simulated":[117],"annealing":[118],"(SA).":[119],"results":[121,186],"show":[122],"computational":[125,182],"speed":[126],"RDMO":[129,162,190],"88":[132],"73":[134],"times":[135],"faster":[136],"than":[137],"GA-":[141],"SA-based":[143],"solutions,":[144],"respectively,":[145],"while":[146],"total":[148],"planned":[149],"path":[150,200],"length":[151],"reduced":[153],"by":[154],"58%":[155],"33%,":[157],"respectively.":[158],"In":[159],"addition,":[160],"also":[164],"shows":[165],"excellent":[166],"responsiveness":[167],"changes":[170],"map":[172],"connectivity":[173],"can":[175],"achieve":[176],"replanning":[178],"with":[179],"minimal":[181],"overhead.":[183],"research":[185],"prove":[187],"provides":[192],"robust":[194],"efficient":[196],"solution":[197],"for":[198],"games":[203],"applications":[206],"has":[208],"great":[210],"application":[211],"potential":[212],"improving":[214],"system":[215],"performance":[216],"user":[218],"experience":[219],"related":[221],"fields":[222],"future.":[225]},"counts_by_year":[{"year":2026,"cited_by_count":1}],"updated_date":"2026-04-03T22:45:19.894376","created_date":"2025-10-10T00:00:00"}
