{"id":"https://openalex.org/W7224764299","doi":"https://doi.org/10.3390/aerospace13111004","title":"Risk-Aware Task Allocation and Scheduling Considering Platform States for Heterogeneous Unmanned Systems","display_name":"Risk-Aware Task Allocation and Scheduling Considering Platform States for Heterogeneous Unmanned Systems","publication_year":2026,"publication_date":"2026-10-30","ids":{"openalex":"https://openalex.org/W7224764299","doi":"https://doi.org/10.3390/aerospace13111004"},"language":"en","primary_location":{"id":"doi:10.3390/aerospace13111004","doi":"https://doi.org/10.3390/aerospace13111004","is_oa":true,"landing_page_url":"https://doi.org/10.3390/aerospace13111004","pdf_url":null,"source":{"id":"https://openalex.org/S4210169245","display_name":"Aerospace","issn_l":"2226-4310","issn":["2226-4310"],"is_oa":true,"is_in_doaj":true,"is_core":true,"listed_in":["cwts-core","doaj","norway-1","poland-70","russia-white-list-1"],"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Aerospace","raw_type":"journal-article"},"volume":null,"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://doi.org/10.3390/aerospace13111004","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5113390725","display_name":"Seokjin Kang","orcid":"https://orcid.org/0009-0003-2338-3454","observed_orcids":["https://orcid.org/0009-0003-2338-3454"]},"institutions":[{"id":"https://openalex.org/I113409471","display_name":"Kumoh National Institute of Technology","ror":"https://ror.org/05dkjfz60","country_code":"KR","type":"education","lineage":["https://openalex.org/I113409471"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Seokjin Kang","raw_affiliation_strings":["Department of IT Convergence Engineering, Kumoh National Institute of Technology, Gumi 39177, Republic of Korea"],"raw_orcid":"https://orcid.org/0009-0003-2338-3454","affiliations":[{"raw_affiliation_string":"Department of IT Convergence Engineering, Kumoh National Institute of Technology, Gumi 39177, Republic of Korea","institution_ids":["https://openalex.org/I113409471"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5086968888","display_name":"Seokyoung Kim","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I4210164548","display_name":"Gyeongbuk IT Convergence Industrial Technology Institute","ror":"https://ror.org/05mfwdr57","country_code":"KR","type":"education","lineage":["https://openalex.org/I4210164548"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Seokyoung Kim","raw_affiliation_strings":["Gyeongbuk Institute of IT Convergence Industry Technology, Gyeongsan 38463, Republic of Korea"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Gyeongbuk Institute of IT Convergence Industry Technology, Gyeongsan 38463, Republic of Korea","institution_ids":["https://openalex.org/I4210164548"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5160190060","display_name":"Jung-Hae Choi","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Jung-Hae Choi","raw_affiliation_strings":["Daegyeong Electronics Inc., Yeongcheon 38882, Republic of Korea"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Daegyeong Electronics Inc., Yeongcheon 38882, Republic of Korea","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5035064525","display_name":"Heoncheol Lee","orcid":"https://orcid.org/0000-0003-2962-3474","observed_orcids":["https://orcid.org/0000-0003-2962-3474"]},"institutions":[{"id":"https://openalex.org/I113409471","display_name":"Kumoh National Institute of Technology","ror":"https://ror.org/05dkjfz60","country_code":"KR","type":"education","lineage":["https://openalex.org/I113409471"]}],"countries":["KR"],"is_corresponding":true,"raw_author_name":"Heoncheol Lee","raw_affiliation_strings":["Department of IT Convergence Engineering, Kumoh National Institute of Technology, Gumi 39177, Republic of Korea"],"raw_orcid":"https://orcid.org/0000-0003-2962-3474","affiliations":[{"raw_affiliation_string":"Department of IT Convergence Engineering, Kumoh National Institute of Technology, Gumi 39177, Republic of Korea","institution_ids":["https://openalex.org/I113409471"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5035064525"],"corresponding_institution_ids":["https://openalex.org/I113409471"],"apc_list":{"value":2400,"currency":"CHF","value_usd":2896},"apc_paid":{"value":2400,"currency":"CHF","value_usd":2896},"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.82566852,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"13","issue":"11","first_page":"1004","last_page":"1004"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.48969998955726624,"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.48969998955726624,"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.1266999989748001,"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/T10249","display_name":"Distributed Control Multi-Agent Systems","score":0.06400000303983688,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/task-allocation","display_name":"task allocation","score":0.8730000257492065},{"id":"https://openalex.org/keywords/mission-scheduling","display_name":"mission scheduling","score":0.9599999785423279},{"id":"https://openalex.org/keywords/risk-aware-scheduling","display_name":"risk-aware scheduling","score":0.9480000138282776},{"id":"https://openalex.org/keywords/battery-constraints","display_name":"battery constraints","score":0.8130000233650208},{"id":"https://openalex.org/keywords/task-compatibility","display_name":"task compatibility","score":0.7860000133514404},{"id":"https://openalex.org/keywords/makespan-minimization","display_name":"makespan minimization","score":0.6930000185966492},{"id":"https://openalex.org/keywords/genetic-algorithm-comparison","display_name":"genetic algorithm comparison","score":0.531000018119812}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6164000034332275},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.551800012588501},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.5497999787330627},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.45489999651908875},{"id":"https://openalex.org/C86251818","wikidata":"https://www.wikidata.org/wiki/Q816754","display_name":"Benchmarking","level":2,"score":0.4526999890804291},{"id":"https://openalex.org/C105339364","wikidata":"https://www.wikidata.org/wiki/Q2297740","display_name":"Software deployment","level":2,"score":0.4489000141620636},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.44029998779296875},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4390000104904175},{"id":"https://openalex.org/C12725497","wikidata":"https://www.wikidata.org/wiki/Q810247","display_name":"Baseline (sea)","level":2,"score":0.3871000111103058},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.3785000145435333},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.36000001430511475},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.34310001134872437},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.3384999930858612},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.31439998745918274},{"id":"https://openalex.org/C2778648169","wikidata":"https://www.wikidata.org/wiki/Q967768","display_name":"Compatibility (geochemistry)","level":2,"score":0.30820000171661377},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.28780001401901245},{"id":"https://openalex.org/C80519477","wikidata":"https://www.wikidata.org/wiki/Q3532236","display_name":"Scenario testing","level":3,"score":0.2833999991416931},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.272599995136261},{"id":"https://openalex.org/C21200559","wikidata":"https://www.wikidata.org/wiki/Q7451068","display_name":"Sensitivity (control systems)","level":2,"score":0.2703999876976013},{"id":"https://openalex.org/C128942645","wikidata":"https://www.wikidata.org/wiki/Q1568346","display_name":"Test case","level":3,"score":0.263700008392334},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.262800008058548},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.25780001282691956},{"id":"https://openalex.org/C194051981","wikidata":"https://www.wikidata.org/wiki/Q1337691","display_name":"Economic shortage","level":3,"score":0.2540000081062317}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.3390/aerospace13111004","doi":"https://doi.org/10.3390/aerospace13111004","is_oa":true,"landing_page_url":"https://doi.org/10.3390/aerospace13111004","pdf_url":null,"source":{"id":"https://openalex.org/S4210169245","display_name":"Aerospace","issn_l":"2226-4310","issn":["2226-4310"],"is_oa":true,"is_in_doaj":true,"is_core":true,"listed_in":["cwts-core","doaj","norway-1","poland-70","russia-white-list-1"],"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Aerospace","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.3390/aerospace13111004","doi":"https://doi.org/10.3390/aerospace13111004","is_oa":true,"landing_page_url":"https://doi.org/10.3390/aerospace13111004","pdf_url":null,"source":{"id":"https://openalex.org/S4210169245","display_name":"Aerospace","issn_l":"2226-4310","issn":["2226-4310"],"is_oa":true,"is_in_doaj":true,"is_core":true,"listed_in":["cwts-core","doaj","norway-1","poland-70","russia-white-list-1"],"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Aerospace","raw_type":"journal-article"},"sustainable_development_goals":[{"display_name":"Industry, innovation and infrastructure","score":0.4943999946117401,"id":"https://metadata.un.org/sdg/9"}],"study_designs":[],"awards":[],"funders":[{"id":"https://openalex.org/F2292562827","display_name":"Korea Research Institute for Defense Technology Planning and Advancement","ror":"https://ror.org/01sh37d54"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W4376113612","https://openalex.org/W4312683597","https://openalex.org/W4295992773","https://openalex.org/W4412065967","https://openalex.org/W7170071326","https://openalex.org/W7222968740","https://openalex.org/W7169081556","https://openalex.org/W4388561692","https://openalex.org/W7202295611","https://openalex.org/W2032050463"],"abstract_inverted_index":{"High-level":[0],"mission":[1,134],"scheduling":[2],"for":[3,9],"heterogeneous":[4],"UAV\u2013UGV":[5],"teams":[6],"must":[7],"account":[8],"travel":[10,29],"efficiency,":[11],"environmental":[12],"exposure,":[13],"platform":[14],"condition,":[15],"and":[16,34,40,52,87,107],"task":[17],"compatibility.":[18],"We":[19],"propose":[20],"a":[21,58,61,66,88,108,145],"global":[22],"incremental":[23],"scheduler":[24],"that":[25],"combines":[26],"the":[27,46,73,80,94,97,121,132],"normalized":[28],"distance,":[30],"platform-dependent":[31],"heuristic":[32,142],"risk,":[33],"battery-based":[35],"state":[36],"while":[37],"enforcing":[38],"compatibility":[39],"battery":[41],"constraints.":[42],"Across":[43],"matched":[44],"simulations,":[45],"method":[47,75],"adapted":[48],"assignments":[49],"to":[50],"risk":[51],"degraded":[53],"platforms.":[54],"Additional":[55],"benchmarking":[56],"found":[57],"quality\u2013runtime":[59],"trade-off:":[60],"genetic":[62],"algorithm":[63],"baseline":[64],"achieved":[65],"lower":[67],"mean":[68],"small-case":[69],"objective":[70],"gap,":[71],"whereas":[72],"proposed":[74],"ran":[76],"much":[77],"faster":[78],"in":[79,123,131],"tested":[81],"moderate":[82],"cases.":[83],"Risk":[84],"parameter":[85],"sensitivity":[86],"synthetic":[89],"extended-energy":[90],"stress":[91],"test":[92],"characterized":[93],"limits":[95],"of":[96,114],"observed":[98],"adaptation.":[99],"Exact-certified":[100],"restrictive":[101],"cases":[102,126],"exposed":[103],"greedy":[104],"dead":[105],"ends,":[106],"separate":[109,117],"bounded":[110],"repair":[111],"recovered":[112],"most":[113],"them.":[115],"A":[116],"time-aware":[118],"comparator":[119],"reduced":[120],"makespan":[122],"many":[124],"paired":[125],"at":[127],"an":[128,139],"average":[129],"increase":[130],"original":[133],"cost.":[135],"The":[136],"results":[137],"characterize":[138],"offline,":[140],"high-level":[141],"rather":[143],"than":[144],"globally":[146],"optimal":[147],"or":[148],"physically":[149],"validated":[150],"deployment":[151],"method.":[152]},"counts_by_year":[],"updated_date":"2026-11-01T11:40:01.658920","created_date":"2026-10-31T00:00:00"}