{"id":"https://openalex.org/W2184014494","doi":"https://doi.org/10.1109/icassp.2016.7472589","title":"Policy recognition via expectation maximization","display_name":"Policy recognition via expectation maximization","publication_year":2016,"publication_date":"2016-03-01","ids":{"openalex":"https://openalex.org/W2184014494","doi":"https://doi.org/10.1109/icassp.2016.7472589","mag":"2184014494"},"language":"en","primary_location":{"id":"doi:10.1109/icassp.2016.7472589","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icassp.2016.7472589","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 Acoustics, Speech and Signal Processing (ICASSP)","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/A5044532188","display_name":"Adrian \u0160o\u0161i\u0107","orcid":"https://orcid.org/0000-0003-2845-6635"},"institutions":[{"id":"https://openalex.org/I31512782","display_name":"Technical University of Darmstadt","ror":"https://ror.org/05n911h24","country_code":"DE","type":"education","lineage":["https://openalex.org/I31512782"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Adrian Sosic","raw_affiliation_strings":["Bioinspired Communication Systems, Technische Universitat Darmstadt, Germany"],"affiliations":[{"raw_affiliation_string":"Bioinspired Communication Systems, Technische Universitat Darmstadt, Germany","institution_ids":["https://openalex.org/I31512782"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5001328562","display_name":"Abdelhak M. Zoubir","orcid":"https://orcid.org/0000-0002-4409-7743"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Abdelhak M. Zoubir","raw_affiliation_strings":["Technische Universitat Darmstadt Fachbereich Biologie, Darmstadt, Hessen, DE"],"affiliations":[{"raw_affiliation_string":"Technische Universitat Darmstadt Fachbereich Biologie, Darmstadt, Hessen, DE","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5070544702","display_name":"Heinz Koeppl","orcid":"https://orcid.org/0000-0002-8305-9379"},"institutions":[{"id":"https://openalex.org/I31512782","display_name":"Technical University of Darmstadt","ror":"https://ror.org/05n911h24","country_code":"DE","type":"education","lineage":["https://openalex.org/I31512782"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Heinz Koeppl","raw_affiliation_strings":["Bioinspired Communication Systems, Technische Universitat Darmstadt, Germany"],"affiliations":[{"raw_affiliation_string":"Bioinspired Communication Systems, Technische Universitat Darmstadt, Germany","institution_ids":["https://openalex.org/I31512782"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5044532188"],"corresponding_institution_ids":["https://openalex.org/I31512782"],"apc_list":null,"apc_paid":null,"fwci":0.857,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.82658502,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":96},"biblio":{"volume":"39","issue":null,"first_page":"4801","last_page":"4805"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10462","display_name":"Reinforcement Learning in Robotics","score":0.9959999918937683,"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"}},"topics":[{"id":"https://openalex.org/T10462","display_name":"Reinforcement Learning in Robotics","score":0.9959999918937683,"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"}},{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.9950000047683716,"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"}},{"id":"https://openalex.org/T11689","display_name":"Adversarial Robustness in Machine Learning","score":0.9848999977111816,"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/computer-science","display_name":"Computer science","score":0.7730345726013184},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.7274030447006226},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.6859810948371887},{"id":"https://openalex.org/keywords/perspective","display_name":"Perspective (graphical)","score":0.6271021366119385},{"id":"https://openalex.org/keywords/identification","display_name":"Identification (biology)","score":0.5996218323707581},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.5959618091583252},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.5817607641220093},{"id":"https://openalex.org/keywords/state-space","display_name":"State space","score":0.5352438688278198},{"id":"https://openalex.org/keywords/control","display_name":"Control (management)","score":0.5044327974319458},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.49548637866973877},{"id":"https://openalex.org/keywords/expectation\u2013maximization-algorithm","display_name":"Expectation\u2013maximization algorithm","score":0.4555637836456299},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.1855776309967041},{"id":"https://openalex.org/keywords/maximum-likelihood","display_name":"Maximum likelihood","score":0.11430719494819641},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.1033802330493927},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.07906067371368408}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7730345726013184},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.7274030447006226},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.6859810948371887},{"id":"https://openalex.org/C12713177","wikidata":"https://www.wikidata.org/wiki/Q1900281","display_name":"Perspective (graphical)","level":2,"score":0.6271021366119385},{"id":"https://openalex.org/C116834253","wikidata":"https://www.wikidata.org/wiki/Q2039217","display_name":"Identification (biology)","level":2,"score":0.5996218323707581},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.5959618091583252},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.5817607641220093},{"id":"https://openalex.org/C72434380","wikidata":"https://www.wikidata.org/wiki/Q230930","display_name":"State space","level":2,"score":0.5352438688278198},{"id":"https://openalex.org/C2775924081","wikidata":"https://www.wikidata.org/wiki/Q55608371","display_name":"Control (management)","level":2,"score":0.5044327974319458},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.49548637866973877},{"id":"https://openalex.org/C182081679","wikidata":"https://www.wikidata.org/wiki/Q1275153","display_name":"Expectation\u2013maximization algorithm","level":3,"score":0.4555637836456299},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.1855776309967041},{"id":"https://openalex.org/C49781872","wikidata":"https://www.wikidata.org/wiki/Q1045555","display_name":"Maximum likelihood","level":2,"score":0.11430719494819641},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.1033802330493927},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.07906067371368408},{"id":"https://openalex.org/C59822182","wikidata":"https://www.wikidata.org/wiki/Q441","display_name":"Botany","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/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/icassp.2016.7472589","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icassp.2016.7472589","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 Acoustics, Speech and Signal Processing (ICASSP)","raw_type":"proceedings-article"},{"id":"pmh:oai:tubiblio.ulb.tu-darmstadt.de:76278","is_oa":false,"landing_page_url":"http://tubiblio.ulb.tu-darmstadt.de/76278/","pdf_url":null,"source":{"id":"https://openalex.org/S4377196390","display_name":"TUbilio (Technical University of Darmstadt)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I31512782","host_organization_name":"Technische Universit\u00e4t Darmstadt","host_organization_lineage":["https://openalex.org/I31512782"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Konferenzver\u00f6ffentlichung"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11","score":0.46000000834465027}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W1490071011","https://openalex.org/W1515851193","https://openalex.org/W1540685400","https://openalex.org/W1554544485","https://openalex.org/W1574859627","https://openalex.org/W1960233492","https://openalex.org/W1976863523","https://openalex.org/W1986014385","https://openalex.org/W1996625075","https://openalex.org/W2020999234","https://openalex.org/W2032170999","https://openalex.org/W2049633694","https://openalex.org/W2051228319","https://openalex.org/W2061562262","https://openalex.org/W2069855531","https://openalex.org/W2086699924","https://openalex.org/W2093333331","https://openalex.org/W2103235543","https://openalex.org/W2119567691","https://openalex.org/W2123117904","https://openalex.org/W2148051740","https://openalex.org/W2159793005","https://openalex.org/W2166302491","https://openalex.org/W2334782222","https://openalex.org/W6632235069","https://openalex.org/W6675474052"],"related_works":["https://openalex.org/W2494523064","https://openalex.org/W2943623134","https://openalex.org/W2588219639","https://openalex.org/W2215759665","https://openalex.org/W2030292806","https://openalex.org/W2960358116","https://openalex.org/W4287727129","https://openalex.org/W1976188970","https://openalex.org/W2990541822","https://openalex.org/W1588885902"],"abstract_inverted_index":{"Learning":[0],"from":[1,39,77],"Demonstrations":[2],"(LfD)":[3],"has":[4],"proven":[5],"to":[6,25,50,56,62,114],"be":[7,23],"a":[8,52,78,84,106],"powerful":[9],"concept":[10],"for":[11,29],"solving":[12],"optimal":[13],"control":[14,31],"problems":[15],"in":[16,118],"high-dimensional":[17],"state":[18,122],"spaces":[19],"where":[20],"demonstrations":[21],"can":[22],"used":[24],"facilitate":[26],"the":[27,48,58,74,97,102,121],"search":[28],"efficient":[30],"policies.":[32],"However,":[33],"many":[34],"existing":[35],"LfD":[36,75],"approaches":[37],"suffer":[38],"either":[40],"theoretical,":[41],"practical,":[42],"or":[43,61],"computational":[44],"drawbacks":[45],"such":[46],"as":[47],"need":[49],"learn":[51],"latent":[53],"reward":[54],"model,":[55],"monitor":[57],"expert's":[59],"controls,":[60],"repeatedly":[63],"solve":[64],"potentially":[65],"demanding":[66],"planning":[67],"problems.":[68,104],"In":[69],"this":[70],"work,":[71],"we":[72,111],"consider":[73],"objective":[76],"system":[79],"identification":[80],"perspective":[81],"and":[82],"propose":[83],"probabilistic":[85],"policy":[86],"recognition":[87],"framework":[88],"based":[89],"on":[90,96],"expectation":[91],"maximization":[92],"that":[93,124],"operates":[94],"directly":[95],"observed":[98],"expert":[99],"trajectories,":[100],"avoiding":[101],"aforementioned":[103],"Using":[105],"spatial":[107],"prior":[108],"over":[109],"policies,":[110],"are":[112,125],"able":[113],"make":[115],"accurate":[116],"predictions":[117],"regions":[119],"of":[120],"space":[123],"scarcely":[126],"explored.":[127]},"counts_by_year":[{"year":2017,"cited_by_count":2}],"updated_date":"2026-02-26T08:16:20.718346","created_date":"2025-10-10T00:00:00"}