{"id":"https://openalex.org/W2043108340","doi":"https://doi.org/10.1109/iros.2014.6942980","title":"Safest path adversarial coverage","display_name":"Safest path adversarial coverage","publication_year":2014,"publication_date":"2014-09-01","ids":{"openalex":"https://openalex.org/W2043108340","doi":"https://doi.org/10.1109/iros.2014.6942980","mag":"2043108340"},"language":"en","primary_location":{"id":"doi:10.1109/iros.2014.6942980","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iros.2014.6942980","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 IEEE/RSJ International Conference on Intelligent Robots and Systems","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/A5081870914","display_name":"Roi Yehoshua","orcid":"https://orcid.org/0000-0002-2192-4427"},"institutions":[{"id":"https://openalex.org/I13955877","display_name":"Bar-Ilan University","ror":"https://ror.org/03kgsv495","country_code":"IL","type":"education","lineage":["https://openalex.org/I13955877"]}],"countries":["IL"],"is_corresponding":true,"raw_author_name":"Roi Yehoshua","raw_affiliation_strings":["Computer Science Department, Bar Ilan University, Israel","[Computer Science Department, Bar Ilan University, Israel]"],"affiliations":[{"raw_affiliation_string":"Computer Science Department, Bar Ilan University, Israel","institution_ids":["https://openalex.org/I13955877"]},{"raw_affiliation_string":"[Computer Science Department, Bar Ilan University, Israel]","institution_ids":["https://openalex.org/I13955877"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5055529558","display_name":"Noa Agmon","orcid":"https://orcid.org/0000-0003-0890-7734"},"institutions":[{"id":"https://openalex.org/I13955877","display_name":"Bar-Ilan University","ror":"https://ror.org/03kgsv495","country_code":"IL","type":"education","lineage":["https://openalex.org/I13955877"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Noa Agmon","raw_affiliation_strings":["Computer Science Department, Bar Ilan University, Israel","[Computer Science Department, Bar Ilan University, Israel]"],"affiliations":[{"raw_affiliation_string":"Computer Science Department, Bar Ilan University, Israel","institution_ids":["https://openalex.org/I13955877"]},{"raw_affiliation_string":"[Computer Science Department, Bar Ilan University, Israel]","institution_ids":["https://openalex.org/I13955877"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5012168199","display_name":"Gal A. Kaminka","orcid":"https://orcid.org/0000-0001-8341-322X"},"institutions":[{"id":"https://openalex.org/I13955877","display_name":"Bar-Ilan University","ror":"https://ror.org/03kgsv495","country_code":"IL","type":"education","lineage":["https://openalex.org/I13955877"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Gal A. Kaminka","raw_affiliation_strings":["Gonda Brain Research Center, Bar Ilan University, Israel","[Computer Science Department, Bar Ilan University, Israel]"],"affiliations":[{"raw_affiliation_string":"Gonda Brain Research Center, Bar Ilan University, Israel","institution_ids":["https://openalex.org/I13955877"]},{"raw_affiliation_string":"[Computer Science Department, Bar Ilan University, Israel]","institution_ids":["https://openalex.org/I13955877"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5081870914"],"corresponding_institution_ids":["https://openalex.org/I13955877"],"apc_list":null,"apc_paid":null,"fwci":1.7299,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.87608297,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"17","issue":null,"first_page":"3027","last_page":"3032"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9991000294685364,"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.9991000294685364,"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/T10142","display_name":"Formal Methods in Verification","score":0.9937999844551086,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9846000075340271,"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/adversarial-system","display_name":"Adversarial system","score":0.7542870044708252},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6572950482368469},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.6569778919219971},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.6318995952606201},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.6033995151519775},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.5740060806274414},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.5326597094535828},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5231584310531616},{"id":"https://openalex.org/keywords/robotics","display_name":"Robotics","score":0.5078328251838684},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.49766209721565247},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.436051607131958},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.39040958881378174},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.33624231815338135},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2031227946281433}],"concepts":[{"id":"https://openalex.org/C37736160","wikidata":"https://www.wikidata.org/wiki/Q1801315","display_name":"Adversarial system","level":2,"score":0.7542870044708252},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6572950482368469},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6569778919219971},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6318995952606201},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.6033995151519775},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.5740060806274414},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.5326597094535828},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5231584310531616},{"id":"https://openalex.org/C34413123","wikidata":"https://www.wikidata.org/wiki/Q170978","display_name":"Robotics","level":3,"score":0.5078328251838684},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.49766209721565247},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.436051607131958},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.39040958881378174},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33624231815338135},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2031227946281433},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/iros.2014.6942980","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iros.2014.6942980","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 IEEE/RSJ International Conference on Intelligent Robots and Systems","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.733.57","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.733.57","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://u.cs.biu.ac.il/%7Egalk/Publications/Papers/iros14roi.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1535557537","https://openalex.org/W2019738489","https://openalex.org/W2032507031","https://openalex.org/W2055336889","https://openalex.org/W2093284501","https://openalex.org/W2104733322","https://openalex.org/W2117226423","https://openalex.org/W2142607374","https://openalex.org/W2167554916","https://openalex.org/W6675662259","https://openalex.org/W6677426919"],"related_works":["https://openalex.org/W3183948672","https://openalex.org/W3173606202","https://openalex.org/W3110381201","https://openalex.org/W2948807893","https://openalex.org/W2778153218","https://openalex.org/W2758277628","https://openalex.org/W1531601525","https://openalex.org/W1827895227","https://openalex.org/W4285104409","https://openalex.org/W4210317843"],"abstract_inverted_index":{"Coverage":[0],"is":[1,104],"a":[2,19,32,47,113,122],"fundamental":[3],"problem":[4,73,103],"in":[5,18,42,59,132,144,165],"robotics,":[6],"where":[7],"one":[8],"or":[9],"more":[10],"robots":[11],"are":[12],"required":[13],"to":[14,99,129],"visit":[15],"each":[16],"point":[17],"target":[20],"area":[21],"at":[22],"least":[23],"once.":[24],"While":[25],"most":[26],"previous":[27],"work":[28],"concentrated":[29],"on":[30,139,153],"finding":[31,75,95],"solution":[33,98],"that":[34,62,65,94],"completes":[35],"the":[36,51,56,68,72,76,87,100,140,145,159],"coverage":[37,79,102,116,146],"as":[38,40],"quickly":[39],"possible,":[41],"this":[43],"paper":[44],"we":[45,157],"consider":[46],"new":[48],"version":[49],"of":[50,74,89,161,168],"problem:":[52],"adversarial":[53,78],"coverage.":[54],"Here,":[55],"robot":[57],"operates":[58],"an":[60,96],"environment":[61],"contains":[63],"threats":[64],"might":[66],"stop":[67],"robot.":[69],"We":[70,92,106,135],"introduce":[71],"safest":[77,101],"path,":[80],"and":[81,118,152,170],"present":[82],"different":[83],"optimization":[84],"criteria":[85],"for":[86],"evaluation":[88],"these":[90,150,162],"paths.":[91],"show":[93],"optimal":[97,130],"NP-Complete.":[105],"therefore":[107],"suggest":[108],"two":[109,163],"heuristic":[110],"algorithms:":[111],"STAC,":[112],"spanning-tree":[114],"based":[115],"algorithm,":[117],"GSAC,":[119],"which":[120],"follows":[121],"greedy":[123],"approach.":[124],"These":[125],"algorithms":[126,151,164],"produce":[127],"close":[128],"solutions":[131],"polynomial":[133],"time.":[134],"establish":[136],"theoretical":[137],"bounds":[138],"total":[141],"risk":[142],"involved":[143],"paths":[147],"created":[148],"by":[149],"their":[154],"lengths.":[155],"Lastly,":[156],"compare":[158],"effectiveness":[160],"various":[166],"types":[167],"environments":[169],"settings.":[171]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":5}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}