{"id":"https://openalex.org/W2213416523","doi":"https://doi.org/10.1109/iros.2015.7353381","title":"POMDP manipulation via trajectory optimization","display_name":"POMDP manipulation via trajectory optimization","publication_year":2015,"publication_date":"2015-09-01","ids":{"openalex":"https://openalex.org/W2213416523","doi":"https://doi.org/10.1109/iros.2015.7353381","mag":"2213416523"},"language":"en","primary_location":{"id":"doi:10.1109/iros.2015.7353381","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iros.2015.7353381","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)","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 and Robotics Lab, University of Stuttgart, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Machine Learning and 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 and Robotics Lab, University of Stuttgart, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Machine Learning and 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":12,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":"abs 1407 414","issue":null,"first_page":"242","last_page":"249"},"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/T10653","display_name":"Robot Manipulation and Learning","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems 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/T10462","display_name":"Reinforcement Learning in Robotics","score":0.9988999962806702,"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/partially-observable-markov-decision-process","display_name":"Partially observable Markov decision process","score":0.9140732884407043},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7848596572875977},{"id":"https://openalex.org/keywords/trajectory","display_name":"Trajectory","score":0.7590187788009644},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.6939744353294373},{"id":"https://openalex.org/keywords/trajectory-optimization","display_name":"Trajectory optimization","score":0.5602449178695679},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5395338535308838},{"id":"https://openalex.org/keywords/markov-decision-process","display_name":"Markov decision process","score":0.5245956778526306},{"id":"https://openalex.org/keywords/abstraction","display_name":"Abstraction","score":0.5177085399627686},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.46788209676742554},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4564720094203949},{"id":"https://openalex.org/keywords/markov-process","display_name":"Markov process","score":0.34398922324180603},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.3136425018310547},{"id":"https://openalex.org/keywords/markov-chain","display_name":"Markov chain","score":0.25867950916290283},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.224526047706604},{"id":"https://openalex.org/keywords/optimal-control","display_name":"Optimal control","score":0.21888405084609985},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.18159091472625732},{"id":"https://openalex.org/keywords/markov-model","display_name":"Markov model","score":0.17443042993545532},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1337350606918335}],"concepts":[{"id":"https://openalex.org/C17098449","wikidata":"https://www.wikidata.org/wiki/Q176814","display_name":"Partially observable Markov decision process","level":4,"score":0.9140732884407043},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7848596572875977},{"id":"https://openalex.org/C13662910","wikidata":"https://www.wikidata.org/wiki/Q193139","display_name":"Trajectory","level":2,"score":0.7590187788009644},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.6939744353294373},{"id":"https://openalex.org/C173246807","wikidata":"https://www.wikidata.org/wiki/Q7833062","display_name":"Trajectory optimization","level":3,"score":0.5602449178695679},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5395338535308838},{"id":"https://openalex.org/C106189395","wikidata":"https://www.wikidata.org/wiki/Q176789","display_name":"Markov decision process","level":3,"score":0.5245956778526306},{"id":"https://openalex.org/C124304363","wikidata":"https://www.wikidata.org/wiki/Q673661","display_name":"Abstraction","level":2,"score":0.5177085399627686},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.46788209676742554},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4564720094203949},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.34398922324180603},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3136425018310547},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.25867950916290283},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.224526047706604},{"id":"https://openalex.org/C91575142","wikidata":"https://www.wikidata.org/wiki/Q1971426","display_name":"Optimal control","level":2,"score":0.21888405084609985},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.18159091472625732},{"id":"https://openalex.org/C163836022","wikidata":"https://www.wikidata.org/wiki/Q6771326","display_name":"Markov model","level":3,"score":0.17443042993545532},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1337350606918335},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","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/C1276947","wikidata":"https://www.wikidata.org/wiki/Q333","display_name":"Astronomy","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}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/iros.2015.7353381","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iros.2015.7353381","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)","raw_type":"proceedings-article"},{"id":"pmh:oai:pure.qub.ac.uk/portal:publications/10f8b956-5cb8-44f0-a848-77da9ce3adac","is_oa":false,"landing_page_url":"https://pure.qub.ac.uk/en/publications/10f8b956-5cb8-44f0-a848-77da9ce3adac","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, POMDP manipulation via trajectory optimization. in 2015 IEEE/RSJ International Conference on Intelligent Robots and Systems: Proceedings (IROS). pp. 242-249. https://doi.org/10.1109/IROS.2015.7353381","raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/15","score":0.4300000071525574,"display_name":"Life in Land"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":45,"referenced_works":["https://openalex.org/W2214249","https://openalex.org/W658381347","https://openalex.org/W757502775","https://openalex.org/W1249953932","https://openalex.org/W1529817735","https://openalex.org/W1539216098","https://openalex.org/W1969583232","https://openalex.org/W2004116378","https://openalex.org/W2015034312","https://openalex.org/W2023509699","https://openalex.org/W2025752438","https://openalex.org/W2034469604","https://openalex.org/W2042408133","https://openalex.org/W2063987138","https://openalex.org/W2070683816","https://openalex.org/W2092950191","https://openalex.org/W2102883217","https://openalex.org/W2114280243","https://openalex.org/W2116459397","https://openalex.org/W2121616705","https://openalex.org/W2125693618","https://openalex.org/W2136237198","https://openalex.org/W2161697934","https://openalex.org/W2162000109","https://openalex.org/W2163700553","https://openalex.org/W2164429173","https://openalex.org/W2168359464","https://openalex.org/W2169294731","https://openalex.org/W2174072647","https://openalex.org/W2271240761","https://openalex.org/W2290288804","https://openalex.org/W2295605012","https://openalex.org/W2983963859","https://openalex.org/W3029645440","https://openalex.org/W4230405224","https://openalex.org/W4232554840","https://openalex.org/W4301014524","https://openalex.org/W6622242608","https://openalex.org/W6631664056","https://openalex.org/W6683526187","https://openalex.org/W6685200453","https://openalex.org/W6694098965","https://openalex.org/W6697466066","https://openalex.org/W6769537543","https://openalex.org/W6812115717"],"related_works":["https://openalex.org/W2096013579","https://openalex.org/W52153049","https://openalex.org/W1760611253","https://openalex.org/W1589140671","https://openalex.org/W2951545791","https://openalex.org/W1515117609","https://openalex.org/W2294884454","https://openalex.org/W4323315247","https://openalex.org/W3169161914","https://openalex.org/W4321379664"],"abstract_inverted_index":{"Efficient":[0],"object":[1],"manipulation":[2],"based":[3],"only":[4,101],"on":[5,198],"force":[6],"feedback":[7],"typically":[8],"requires":[9],"a":[10,32,53,58,112,167,199,206],"plan":[11],"of":[12,48,138,165,170,230],"actively":[13],"contact-seeking":[14],"actions":[15,185],"to":[16,57,135,179],"reduce":[17],"uncertainty":[18,87],"over":[19,88],"the":[20,46,122,175,190,195],"true":[21],"environmental":[22],"model.":[23,192],"In":[24,77],"principle,":[25],"that":[26,215],"problem":[27],"could":[28,219],"be":[29],"formulated":[30],"as":[31],"full":[33,146],"partially":[34],"observable":[35],"Markov":[36],"decision":[37],"process":[38],"(POMDP)":[39],"whose":[40],"observations":[41],"are":[42,81],"sensed":[43],"forces":[44],"indicating":[45],"presence/absence":[47],"contacts":[49,90,222],"with":[50,62,91],"objects.":[51],"Such":[52],"naive":[54],"application":[55],"leads":[56],"very":[59],"large":[60,72,168],"POMDP":[61,143,147,191],"high-dimensional":[63,94],"continuous":[64,95],"state,":[65],"action":[66],"and":[67,205,226],"observation":[68],"spaces.":[69],"Solving":[70],"such":[71],"POMDPs":[73],"is":[74,111,149,158],"practically":[75],"prohibitive.":[76],"other":[78],"words,":[79],"we":[80,177],"facing":[82],"three":[83],"challenging":[84],"problems:":[85],"1)":[86],"discontinuous":[89],"objects;":[92],"2)":[93],"spaces;":[96],"3)":[97],"optimization":[98,110,140,163],"for":[99,116],"not":[100],"trajectory":[102,109,139,162],"cost":[103],"but":[104],"also":[105],"execution":[106],"time.":[107],"As":[108],"powerful":[113],"model-based":[114],"method":[115,197,218],"motion":[117],"generation,":[118],"it":[119],"can":[120],"handle":[121],"last":[123],"two":[124],"issues":[125],"effectively":[126,220],"by":[127],"computing":[128],"locally":[129],"optimal":[130],"trajectories.":[131],"This":[132],"paper":[133],"aims":[134],"integrate":[136,180],"advantages":[137],"into":[141,189],"existing":[142],"solvers.":[144],"The":[145,212],"formulation":[148],"solved":[150],"using":[151],"sample-based":[152],"approaches,":[153],"where":[154],"each":[155],"sampled":[156],"model":[157],"quickly":[159],"evaluated":[160],"via":[161],"instead":[164],"simulating":[166],"number":[169],"rollouts.":[171],"To":[172],"further":[173],"accelerate":[174],"solver,":[176],"propose":[178],"temporal":[181,187],"abstraction,":[182],"i.e.":[183],"macro":[184],"or":[186],"actions,":[188],"We":[193],"demonstrate":[194],"proposed":[196,217],"simulated":[200],"7":[201],"DoF":[202],"KUKA":[203],"arm":[204],"physical":[207],"Willow":[208],"Garage":[209],"PR2":[210],"platform.":[211],"results":[213],"show":[214],"our":[216],"seek":[221],"in":[223],"complex":[224],"scenarios,":[225],"achieve":[227],"near-optimal":[228],"performance":[229],"path":[231],"planing.":[232]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}