{"id":"https://openalex.org/W2586550301","doi":"https://doi.org/10.1109/smc.2016.7844851","title":"A symbolic motion planning approach for the reach-avoid problem","display_name":"A symbolic motion planning approach for the reach-avoid problem","publication_year":2016,"publication_date":"2016-10-01","ids":{"openalex":"https://openalex.org/W2586550301","doi":"https://doi.org/10.1109/smc.2016.7844851","mag":"2586550301"},"language":"en","primary_location":{"id":"doi:10.1109/smc.2016.7844851","is_oa":false,"landing_page_url":"https://doi.org/10.1109/smc.2016.7844851","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 IEEE International Conference on Systems, Man, and Cybernetics (SMC)","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/A5006340191","display_name":"Laya Shamgah","orcid":"https://orcid.org/0000-0002-1860-3411"},"institutions":[{"id":"https://openalex.org/I35777872","display_name":"North Carolina Agricultural and Technical State University","ror":"https://ror.org/02aze4h65","country_code":"US","type":"education","lineage":["https://openalex.org/I35777872"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Laya Shamgah","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Technical State University, Greensboro, NC, USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Technical State University, Greensboro, NC, USA","institution_ids":["https://openalex.org/I35777872"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5082128797","display_name":"Ali Karimoddini","orcid":"https://orcid.org/0000-0001-6084-6831"},"institutions":[{"id":"https://openalex.org/I35777872","display_name":"North Carolina Agricultural and Technical State University","ror":"https://ror.org/02aze4h65","country_code":"US","type":"education","lineage":["https://openalex.org/I35777872"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ali Karimoddini","raw_affiliation_strings":["Department of Electrical and Computer Engineering, North Carolina A&T State University, Greensboro, NC, US"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, North Carolina A&T State University, Greensboro, NC, US","institution_ids":["https://openalex.org/I35777872"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5054416654","display_name":"Abdollah Homaifar","orcid":"https://orcid.org/0000-0003-1179-3221"},"institutions":[{"id":"https://openalex.org/I35777872","display_name":"North Carolina Agricultural and Technical State University","ror":"https://ror.org/02aze4h65","country_code":"US","type":"education","lineage":["https://openalex.org/I35777872"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Abdollah Homaifar","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Technical State University, Greensboro, NC, USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Technical State University, Greensboro, NC, USA","institution_ids":["https://openalex.org/I35777872"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5006340191"],"corresponding_institution_ids":["https://openalex.org/I35777872"],"apc_list":null,"apc_paid":null,"fwci":0.668,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.78570829,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"003955","last_page":"003960"},"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/T12158","display_name":"Guidance and Control Systems","score":0.9980999827384949,"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/T10142","display_name":"Formal Methods in Verification","score":0.9969000220298767,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.7583845853805542},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.6914918422698975},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.679314374923706},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.5185690522193909},{"id":"https://openalex.org/keywords/adversarial-system","display_name":"Adversarial system","score":0.4790671765804291},{"id":"https://openalex.org/keywords/motion","display_name":"Motion (physics)","score":0.4631039798259735},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.45034828782081604},{"id":"https://openalex.org/keywords/mobile-robot","display_name":"Mobile robot","score":0.4171798825263977},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.35939905047416687},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.358996719121933},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.16647309064865112}],"concepts":[{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.7583845853805542},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.6914918422698975},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.679314374923706},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.5185690522193909},{"id":"https://openalex.org/C37736160","wikidata":"https://www.wikidata.org/wiki/Q1801315","display_name":"Adversarial system","level":2,"score":0.4790671765804291},{"id":"https://openalex.org/C104114177","wikidata":"https://www.wikidata.org/wiki/Q79782","display_name":"Motion (physics)","level":2,"score":0.4631039798259735},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.45034828782081604},{"id":"https://openalex.org/C19966478","wikidata":"https://www.wikidata.org/wiki/Q4810574","display_name":"Mobile robot","level":3,"score":0.4171798825263977},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.35939905047416687},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.358996719121933},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.16647309064865112},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/smc.2016.7844851","is_oa":false,"landing_page_url":"https://doi.org/10.1109/smc.2016.7844851","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 IEEE International Conference on Systems, Man, and Cybernetics (SMC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","score":0.699999988079071,"display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W95556470","https://openalex.org/W1498342204","https://openalex.org/W1559529956","https://openalex.org/W1578630563","https://openalex.org/W2004815408","https://openalex.org/W2023808162","https://openalex.org/W2025629731","https://openalex.org/W2029756211","https://openalex.org/W2041701185","https://openalex.org/W2046635105","https://openalex.org/W2053407718","https://openalex.org/W2066423936","https://openalex.org/W2075110355","https://openalex.org/W2110073061","https://openalex.org/W2115042355","https://openalex.org/W2118525851","https://openalex.org/W2122439876","https://openalex.org/W2132985387","https://openalex.org/W2151958719","https://openalex.org/W2161303196","https://openalex.org/W2163178194","https://openalex.org/W3023554972","https://openalex.org/W6629841916","https://openalex.org/W6777095389"],"related_works":["https://openalex.org/W2502115930","https://openalex.org/W2482350142","https://openalex.org/W1904098742","https://openalex.org/W3158921809","https://openalex.org/W2161428574","https://openalex.org/W2077416514","https://openalex.org/W2618632915","https://openalex.org/W4292862729","https://openalex.org/W2150982344","https://openalex.org/W2157678966"],"abstract_inverted_index":{"This":[0,26],"paper":[1],"addresses":[2],"the":[3,14,30,33,51,58,64,67,75,83,87,90,94,111,115,126,129,133,140,143],"motion":[4,53],"planning":[5,54],"problem":[6,34],"for":[7,50,110],"two":[8],"autonomous":[9],"robots":[10],"(the":[11],"defender":[12,88],"and":[13,55,80,89,132],"attacker)":[15],"with":[16,36,96],"competitive":[17],"objectives,":[18],"which":[19,60],"are":[20,136],"involved":[21],"in":[22],"a":[23,46,108],"reach-avoid":[24],"scenario.":[25],"adversarial":[27,91],"aspect":[28],"of":[29,57,66,86,93,128,142],"game":[31],"makes":[32],"complex":[35],"high":[37],"computational":[38],"cost.":[39],"To":[40],"address":[41],"this":[42],"problem,":[43],"we":[44],"propose":[45],"novel":[47],"symbolic":[48],"approach":[49],"robot":[52,112],"control":[56],"robots,":[59],"can":[61],"effectively":[62],"manage":[63],"complexity":[65],"problem.":[68],"The":[69],"basic":[70],"idea":[71],"is":[72],"to":[73,124,138],"partition":[74],"environment":[76],"into":[77],"convex":[78],"regions,":[79],"then,":[81],"capture":[82],"desired":[84],"objectives":[85],"behavior":[92],"attacker":[95],"temporal":[97],"logic":[98],"formulas.":[99],"We":[100],"also":[101],"use":[102],"finite":[103],"two-player":[104],"zero-sum":[105],"games":[106],"as":[107],"tool":[109],"decision-making":[113],"over":[114],"partitioned":[116],"space.":[117],"An":[118],"illustrative":[119],"examples":[120],"has":[121],"been":[122],"provided":[123],"detail":[125],"steps":[127],"proposed":[130,144],"algorithm":[131],"simulation":[134],"results":[135],"presented":[137],"verify":[139],"effectiveness":[141],"algorithm.":[145]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2018,"cited_by_count":4}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}