{"id":"https://openalex.org/W2888332673","doi":"https://doi.org/10.1109/urai.2018.8441822","title":"Robust Multi-Objective Path Planning for Flying Robots under Wind Disturbance","display_name":"Robust Multi-Objective Path Planning for Flying Robots under Wind Disturbance","publication_year":2018,"publication_date":"2018-06-01","ids":{"openalex":"https://openalex.org/W2888332673","doi":"https://doi.org/10.1109/urai.2018.8441822","mag":"2888332673"},"language":"en","primary_location":{"id":"doi:10.1109/urai.2018.8441822","is_oa":false,"landing_page_url":"https://doi.org/10.1109/urai.2018.8441822","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 15th International Conference on Ubiquitous Robots (UR)","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/A5102731468","display_name":"Yoonseon Oh","orcid":"https://orcid.org/0000-0002-1689-231X"},"institutions":[{"id":"https://openalex.org/I139264467","display_name":"Seoul National University","ror":"https://ror.org/04h9pn542","country_code":"KR","type":"education","lineage":["https://openalex.org/I139264467"]}],"countries":["KR"],"is_corresponding":true,"raw_author_name":"Yoonseon Oh","raw_affiliation_strings":["The Department of Electrical and Computer Engineering, Seoul National University, Seoul, Korea"],"affiliations":[{"raw_affiliation_string":"The Department of Electrical and Computer Engineering, Seoul National University, Seoul, Korea","institution_ids":["https://openalex.org/I139264467"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5034975936","display_name":"Kyunghoon Cho","orcid":"https://orcid.org/0000-0002-4679-6660"},"institutions":[{"id":"https://openalex.org/I139264467","display_name":"Seoul National University","ror":"https://ror.org/04h9pn542","country_code":"KR","type":"education","lineage":["https://openalex.org/I139264467"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Kyunghoon Cho","raw_affiliation_strings":["The Department of Electrical and Computer Engineering, Seoul National University, Seoul, Korea"],"affiliations":[{"raw_affiliation_string":"The Department of Electrical and Computer Engineering, Seoul National University, Seoul, Korea","institution_ids":["https://openalex.org/I139264467"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5033764106","display_name":"Songhwai Oh","orcid":"https://orcid.org/0000-0002-9781-2018"},"institutions":[{"id":"https://openalex.org/I139264467","display_name":"Seoul National University","ror":"https://ror.org/04h9pn542","country_code":"KR","type":"education","lineage":["https://openalex.org/I139264467"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Songhwai Oh","raw_affiliation_strings":["The Department of Electrical and Computer Engineering, Seoul National University, Seoul, Korea"],"affiliations":[{"raw_affiliation_string":"The Department of Electrical and Computer Engineering, Seoul National University, Seoul, Korea","institution_ids":["https://openalex.org/I139264467"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5102731468"],"corresponding_institution_ids":["https://openalex.org/I139264467"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.08576542,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"1","issue":null,"first_page":"670","last_page":"675"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":1.0,"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":1.0,"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/T10191","display_name":"Robotics and Sensor-Based Localization","score":0.986299991607666,"subfield":{"id":"https://openalex.org/subfields/2202","display_name":"Aerospace 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/T10906","display_name":"AI-based Problem Solving and Planning","score":0.980400025844574,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/motion-planning","display_name":"Motion planning","score":0.7882645130157471},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.777410626411438},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.6219457387924194},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5756692886352539},{"id":"https://openalex.org/keywords/trajectory","display_name":"Trajectory","score":0.5115088224411011},{"id":"https://openalex.org/keywords/planner","display_name":"Planner","score":0.47688940167427063},{"id":"https://openalex.org/keywords/collision-avoidance","display_name":"Collision avoidance","score":0.41894274950027466},{"id":"https://openalex.org/keywords/real-time-computing","display_name":"Real-time computing","score":0.3869403600692749},{"id":"https://openalex.org/keywords/simulation","display_name":"Simulation","score":0.378412663936615},{"id":"https://openalex.org/keywords/collision","display_name":"Collision","score":0.30308660864830017},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2640913724899292}],"concepts":[{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.7882645130157471},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.777410626411438},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6219457387924194},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5756692886352539},{"id":"https://openalex.org/C13662910","wikidata":"https://www.wikidata.org/wiki/Q193139","display_name":"Trajectory","level":2,"score":0.5115088224411011},{"id":"https://openalex.org/C2776999362","wikidata":"https://www.wikidata.org/wiki/Q2349274","display_name":"Planner","level":2,"score":0.47688940167427063},{"id":"https://openalex.org/C2780864053","wikidata":"https://www.wikidata.org/wiki/Q5147495","display_name":"Collision avoidance","level":3,"score":0.41894274950027466},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.3869403600692749},{"id":"https://openalex.org/C44154836","wikidata":"https://www.wikidata.org/wiki/Q45045","display_name":"Simulation","level":1,"score":0.378412663936615},{"id":"https://openalex.org/C121704057","wikidata":"https://www.wikidata.org/wiki/Q352070","display_name":"Collision","level":2,"score":0.30308660864830017},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2640913724899292},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","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/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C1276947","wikidata":"https://www.wikidata.org/wiki/Q333","display_name":"Astronomy","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/urai.2018.8441822","is_oa":false,"landing_page_url":"https://doi.org/10.1109/urai.2018.8441822","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 15th International Conference on Ubiquitous Robots (UR)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.8999999761581421,"id":"https://metadata.un.org/sdg/7","display_name":"Affordable and clean energy"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W1498432697","https://openalex.org/W1540883472","https://openalex.org/W1746819321","https://openalex.org/W1970269621","https://openalex.org/W1971086298","https://openalex.org/W1980088782","https://openalex.org/W1995626426","https://openalex.org/W2000359213","https://openalex.org/W2037110062","https://openalex.org/W2071797744","https://openalex.org/W2091682553","https://openalex.org/W2101496914","https://openalex.org/W2103052138","https://openalex.org/W2114072056","https://openalex.org/W2124339220","https://openalex.org/W2131064738","https://openalex.org/W2233446961","https://openalex.org/W2271527152","https://openalex.org/W2735511423","https://openalex.org/W2753014192","https://openalex.org/W2783481590","https://openalex.org/W4211049957","https://openalex.org/W6694082261"],"related_works":["https://openalex.org/W1568779110","https://openalex.org/W804484174","https://openalex.org/W4244698559","https://openalex.org/W4246538999","https://openalex.org/W56933075","https://openalex.org/W1819938260","https://openalex.org/W2340892746","https://openalex.org/W3163022373","https://openalex.org/W3005999311","https://openalex.org/W4381746183"],"abstract_inverted_index":{"This":[0],"paper":[1],"proposes":[2],"a":[3,17,42,72,111,138,153,173],"robust":[4],"multi-objective":[5,112],"path":[6,49,73,113,140,155,166],"planning":[7,114,141],"algorithm":[8],"for":[9,54,100],"flying":[10,55,58,103],"robots":[11,59],"carrying":[12],"out":[13],"complex":[14,30],"missions.":[15],"When":[16],"robot":[18,25,132],"is":[19,26,94],"put":[20],"into":[21],"the":[22,24,48,52,78,118,123,128,131,144,148,158,161,165,184,188,193,198],"field,":[23],"required":[27],"to":[28,50,63,96,156,167],"perform":[29],"missions":[31,40],"such":[32],"as":[33],"visiting":[34],"sequential":[35],"goals.":[36],"We":[37,136,191],"specify":[38],"these":[39,107],"using":[41,172],"linear":[43],"temporal":[44],"logic":[45],"and":[46,122,133,160,196],"search":[47,176],"accomplish":[51,157],"mission":[53,85,119,134,159],"robots.":[56,104],"Since":[57],"are":[60],"more":[61,74],"sensitive":[62],"air":[64],"flow":[65],"than":[66],"ground":[67],"robots,":[68],"we":[69,109],"should":[70],"plan":[71],"carefully":[75],"so":[76],"that":[77],"disturbance":[79],"by":[80,151,200],"airflow":[81],"does":[82],"not":[83],"cause":[84],"failures":[86],"or":[87],"collision":[88],"with":[89],"obstacles.":[90],"In":[91],"addition,":[92],"it":[93],"important":[95],"increase":[97],"energy":[98],"effectiveness":[99,194],"stability":[101],"of":[102,130,187],"To":[105],"achieve":[106],"purposes,":[108],"propose":[110],"problem":[115],"which":[116],"minimizes":[117],"failure":[120],"probability":[121],"moving":[124],"distance":[125],"while":[126],"guaranteeing":[127],"safety":[129],"completion.":[135],"introduce":[137],"multi-layer":[139],"algorithm,":[142],"where":[143],"high-level":[145],"planner":[146,150,163,181],"guides":[147],"low-level":[149,162,180],"generating":[152],"discrete":[154],"searches":[164],"optimize":[168],"multiple":[169],"objective":[170],"functions":[171],"sampling-based":[174],"RRT":[175],"tree.":[177],"The":[178],"presented":[179],"can":[182],"improve":[183],"Pareto":[185],"optimality":[186],"trajectory":[189],"effectively.":[190],"analyze":[192],"theoretically":[195],"evaluate":[197],"performance":[199],"simulations.":[201]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}