{"id":"https://openalex.org/W1964364586","doi":"https://doi.org/10.1109/cca.2013.6662753","title":"A distributed closed-loop probabilistic robust prioritized motion planning algorithm","display_name":"A distributed closed-loop probabilistic robust prioritized motion planning algorithm","publication_year":2013,"publication_date":"2013-08-01","ids":{"openalex":"https://openalex.org/W1964364586","doi":"https://doi.org/10.1109/cca.2013.6662753","mag":"1964364586"},"language":"en","primary_location":{"id":"doi:10.1109/cca.2013.6662753","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cca.2013.6662753","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 IEEE International Conference on Control Applications (CCA)","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/A5009071060","display_name":"Mangal Kothari","orcid":"https://orcid.org/0000-0003-4713-7832"},"institutions":[{"id":"https://openalex.org/I32394136","display_name":"Northumbria University","ror":"https://ror.org/049e6bc10","country_code":"GB","type":"education","lineage":["https://openalex.org/I32394136"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Mangal Kothari","raw_affiliation_strings":["Newcastle Upon Tyne, Northumbria University, UK","Northumbria University; Newcastle upon Tyne; UK"],"affiliations":[{"raw_affiliation_string":"Newcastle Upon Tyne, Northumbria University, UK","institution_ids":["https://openalex.org/I32394136"]},{"raw_affiliation_string":"Northumbria University; Newcastle upon Tyne; UK","institution_ids":["https://openalex.org/I32394136"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5014252229","display_name":"P. B. Sujit","orcid":"https://orcid.org/0000-0002-7297-1493"},"institutions":[{"id":"https://openalex.org/I119939252","display_name":"Indraprastha Institute of Information Technology Delhi","ror":"https://ror.org/03vfp4g33","country_code":"IN","type":"education","lineage":["https://openalex.org/I119939252"]},{"id":"https://openalex.org/I32394136","display_name":"Northumbria University","ror":"https://ror.org/049e6bc10","country_code":"GB","type":"education","lineage":["https://openalex.org/I32394136"]}],"countries":["GB","IN"],"is_corresponding":false,"raw_author_name":"P. B. Sujit","raw_affiliation_strings":["Newcastle Upon Tyne, Northumbria University, UK","Indraprastha Institute of Information Technology, New Delhi, India"],"affiliations":[{"raw_affiliation_string":"Newcastle Upon Tyne, Northumbria University, UK","institution_ids":["https://openalex.org/I32394136"]},{"raw_affiliation_string":"Indraprastha Institute of Information Technology, New Delhi, India","institution_ids":["https://openalex.org/I119939252"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5007050558","display_name":"Ian Postlethwaite","orcid":"https://orcid.org/0000-0002-0267-1831"},"institutions":[{"id":"https://openalex.org/I32394136","display_name":"Northumbria University","ror":"https://ror.org/049e6bc10","country_code":"GB","type":"education","lineage":["https://openalex.org/I32394136"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Ian Postlethwaite","raw_affiliation_strings":["Newcastle Upon Tyne, Northumbria University, UK","Northumbria University; Newcastle upon Tyne; UK"],"affiliations":[{"raw_affiliation_string":"Newcastle Upon Tyne, Northumbria University, UK","institution_ids":["https://openalex.org/I32394136"]},{"raw_affiliation_string":"Northumbria University; Newcastle upon Tyne; UK","institution_ids":["https://openalex.org/I32394136"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5009071060"],"corresponding_institution_ids":["https://openalex.org/I32394136"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.04532159,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"115","last_page":"121"},"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/T10906","display_name":"AI-based Problem Solving and Planning","score":0.9934999942779541,"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/T10142","display_name":"Formal Methods in Verification","score":0.991599977016449,"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/motion-planning","display_name":"Motion planning","score":0.7001419067382812},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.6912700533866882},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6867889165878296},{"id":"https://openalex.org/keywords/planner","display_name":"Planner","score":0.5942813158035278},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5862302184104919},{"id":"https://openalex.org/keywords/probabilistic-roadmap","display_name":"Probabilistic roadmap","score":0.5713796019554138},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4890619218349457},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.48786497116088867},{"id":"https://openalex.org/keywords/bandwidth","display_name":"Bandwidth (computing)","score":0.4839623272418976},{"id":"https://openalex.org/keywords/nonlinear-system","display_name":"Nonlinear system","score":0.4539690613746643},{"id":"https://openalex.org/keywords/gaussian","display_name":"Gaussian","score":0.42550498247146606},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.35095494985580444},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.29733625054359436},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.27311408519744873},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2038198709487915}],"concepts":[{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.7001419067382812},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.6912700533866882},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6867889165878296},{"id":"https://openalex.org/C2776999362","wikidata":"https://www.wikidata.org/wiki/Q2349274","display_name":"Planner","level":2,"score":0.5942813158035278},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5862302184104919},{"id":"https://openalex.org/C2778803389","wikidata":"https://www.wikidata.org/wiki/Q7246866","display_name":"Probabilistic roadmap","level":4,"score":0.5713796019554138},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4890619218349457},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.48786497116088867},{"id":"https://openalex.org/C2776257435","wikidata":"https://www.wikidata.org/wiki/Q1576430","display_name":"Bandwidth (computing)","level":2,"score":0.4839623272418976},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.4539690613746643},{"id":"https://openalex.org/C163716315","wikidata":"https://www.wikidata.org/wiki/Q901177","display_name":"Gaussian","level":2,"score":0.42550498247146606},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35095494985580444},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.29733625054359436},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.27311408519744873},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2038198709487915},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cca.2013.6662753","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cca.2013.6662753","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 IEEE International Conference on Control Applications (CCA)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","score":0.6200000047683716,"id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W1424654272","https://openalex.org/W1964644507","https://openalex.org/W1977931412","https://openalex.org/W1983972263","https://openalex.org/W2003835006","https://openalex.org/W2007806954","https://openalex.org/W2046674048","https://openalex.org/W2067778155","https://openalex.org/W2101496914","https://openalex.org/W2106716938","https://openalex.org/W2114127526","https://openalex.org/W2132004142","https://openalex.org/W2138693458","https://openalex.org/W2145432448","https://openalex.org/W2149716029","https://openalex.org/W2150765347","https://openalex.org/W2151548885","https://openalex.org/W2151910862"],"related_works":["https://openalex.org/W2060743914","https://openalex.org/W2107702345","https://openalex.org/W2137520303","https://openalex.org/W1536392978","https://openalex.org/W2216928063","https://openalex.org/W2389713625","https://openalex.org/W2134348961","https://openalex.org/W4308217561","https://openalex.org/W2115192598","https://openalex.org/W2160419405"],"abstract_inverted_index":{"This":[0],"paper":[1,145],"addresses":[2],"the":[3,12,30,49,67,78,93,127,132,147],"problem":[4],"of":[5,14,129,157],"large":[6,103,172],"scale":[7,173],"multi-agent":[8,174],"motion":[9,42],"planning":[10],"in":[11,101,131],"presence":[13],"various":[15],"uncertainties":[16],"and":[17,58,89],"under":[18,105,176],"limited":[19],"communication":[20,106],"bandwidth.":[21],"Obtaining":[22],"an":[23],"optimal":[24],"solution":[25],"while":[26],"simultaneously":[27],"addressing":[28],"all":[29],"issues":[31],"is":[32,114],"a":[33,40,102,110,137,163],"difficult":[34],"problem.":[35],"Towards":[36],"this,":[37],"we":[38,62,76,91,135],"develop":[39],"decentralized":[41],"planner":[43],"that":[44],"combines":[45],"probabilistic":[46],"approaches":[47],"including":[48],"rapidly-exploring":[50],"random":[51],"tree":[52],"(RRT),":[53],"chance":[54,68],"constraint,":[55],"overlapping":[56,79],"coefficient":[57,80],"birthday":[59,94],"paradox.":[60],"First,":[61],"use":[63,77,92,136],"RRT":[64],"along":[65],"with":[66],"constraint":[69],"approach":[70,113,149],"to":[71,82,96,116,140,150,161],"identify":[72],"robust":[73],"paths.":[74],"Second,":[75],"technique":[81],"detect":[83,97],"conflicts":[84,98],"between":[85,99],"multiple":[86],"agent":[87],"paths":[88,170],"third,":[90],"paradox":[95],"agents":[100],"team":[104],"bandwidth":[107],"constraints.":[108],"Finally,":[109],"priority":[111],"based":[112],"employed":[115],"resolve":[117],"conflicts.":[118],"These":[119],"steps":[120],"are":[121],"carried":[122],"out":[123],"sequentially.":[124],"To":[125],"manage":[126],"level":[128],"uncertainty":[130],"path":[133],"planner,":[134],"closed-loop":[138],"system":[139],"predict":[141],"future":[142],"distributions.":[143],"Our":[144],"extends":[146],"prediction":[148],"nonlinear":[151],"Gaussian":[152],"systems.":[153],"We":[154],"describe":[155],"details":[156],"integrating":[158],"these":[159],"techniques":[160],"create":[162],"complete":[164],"framework":[165],"for":[166,171],"determining":[167],"computationally":[168],"efficient":[169],"systems":[175],"uncertainty.":[177]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}