{"id":"https://openalex.org/W2967025328","doi":"https://doi.org/10.1109/icra.2019.8794305","title":"Tree Search Techniques for Minimizing Detectability and Maximizing Visibility","display_name":"Tree Search Techniques for Minimizing Detectability and Maximizing Visibility","publication_year":2019,"publication_date":"2019-05-01","ids":{"openalex":"https://openalex.org/W2967025328","doi":"https://doi.org/10.1109/icra.2019.8794305","mag":"2967025328"},"language":"en","primary_location":{"id":"doi:10.1109/icra.2019.8794305","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icra.2019.8794305","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 International Conference on Robotics and Automation (ICRA)","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/A5006278157","display_name":"Zhongshun Zhang","orcid":"https://orcid.org/0000-0002-3912-7629"},"institutions":[{"id":"https://openalex.org/I859038795","display_name":"Virginia Tech","ror":"https://ror.org/02smfhw86","country_code":"US","type":"education","lineage":["https://openalex.org/I859038795"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Zhongshun Zhang","raw_affiliation_strings":["Department of Electrical & Computer Engineering, Virginia Tech, USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical & Computer Engineering, Virginia Tech, USA","institution_ids":["https://openalex.org/I859038795"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100362492","display_name":"Joseph Lee","orcid":"https://orcid.org/0000-0003-1897-6290"},"institutions":[{"id":"https://openalex.org/I4210088792","display_name":"United States Army","ror":"https://ror.org/00afsp483","country_code":"US","type":"funder","lineage":["https://openalex.org/I1304082316","https://openalex.org/I1330347796","https://openalex.org/I4210088792"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Joseph Lee","raw_affiliation_strings":["U.S. Army TARDEC Ground Vehicle Robotics, Warren, MI, USA"],"affiliations":[{"raw_affiliation_string":"U.S. Army TARDEC Ground Vehicle Robotics, Warren, MI, USA","institution_ids":["https://openalex.org/I4210088792"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5036239586","display_name":"Jonathon M. Smereka","orcid":"https://orcid.org/0000-0001-9262-1143"},"institutions":[{"id":"https://openalex.org/I4210088792","display_name":"United States Army","ror":"https://ror.org/00afsp483","country_code":"US","type":"funder","lineage":["https://openalex.org/I1304082316","https://openalex.org/I1330347796","https://openalex.org/I4210088792"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jonathon M. Smereka","raw_affiliation_strings":["U.S. Army TARDEC Ground Vehicle Robotics, Warren, MI, USA"],"affiliations":[{"raw_affiliation_string":"U.S. Army TARDEC Ground Vehicle Robotics, Warren, MI, USA","institution_ids":["https://openalex.org/I4210088792"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5021197317","display_name":"Yoonchang Sung","orcid":"https://orcid.org/0000-0002-6811-1490"},"institutions":[{"id":"https://openalex.org/I859038795","display_name":"Virginia Tech","ror":"https://ror.org/02smfhw86","country_code":"US","type":"education","lineage":["https://openalex.org/I859038795"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yoonchang Sung","raw_affiliation_strings":["Department of Electrical & Computer Engineering, Virginia Tech, USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical & Computer Engineering, Virginia Tech, USA","institution_ids":["https://openalex.org/I859038795"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5041045546","display_name":"Lifeng Zhou","orcid":"https://orcid.org/0000-0001-7927-8504"},"institutions":[{"id":"https://openalex.org/I859038795","display_name":"Virginia Tech","ror":"https://ror.org/02smfhw86","country_code":"US","type":"education","lineage":["https://openalex.org/I859038795"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Lifeng Zhou","raw_affiliation_strings":["Department of Electrical & Computer Engineering, Virginia Tech, USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical & Computer Engineering, Virginia Tech, USA","institution_ids":["https://openalex.org/I859038795"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5086188394","display_name":"Pratap Tokekar","orcid":"https://orcid.org/0000-0002-3715-0382"},"institutions":[{"id":"https://openalex.org/I859038795","display_name":"Virginia Tech","ror":"https://ror.org/02smfhw86","country_code":"US","type":"education","lineage":["https://openalex.org/I859038795"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Pratap Tokekar","raw_affiliation_strings":["Department of Electrical & Computer Engineering, Virginia Tech, USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical & Computer Engineering, Virginia Tech, USA","institution_ids":["https://openalex.org/I859038795"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":6,"corresponding_author_ids":["https://openalex.org/A5006278157"],"corresponding_institution_ids":["https://openalex.org/I859038795"],"apc_list":null,"apc_paid":null,"fwci":1.1901,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.8359221,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"8791","last_page":"8797"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12158","display_name":"Guidance and Control Systems","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T12158","display_name":"Guidance and Control Systems","score":0.9998999834060669,"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/T13371","display_name":"Military Defense Systems Analysis","score":0.9991000294685364,"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/T11574","display_name":"Artificial Intelligence in Games","score":0.993399977684021,"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/monte-carlo-tree-search","display_name":"Monte Carlo tree search","score":0.8301127552986145},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6490774154663086},{"id":"https://openalex.org/keywords/minimax","display_name":"Minimax","score":0.6473984122276306},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.6387908458709717},{"id":"https://openalex.org/keywords/search-tree","display_name":"Search tree","score":0.6265268325805664},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6241257190704346},{"id":"https://openalex.org/keywords/visibility","display_name":"Visibility","score":0.5704797506332397},{"id":"https://openalex.org/keywords/pruning","display_name":"Pruning","score":0.5664563179016113},{"id":"https://openalex.org/keywords/guard","display_name":"Guard (computer science)","score":0.5461706519126892},{"id":"https://openalex.org/keywords/game-tree","display_name":"Game tree","score":0.4568544030189514},{"id":"https://openalex.org/keywords/monte-carlo-method","display_name":"Monte Carlo method","score":0.4418797492980957},{"id":"https://openalex.org/keywords/pursuit-evasion","display_name":"Pursuit-evasion","score":0.41756904125213623},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.4128819704055786},{"id":"https://openalex.org/keywords/game-theory","display_name":"Game theory","score":0.331345796585083},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3231310248374939},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.26042765378952026},{"id":"https://openalex.org/keywords/sequential-game","display_name":"Sequential game","score":0.18735602498054504}],"concepts":[{"id":"https://openalex.org/C46149586","wikidata":"https://www.wikidata.org/wiki/Q11785332","display_name":"Monte Carlo tree search","level":3,"score":0.8301127552986145},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6490774154663086},{"id":"https://openalex.org/C149728462","wikidata":"https://www.wikidata.org/wiki/Q751319","display_name":"Minimax","level":2,"score":0.6473984122276306},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.6387908458709717},{"id":"https://openalex.org/C207024777","wikidata":"https://www.wikidata.org/wiki/Q621673","display_name":"Search tree","level":3,"score":0.6265268325805664},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6241257190704346},{"id":"https://openalex.org/C123403432","wikidata":"https://www.wikidata.org/wiki/Q654068","display_name":"Visibility","level":2,"score":0.5704797506332397},{"id":"https://openalex.org/C108010975","wikidata":"https://www.wikidata.org/wiki/Q500094","display_name":"Pruning","level":2,"score":0.5664563179016113},{"id":"https://openalex.org/C141141315","wikidata":"https://www.wikidata.org/wiki/Q2379942","display_name":"Guard (computer science)","level":2,"score":0.5461706519126892},{"id":"https://openalex.org/C95815963","wikidata":"https://www.wikidata.org/wiki/Q1377033","display_name":"Game tree","level":4,"score":0.4568544030189514},{"id":"https://openalex.org/C19499675","wikidata":"https://www.wikidata.org/wiki/Q232207","display_name":"Monte Carlo method","level":2,"score":0.4418797492980957},{"id":"https://openalex.org/C2778388243","wikidata":"https://www.wikidata.org/wiki/Q7261573","display_name":"Pursuit-evasion","level":2,"score":0.41756904125213623},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.4128819704055786},{"id":"https://openalex.org/C177142836","wikidata":"https://www.wikidata.org/wiki/Q44455","display_name":"Game theory","level":2,"score":0.331345796585083},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3231310248374939},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.26042765378952026},{"id":"https://openalex.org/C73795354","wikidata":"https://www.wikidata.org/wiki/Q287618","display_name":"Sequential game","level":3,"score":0.18735602498054504},{"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/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C6557445","wikidata":"https://www.wikidata.org/wiki/Q173113","display_name":"Agronomy","level":1,"score":0.0},{"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/C144237770","wikidata":"https://www.wikidata.org/wiki/Q747534","display_name":"Mathematical economics","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C120665830","wikidata":"https://www.wikidata.org/wiki/Q14620","display_name":"Optics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icra.2019.8794305","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icra.2019.8794305","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 International Conference on Robotics and Automation (ICRA)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W139348739","https://openalex.org/W1966360761","https://openalex.org/W1986642089","https://openalex.org/W2030705305","https://openalex.org/W2075967785","https://openalex.org/W2087421501","https://openalex.org/W2094658339","https://openalex.org/W2122410182","https://openalex.org/W2162428884","https://openalex.org/W2200450867","https://openalex.org/W2224879568","https://openalex.org/W2396961959","https://openalex.org/W2570698305","https://openalex.org/W2623293810","https://openalex.org/W2738456059","https://openalex.org/W2793805062","https://openalex.org/W2796310739","https://openalex.org/W2883542314","https://openalex.org/W6605849008","https://openalex.org/W6683336107","https://openalex.org/W6688673858","https://openalex.org/W6712451147","https://openalex.org/W6750095589","https://openalex.org/W6753197520"],"related_works":["https://openalex.org/W4383535542","https://openalex.org/W3193783858","https://openalex.org/W4383560925","https://openalex.org/W2523674799","https://openalex.org/W1973194029","https://openalex.org/W2102256448","https://openalex.org/W4323526614","https://openalex.org/W4327811054","https://openalex.org/W4322703856","https://openalex.org/W2188928203"],"abstract_inverted_index":{"We":[0,101,138,173],"introduce":[1],"and":[2,37,57,88,117,136],"study":[3],"the":[4,43,67,78,82,126,145,157,170,177,191],"problem":[5,93],"of":[6,32,105,164,185],"planning":[7],"a":[8,16,29,46,58,74,95],"trajectory":[9],"for":[10,49,77],"an":[11,24],"agent":[12,44,79],"to":[13,72,110,143,169,190],"carry":[14],"out":[15],"reconnaissance":[17],"mission":[18],"while":[19,148],"avoiding":[20],"being":[21],"detected":[22,65],"by":[23,66],"adversarial":[25],"guard.":[26,68],"This":[27],"introduces":[28],"multi-objective":[30],"version":[31],"classical":[33],"visibility-based":[34],"target":[35],"search":[36,108,115,119,122,179,193],"pursuit-evasion":[38],"problem.":[39],"In":[40],"our":[41],"formulation,":[42],"receives":[45],"positive":[47],"reward":[48],"increasing":[50],"its":[51],"visibility":[52,87],"(by":[53],"exploring":[54],"new":[55],"regions)":[56],"negative":[59],"penalty":[60],"every":[61],"time":[62,135,187],"it":[63],"is":[64,71],"The":[69],"objective":[70],"find":[73,175],"finite-horizon":[75],"path":[76],"that":[80,156,176],"balances":[81],"trade":[83],"off":[84],"between":[85],"maximizing":[86],"minimizing":[89],"detectability.We":[90],"model":[91],"this":[92,112],"as":[94,167,188],"discrete,":[96],"sequential,":[97],"two-player,":[98],"zero-sum":[99],"game.":[100],"use":[102],"two":[103],"types":[104],"game":[106],"tree":[107,116,180],"algorithms":[109],"solve":[111],"problem:":[113],"minimax":[114,192],"Monte-Carlo":[118,178],"tree.":[120,194],"Both":[121],"trees":[123],"can":[124],"yield":[125],"optimal":[127],"policy":[128],"but":[129],"may":[130],"require":[131],"possibly":[132],"exponential":[133],"computational":[134,146,186],"space.":[137],"propose":[139],"several":[140],"pruning":[141],"techniques":[142],"reduce":[144],"cost":[147],"still":[149],"preserving":[150],"optimality":[151],"guarantees.":[152],"Simulation":[153],"results":[154],"show":[155],"proposed":[158],"strategy":[159],"prunes":[160],"approximately":[161,182],"three":[162],"orders":[163],"magnitude":[165],"nodes":[166],"compared":[168,189],"brute-force":[171],"strategy.":[172],"also":[174],"saves":[181],"one":[183],"order":[184]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2021,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}