{"id":"https://openalex.org/W2210333289","doi":"https://doi.org/10.1109/humanoids.2015.7363566","title":"Touch based POMDP manipulation via sequential submodular optimization","display_name":"Touch based POMDP manipulation via sequential submodular optimization","publication_year":2015,"publication_date":"2015-11-01","ids":{"openalex":"https://openalex.org/W2210333289","doi":"https://doi.org/10.1109/humanoids.2015.7363566","mag":"2210333289"},"language":"en","primary_location":{"id":"doi:10.1109/humanoids.2015.7363566","is_oa":false,"landing_page_url":"https://doi.org/10.1109/humanoids.2015.7363566","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 IEEE-RAS 15th International Conference on Humanoid Robots (Humanoids)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5043775193","display_name":"Ngo Anh Vien","orcid":"https://orcid.org/0000-0001-9646-267X"},"institutions":[{"id":"https://openalex.org/I100066346","display_name":"University of Stuttgart","ror":"https://ror.org/04vnq7t77","country_code":"DE","type":"education","lineage":["https://openalex.org/I100066346"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Ngo Anh Vien","raw_affiliation_strings":["Machine Learning & Robotics Lab, University of Stuttgart, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Machine Learning & Robotics Lab, University of Stuttgart, Germany","institution_ids":["https://openalex.org/I100066346"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5065672819","display_name":"Marc Toussaint","orcid":"https://orcid.org/0000-0002-5487-6767"},"institutions":[{"id":"https://openalex.org/I100066346","display_name":"University of Stuttgart","ror":"https://ror.org/04vnq7t77","country_code":"DE","type":"education","lineage":["https://openalex.org/I100066346"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Marc Toussaint","raw_affiliation_strings":["Machine Learning & Robotics Lab, University of Stuttgart, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Machine Learning & Robotics Lab, University of Stuttgart, Germany","institution_ids":["https://openalex.org/I100066346"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I100066346"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"407","last_page":"413"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10462","display_name":"Reinforcement Learning in Robotics","score":0.9993000030517578,"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.9993000030517578,"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9969000220298767,"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/T11704","display_name":"Mobile Crowdsensing and Crowdsourcing","score":0.9951000213623047,"subfield":{"id":"https://openalex.org/subfields/1706","display_name":"Computer Science Applications"},"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/partially-observable-markov-decision-process","display_name":"Partially observable Markov decision process","score":0.8502101302146912},{"id":"https://openalex.org/keywords/submodular-set-function","display_name":"Submodular set function","score":0.7858666181564331},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7352827787399292},{"id":"https://openalex.org/keywords/observability","display_name":"Observability","score":0.7069566249847412},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.5872738361358643},{"id":"https://openalex.org/keywords/markov-decision-process","display_name":"Markov decision process","score":0.5130754709243774},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4438014626502991},{"id":"https://openalex.org/keywords/hierarchy","display_name":"Hierarchy","score":0.4330514669418335},{"id":"https://openalex.org/keywords/curse-of-dimensionality","display_name":"Curse of dimensionality","score":0.4326602518558502},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.4277242124080658},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.4235248565673828},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.41318923234939575},{"id":"https://openalex.org/keywords/markov-process","display_name":"Markov process","score":0.38554680347442627},{"id":"https://openalex.org/keywords/markov-chain","display_name":"Markov chain","score":0.28325212001800537},{"id":"https://openalex.org/keywords/markov-model","display_name":"Markov model","score":0.16195592284202576},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1503828465938568},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.1432684361934662}],"concepts":[{"id":"https://openalex.org/C17098449","wikidata":"https://www.wikidata.org/wiki/Q176814","display_name":"Partially observable Markov decision process","level":4,"score":0.8502101302146912},{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.7858666181564331},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7352827787399292},{"id":"https://openalex.org/C36299963","wikidata":"https://www.wikidata.org/wiki/Q1369844","display_name":"Observability","level":2,"score":0.7069566249847412},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.5872738361358643},{"id":"https://openalex.org/C106189395","wikidata":"https://www.wikidata.org/wiki/Q176789","display_name":"Markov decision process","level":3,"score":0.5130754709243774},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4438014626502991},{"id":"https://openalex.org/C31170391","wikidata":"https://www.wikidata.org/wiki/Q188619","display_name":"Hierarchy","level":2,"score":0.4330514669418335},{"id":"https://openalex.org/C111030470","wikidata":"https://www.wikidata.org/wiki/Q1430460","display_name":"Curse of dimensionality","level":2,"score":0.4326602518558502},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.4277242124080658},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.4235248565673828},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.41318923234939575},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.38554680347442627},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.28325212001800537},{"id":"https://openalex.org/C163836022","wikidata":"https://www.wikidata.org/wiki/Q6771326","display_name":"Markov model","level":3,"score":0.16195592284202576},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1503828465938568},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.1432684361934662},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","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},{"id":"https://openalex.org/C34447519","wikidata":"https://www.wikidata.org/wiki/Q179522","display_name":"Market economy","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/humanoids.2015.7363566","is_oa":false,"landing_page_url":"https://doi.org/10.1109/humanoids.2015.7363566","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 IEEE-RAS 15th International Conference on Humanoid Robots (Humanoids)","raw_type":"proceedings-article"},{"id":"pmh:oai:pure.qub.ac.uk/portal:publications/80f97dd1-0509-41b1-b677-b88359b533a2","is_oa":false,"landing_page_url":"https://pure.qub.ac.uk/en/publications/80f97dd1-0509-41b1-b677-b88359b533a2","pdf_url":null,"source":{"id":"https://openalex.org/S4306402319","display_name":"Research Portal (Queen's University Belfast)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I126231945","host_organization_name":"Queen's University Belfast","host_organization_lineage":["https://openalex.org/I126231945"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Ngo, V & Toussaint, M 2015, Touch based POMDP manipulation via sequential submodular optimization. in 15th IEEE-RAS International Conference on Humanoid Robots, Humanoids 2015, Seoul, South Korea, November 3-5, 2015 : Humanoids. Institute of Electrical and Electronics Engineers Inc., pp. 407-413. https://doi.org/10.1109/HUMANOIDS.2015.7363566","raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","score":0.5600000023841858,"id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W2214249","https://openalex.org/W757502775","https://openalex.org/W1680189815","https://openalex.org/W2023509699","https://openalex.org/W2029828838","https://openalex.org/W2032100464","https://openalex.org/W2042408133","https://openalex.org/W2063987138","https://openalex.org/W2070683816","https://openalex.org/W2110322955","https://openalex.org/W2131824593","https://openalex.org/W2152706713","https://openalex.org/W2163700553","https://openalex.org/W2168359464","https://openalex.org/W2169294731","https://openalex.org/W2174072647","https://openalex.org/W2213416523","https://openalex.org/W2271240761","https://openalex.org/W2295605012","https://openalex.org/W2962795549","https://openalex.org/W3003506411","https://openalex.org/W6622242608","https://openalex.org/W6679608865","https://openalex.org/W6694098965","https://openalex.org/W7053442886"],"related_works":["https://openalex.org/W2096013579","https://openalex.org/W52153049","https://openalex.org/W1760611253","https://openalex.org/W1589140671","https://openalex.org/W1515117609","https://openalex.org/W4323315247","https://openalex.org/W2294884454","https://openalex.org/W3169161914","https://openalex.org/W4321379664","https://openalex.org/W2402949237"],"abstract_inverted_index":{"Exploiting":[0],"the":[1,67,74,77,96,112,132],"submodularity":[2,48,99],"of":[3,12,76,134],"entropy-related":[4],"objectives":[5],"has":[6,26],"recently":[7],"led":[8],"to":[9,30,106],"a":[10,45,52,122,126],"series":[11],"successes":[13],"in":[14,50,59],"machine":[15],"learning":[16],"and":[17,34,125],"sequential":[18],"decision":[19,86],"making.":[20],"Its":[21],"generalized":[22],"framework,":[23],"adaptive":[24,47,98],"submodularity,":[25],"later":[27],"been":[28],"introduced":[29],"deal":[31],"with":[32,40,73,111],"uncertainty":[33],"partially":[35,83],"observability,":[36],"achieving":[37],"near-optimal":[38],"performance":[39],"simple":[41],"greedy":[42],"policies.":[43],"As":[44],"consequence,":[46],"is":[49,104],"principle":[51],"promising":[53],"candidate":[54],"for":[55],"efficient":[56],"touch-based":[57],"localization":[58],"robotics.":[60],"However,":[61],"applying":[62],"that":[63],"method":[64],"directly":[65],"on":[66,120],"motion":[68],"level":[69],"shows":[70],"poor":[71],"scaling":[72],"dimensionality":[75],"system.":[78],"Being":[79],"motivated":[80],"by":[81],"hierarchical":[82],"observable":[84],"Markov":[85],"process":[87],"(POMDP)":[88],"planning,":[89],"we":[90],"integrate":[91],"an":[92,115],"action":[93,116],"hierarchy":[94],"into":[95],"existing":[97],"framework.":[100],"The":[101],"proposed":[102],"algorithm":[103],"expected":[105],"effectively":[107],"generate":[108],"uncertainty-reducing":[109],"actions":[110],"help":[113],"from":[114],"hierarchy.":[117],"Experimental":[118],"results":[119],"both,":[121],"simulated":[123],"robot":[124],"Willow":[127],"Garage":[128],"PR2":[129],"platform,":[130],"demonstrate":[131],"efficiency":[133],"our":[135],"algorithm.":[136]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}