{"id":"https://openalex.org/W2137774157","doi":"https://doi.org/10.1109/icra.2011.5980197","title":"A decentralized approach to multi-agent planning in the presence of constraints and uncertainty","display_name":"A decentralized approach to multi-agent planning in the presence of constraints and uncertainty","publication_year":2011,"publication_date":"2011-05-01","ids":{"openalex":"https://openalex.org/W2137774157","doi":"https://doi.org/10.1109/icra.2011.5980197","mag":"2137774157"},"language":"en","primary_location":{"id":"doi:10.1109/icra.2011.5980197","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icra.2011.5980197","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 IEEE International Conference on Robotics and Automation","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/A5010841313","display_name":"Aditya Undurti","orcid":null},"institutions":[{"id":"https://openalex.org/I46020346","display_name":"American Institute of Aeronautics and Astronautics","ror":"https://ror.org/00a1rzv11","country_code":"US","type":"other","lineage":["https://openalex.org/I46020346"]},{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Aditya Undurti","raw_affiliation_strings":["Aeronautics and Astronautics, Massachusetts Institute of Technology, USA"],"affiliations":[{"raw_affiliation_string":"Aeronautics and Astronautics, Massachusetts Institute of Technology, USA","institution_ids":["https://openalex.org/I46020346","https://openalex.org/I63966007"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5011665886","display_name":"Jonathan P. How","orcid":"https://orcid.org/0000-0001-8576-1930"},"institutions":[{"id":"https://openalex.org/I46020346","display_name":"American Institute of Aeronautics and Astronautics","ror":"https://ror.org/00a1rzv11","country_code":"US","type":"other","lineage":["https://openalex.org/I46020346"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jonathan P. How","raw_affiliation_strings":["Aeronautics and Astronautics, MIT, USA","MIT,USA"],"affiliations":[{"raw_affiliation_string":"Aeronautics and Astronautics, MIT, USA","institution_ids":["https://openalex.org/I46020346"]},{"raw_affiliation_string":"MIT,USA","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5010841313"],"corresponding_institution_ids":["https://openalex.org/I46020346","https://openalex.org/I63966007"],"apc_list":null,"apc_paid":null,"fwci":1.0303,"has_fulltext":false,"cited_by_count":14,"citation_normalized_percentile":{"value":0.80802208,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"2534","last_page":"2539"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9980999827384949,"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.9980999827384949,"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/T10906","display_name":"AI-based Problem Solving and Planning","score":0.9800999760627747,"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9642000198364258,"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/bounded-function","display_name":"Bounded function","score":0.7094103097915649},{"id":"https://openalex.org/keywords/markov-decision-process","display_name":"Markov decision process","score":0.6931338906288147},{"id":"https://openalex.org/keywords/decoupling","display_name":"Decoupling (probability)","score":0.6687528491020203},{"id":"https://openalex.org/keywords/independence","display_name":"Independence (probability theory)","score":0.6666280031204224},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6590094566345215},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6243178844451904},{"id":"https://openalex.org/keywords/partially-observable-markov-decision-process","display_name":"Partially observable Markov decision process","score":0.6000027656555176},{"id":"https://openalex.org/keywords/markov-process","display_name":"Markov process","score":0.5857821106910706},{"id":"https://openalex.org/keywords/decision-problem","display_name":"Decision problem","score":0.4742890000343323},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.4478764832019806},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.22097927331924438},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.1285988688468933},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.11376529932022095},{"id":"https://openalex.org/keywords/control-engineering","display_name":"Control engineering","score":0.09966275095939636}],"concepts":[{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.7094103097915649},{"id":"https://openalex.org/C106189395","wikidata":"https://www.wikidata.org/wiki/Q176789","display_name":"Markov decision process","level":3,"score":0.6931338906288147},{"id":"https://openalex.org/C205606062","wikidata":"https://www.wikidata.org/wiki/Q5249645","display_name":"Decoupling (probability)","level":2,"score":0.6687528491020203},{"id":"https://openalex.org/C35651441","wikidata":"https://www.wikidata.org/wiki/Q625303","display_name":"Independence (probability theory)","level":2,"score":0.6666280031204224},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6590094566345215},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6243178844451904},{"id":"https://openalex.org/C17098449","wikidata":"https://www.wikidata.org/wiki/Q176814","display_name":"Partially observable Markov decision process","level":4,"score":0.6000027656555176},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.5857821106910706},{"id":"https://openalex.org/C115988155","wikidata":"https://www.wikidata.org/wiki/Q3262192","display_name":"Decision problem","level":2,"score":0.4742890000343323},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.4478764832019806},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.22097927331924438},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.1285988688468933},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.11376529932022095},{"id":"https://openalex.org/C133731056","wikidata":"https://www.wikidata.org/wiki/Q4917288","display_name":"Control engineering","level":1,"score":0.09966275095939636},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icra.2011.5980197","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icra.2011.5980197","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 IEEE International Conference on Robotics and Automation","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","score":0.5299999713897705,"display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1597160459","https://openalex.org/W1624041045","https://openalex.org/W1860334796","https://openalex.org/W2101496914","https://openalex.org/W2102764452","https://openalex.org/W2110790702","https://openalex.org/W2119852681","https://openalex.org/W2127788848","https://openalex.org/W2138693458","https://openalex.org/W4232967792","https://openalex.org/W6635722945","https://openalex.org/W6636529261","https://openalex.org/W6678181239","https://openalex.org/W6679445762","https://openalex.org/W6680368953"],"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":{"We":[0,29,65,91],"address":[1],"the":[2,7,56,68,71,86,89],"problem":[3,19],"of":[4,9,15,39,73,88],"planning":[5],"in":[6],"presence":[8],"uncertainty":[10],"and":[11,49,80],"constraints":[12],"for":[13,31],"teams":[14],"unmanned":[16],"vehicles.":[17],"The":[18],"is":[20],"formulated":[21],"as":[22,47],"a":[23,34,42,51,59],"Constrained":[24],"Markov":[25],"Decision":[26],"Process":[27],"(C-MDP).":[28],"allow":[30],"plans":[32],"with":[33],"non-zero":[35],"but":[36],"bounded":[37],"probability":[38],"violating":[40],"constraints,":[41],"quantity":[43],"that":[44,54,98],"we":[45],"define":[46],"risk":[48,57,106],"provide":[50,92],"solution":[52],"technique":[53,100],"keeps":[55],"below":[58],"specified":[60],"threshold":[61],"while":[62,104],"optimizing":[63],"reward.":[64],"also":[66],"use":[67,81],"decoupling":[69],"between":[70],"dynamics":[72],"individual":[74],"agents":[75],"to":[76,84,96],"assume":[77],"transition":[78],"independence":[79],"this":[82],"assumption":[83],"reduce":[85],"complexity":[87],"problem.":[90],"representative":[93],"simulation":[94],"results":[95],"show":[97],"our":[99],"achieves":[101],"high":[102],"reward":[103],"keeping":[105],"bounded.":[107]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}